/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:42:55,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:42:55,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:42:55,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:42:55,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:42:55,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:42:55,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:42:55,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:42:55,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:42:55,923 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:42:55,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:42:55,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:42:55,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:42:55,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:42:55,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:42:55,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:42:55,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:42:55,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:42:55,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:42:55,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:42:55,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:42:55,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:42:55,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:42:55,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:42:55,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:42:55,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:42:55,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:42:55,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:42:55,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:42:55,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:42:55,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:42:55,956 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:42:55,957 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:42:55,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:42:55,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:42:55,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:42:55,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:42:55,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:42:55,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:42:55,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:42:55,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:42:55,961 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:42:55,992 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:42:55,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:42:56,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:42:56,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:42:56,005 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:42:56,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:42:56,006 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:42:56,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:42:56,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:42:56,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:42:56,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:42:56,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:42:56,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:42:56,008 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:42:56,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:42:56,008 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:42:56,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:42:56,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:42:56,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:42:56,008 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:42:56,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:42:56,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:42:56,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:42:56,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:42:56,009 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:42:56,009 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:42:56,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:42:56,009 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:42:56,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:42:56,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:42:56,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:42:56,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:42:56,341 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:42:56,342 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:42:56,343 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:42:57,377 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:42:57,692 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:42:57,693 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:42:57,703 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9f128850/aab26258d14347838878cadd6e8f6dc8/FLAG392aa6b77 [2022-12-06 06:42:57,718 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9f128850/aab26258d14347838878cadd6e8f6dc8 [2022-12-06 06:42:57,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:42:57,721 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:42:57,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:42:57,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:42:57,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:42:57,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:42:57" (1/1) ... [2022-12-06 06:42:57,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2813422a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:57, skipping insertion in model container [2022-12-06 06:42:57,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:42:57" (1/1) ... [2022-12-06 06:42:57,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:42:57,779 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:42:57,897 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-06 06:42:58,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:42:58,146 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:42:58,158 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-06 06:42:58,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:42:58,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:42:58,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:42:58,264 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:42:58,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:58 WrapperNode [2022-12-06 06:42:58,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:42:58,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:42:58,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:42:58,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:42:58,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:58" (1/1) ... [2022-12-06 06:42:58,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:58" (1/1) ... [2022-12-06 06:42:58,342 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-06 06:42:58,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:42:58,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:42:58,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:42:58,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:42:58,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:58" (1/1) ... [2022-12-06 06:42:58,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:58" (1/1) ... [2022-12-06 06:42:58,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:58" (1/1) ... [2022-12-06 06:42:58,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:58" (1/1) ... [2022-12-06 06:42:58,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:58" (1/1) ... [2022-12-06 06:42:58,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:58" (1/1) ... [2022-12-06 06:42:58,383 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:58" (1/1) ... [2022-12-06 06:42:58,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:58" (1/1) ... [2022-12-06 06:42:58,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:42:58,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:42:58,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:42:58,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:42:58,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:58" (1/1) ... [2022-12-06 06:42:58,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:42:58,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:42:58,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:42:58,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:42:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:42:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:42:58,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:42:58,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:42:58,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:42:58,493 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:42:58,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:42:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:42:58,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:42:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:42:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:42:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:42:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:42:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:42:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:42:58,496 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:42:58,693 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:42:58,694 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:42:59,084 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:42:59,276 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:42:59,276 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:42:59,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:42:59 BoogieIcfgContainer [2022-12-06 06:42:59,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:42:59,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:42:59,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:42:59,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:42:59,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:42:57" (1/3) ... [2022-12-06 06:42:59,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2a1cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:42:59, skipping insertion in model container [2022-12-06 06:42:59,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:42:58" (2/3) ... [2022-12-06 06:42:59,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2a1cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:42:59, skipping insertion in model container [2022-12-06 06:42:59,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:42:59" (3/3) ... [2022-12-06 06:42:59,286 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:42:59,302 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:42:59,303 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:42:59,303 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:42:59,359 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:42:59,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 233 flow [2022-12-06 06:42:59,441 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-06 06:42:59,442 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:42:59,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-06 06:42:59,448 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 233 flow [2022-12-06 06:42:59,453 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2022-12-06 06:42:59,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:42:59,481 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-06 06:42:59,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 221 flow [2022-12-06 06:42:59,543 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-06 06:42:59,543 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:42:59,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-06 06:42:59,548 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-06 06:42:59,548 INFO L188 LiptonReduction]: Number of co-enabled transitions 2022 [2022-12-06 06:43:04,557 INFO L203 LiptonReduction]: Total number of compositions: 82 [2022-12-06 06:43:04,571 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:43:04,576 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;@4741baec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:43:04,576 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:43:04,579 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-06 06:43:04,580 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:43:04,580 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:43:04,580 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:43:04,581 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:43:04,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:43:04,585 INFO L85 PathProgramCache]: Analyzing trace with hash 518126068, now seen corresponding path program 1 times [2022-12-06 06:43:04,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:43:04,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28056162] [2022-12-06 06:43:04,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:43:04,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:43:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:43:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:43:04,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:43:04,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28056162] [2022-12-06 06:43:04,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28056162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:43:04,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:43:04,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:43:04,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500203808] [2022-12-06 06:43:04,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:43:04,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:43:04,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:43:04,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:43:04,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:43:04,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 06:43:04,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:04,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:43:04,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 06:43:04,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:43:05,506 INFO L130 PetriNetUnfolder]: 1721/2724 cut-off events. [2022-12-06 06:43:05,506 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-06 06:43:05,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5317 conditions, 2724 events. 1721/2724 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14425 event pairs, 290 based on Foata normal form. 0/2460 useless extension candidates. Maximal degree in co-relation 5306. Up to 2026 conditions per place. [2022-12-06 06:43:05,523 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 33 selfloop transitions, 2 changer transitions 6/42 dead transitions. [2022-12-06 06:43:05,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 178 flow [2022-12-06 06:43:05,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:43:05,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:43:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 06:43:05,533 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 06:43:05,534 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 49 transitions. [2022-12-06 06:43:05,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 178 flow [2022-12-06 06:43:05,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:43:05,538 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 54 flow [2022-12-06 06:43:05,540 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2022-12-06 06:43:05,543 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-06 06:43:05,543 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:43:05,544 INFO L89 Accepts]: Start accepts. Operand has 34 places, 22 transitions, 54 flow [2022-12-06 06:43:05,546 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:43:05,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:43:05,546 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 22 transitions, 54 flow [2022-12-06 06:43:05,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 54 flow [2022-12-06 06:43:05,552 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-06 06:43:05,552 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:43:05,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:43:05,553 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 54 flow [2022-12-06 06:43:05,553 INFO L188 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-06 06:43:05,672 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:43:05,674 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-06 06:43:05,674 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2022-12-06 06:43:05,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:05,674 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:43:05,674 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:43:05,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:43:05,675 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:43:05,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:43:05,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1983591360, now seen corresponding path program 1 times [2022-12-06 06:43:05,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:43:05,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386975012] [2022-12-06 06:43:05,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:43:05,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:43:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:43:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:43:05,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:43:05,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386975012] [2022-12-06 06:43:05,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386975012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:43:05,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:43:05,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:43:05,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833100724] [2022-12-06 06:43:05,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:43:05,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:43:05,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:43:05,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:43:05,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:43:05,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 06:43:05,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:05,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:43:05,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 06:43:05,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:43:06,119 INFO L130 PetriNetUnfolder]: 958/1442 cut-off events. [2022-12-06 06:43:06,119 INFO L131 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2022-12-06 06:43:06,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3064 conditions, 1442 events. 958/1442 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6374 event pairs, 418 based on Foata normal form. 60/1499 useless extension candidates. Maximal degree in co-relation 3054. Up to 851 conditions per place. [2022-12-06 06:43:06,128 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2022-12-06 06:43:06,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 154 flow [2022-12-06 06:43:06,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:43:06,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:43:06,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 06:43:06,129 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2022-12-06 06:43:06,129 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 38 transitions. [2022-12-06 06:43:06,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 154 flow [2022-12-06 06:43:06,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:43:06,131 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2022-12-06 06:43:06,131 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-12-06 06:43:06,132 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -5 predicate places. [2022-12-06 06:43:06,132 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:43:06,132 INFO L89 Accepts]: Start accepts. Operand has 32 places, 22 transitions, 58 flow [2022-12-06 06:43:06,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:43:06,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:43:06,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 22 transitions, 58 flow [2022-12-06 06:43:06,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 22 transitions, 58 flow [2022-12-06 06:43:06,137 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-06 06:43:06,137 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:43:06,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:43:06,138 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 22 transitions, 58 flow [2022-12-06 06:43:06,138 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-06 06:43:06,161 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:43:06,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 06:43:06,162 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2022-12-06 06:43:06,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:06,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:43:06,163 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:43:06,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:43:06,163 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:43:06,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:43:06,163 INFO L85 PathProgramCache]: Analyzing trace with hash -543635519, now seen corresponding path program 1 times [2022-12-06 06:43:06,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:43:06,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447024739] [2022-12-06 06:43:06,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:43:06,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:43:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:43:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:43:06,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:43:06,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447024739] [2022-12-06 06:43:06,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447024739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:43:06,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:43:06,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:43:06,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177304039] [2022-12-06 06:43:06,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:43:06,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:43:06,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:43:06,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:43:06,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:43:06,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 06:43:06,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:06,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:43:06,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 06:43:06,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:43:06,641 INFO L130 PetriNetUnfolder]: 929/1401 cut-off events. [2022-12-06 06:43:06,641 INFO L131 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2022-12-06 06:43:06,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 1401 events. 929/1401 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5861 event pairs, 213 based on Foata normal form. 12/1409 useless extension candidates. Maximal degree in co-relation 3043. Up to 1089 conditions per place. [2022-12-06 06:43:06,651 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 29 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2022-12-06 06:43:06,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 143 flow [2022-12-06 06:43:06,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:43:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:43:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 06:43:06,653 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2022-12-06 06:43:06,653 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 3 states and 35 transitions. [2022-12-06 06:43:06,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 143 flow [2022-12-06 06:43:06,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 137 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:43:06,654 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 62 flow [2022-12-06 06:43:06,655 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-06 06:43:06,655 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -4 predicate places. [2022-12-06 06:43:06,655 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:43:06,655 INFO L89 Accepts]: Start accepts. Operand has 33 places, 22 transitions, 62 flow [2022-12-06 06:43:06,656 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:43:06,656 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:43:06,656 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 62 flow [2022-12-06 06:43:06,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 62 flow [2022-12-06 06:43:06,661 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-06 06:43:06,661 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:43:06,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 22 events. 0/22 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:43:06,662 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 62 flow [2022-12-06 06:43:06,662 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 06:43:06,663 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:43:06,664 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 06:43:06,664 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 62 flow [2022-12-06 06:43:06,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:06,664 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:43:06,664 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:43:06,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:43:06,665 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:43:06,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:43:06,665 INFO L85 PathProgramCache]: Analyzing trace with hash -332809833, now seen corresponding path program 1 times [2022-12-06 06:43:06,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:43:06,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811932799] [2022-12-06 06:43:06,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:43:06,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:43:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:43:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:43:07,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:43:07,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811932799] [2022-12-06 06:43:07,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811932799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:43:07,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:43:07,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:43:07,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409371361] [2022-12-06 06:43:07,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:43:07,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:43:07,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:43:07,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:43:07,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:43:07,365 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:43:07,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 62 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:07,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:43:07,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:43:07,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:43:07,813 INFO L130 PetriNetUnfolder]: 1310/1943 cut-off events. [2022-12-06 06:43:07,813 INFO L131 PetriNetUnfolder]: For 271/271 co-relation queries the response was YES. [2022-12-06 06:43:07,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4362 conditions, 1943 events. 1310/1943 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8493 event pairs, 182 based on Foata normal form. 9/1952 useless extension candidates. Maximal degree in co-relation 4350. Up to 1168 conditions per place. [2022-12-06 06:43:07,826 INFO L137 encePairwiseOnDemand]: 11/22 looper letters, 44 selfloop transitions, 16 changer transitions 0/60 dead transitions. [2022-12-06 06:43:07,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 60 transitions, 277 flow [2022-12-06 06:43:07,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:43:07,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:43:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-06 06:43:07,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5636363636363636 [2022-12-06 06:43:07,828 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 62 flow. Second operand 5 states and 62 transitions. [2022-12-06 06:43:07,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 60 transitions, 277 flow [2022-12-06 06:43:07,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 60 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:43:07,830 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 175 flow [2022-12-06 06:43:07,831 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2022-12-06 06:43:07,831 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2022-12-06 06:43:07,831 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:43:07,832 INFO L89 Accepts]: Start accepts. Operand has 38 places, 36 transitions, 175 flow [2022-12-06 06:43:07,832 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:43:07,833 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:43:07,833 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 36 transitions, 175 flow [2022-12-06 06:43:07,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 36 transitions, 175 flow [2022-12-06 06:43:07,911 INFO L130 PetriNetUnfolder]: 205/425 cut-off events. [2022-12-06 06:43:07,912 INFO L131 PetriNetUnfolder]: For 129/147 co-relation queries the response was YES. [2022-12-06 06:43:07,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 425 events. 205/425 cut-off events. For 129/147 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2257 event pairs, 90 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 1099. Up to 239 conditions per place. [2022-12-06 06:43:07,916 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 36 transitions, 175 flow [2022-12-06 06:43:07,916 INFO L188 LiptonReduction]: Number of co-enabled transitions 256 [2022-12-06 06:43:08,275 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] L794-->L797: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [396] L768-->L775: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_56 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_66 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_183 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse5 (not (= 0 (mod v_~y$w_buff0_used~0_184 256))))) (.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_173 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd1~0_66) v_~y$r_buff0_thd1~0_65) (= (ite .cse1 0 v_~y$w_buff0_used~0_184) v_~y$w_buff0_used~0_183) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_173) v_~y$w_buff1_used~0_172) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_172 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd1~0_65 256) 0)))) 0 v_~y$r_buff1_thd1~0_56) v_~y$r_buff1_thd1~0_55) (= v_~y~0_143 (ite .cse1 v_~y$w_buff0~0_78 (ite .cse2 v_~y$w_buff1~0_77 v_~y~0_144)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_184, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_78, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_66, ~y~0=v_~y~0_144, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_173} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_55, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_183, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_78, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_65, ~y~0=v_~y~0_143, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_172} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:43:08,424 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] L794-->L797: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [394] L745-->L752: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_50 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_60 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_167 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_168 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_157 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_156 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_157)) (= (ite .cse2 0 v_~y$w_buff0_used~0_168) v_~y$w_buff0_used~0_167) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_156 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd1~0_59 256) 0)))) 0 v_~y$r_buff1_thd1~0_50) v_~y$r_buff1_thd1~0_49) (= v_~y$r_buff0_thd1~0_59 (ite .cse0 0 v_~y$r_buff0_thd1~0_60)) (= (ite .cse2 v_~y$w_buff0~0_68 (ite .cse1 v_~y$w_buff1~0_67 v_~y~0_126)) v_~y~0_125)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_168, ~y$w_buff1~0=v_~y$w_buff1~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_60, ~y~0=v_~y~0_126, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_157} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_49, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_167, ~y$w_buff1~0=v_~y$w_buff1~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_59, ~y~0=v_~y~0_125, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_156} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:43:08,500 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] L794-->L797: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [395] L752-->L768: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd1~0_74 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd1~0_84 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and (= (mod v_~y$w_buff1_used~0_213 256) 0) .cse8)) (.cse4 (and .cse11 .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_226 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and (not .cse12) .cse9))) (let ((.cse0 (ite .cse5 v_~y~0_187 (ite .cse6 v_~y$w_buff0~0_109 v_~y$w_buff1~0_112))) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_225 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_212 256) 0))) (and (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_27) (= .cse0 v_~__unbuffered_p0_EAX~0_20) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_92) (= v_~y~0_187 v_~y$mem_tmp~0_50) (= v_~y$w_buff1_used~0_212 (ite .cse1 v_~y$w_buff1_used~0_213 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_213 0))) (= 0 v_~y$flush_delayed~0_65) (= v_~y$w_buff1~0_112 v_~y$w_buff1~0_111) (= (ite .cse1 v_~y$w_buff0_used~0_226 (ite .cse5 v_~y$w_buff0_used~0_226 (ite .cse6 0 v_~y$w_buff0_used~0_226))) v_~y$w_buff0_used~0_225) (= v_~y~0_185 (ite .cse1 v_~y$mem_tmp~0_50 .cse0)) (= v_~y$r_buff0_thd1~0_83 (ite .cse1 v_~y$r_buff0_thd1~0_84 (ite (or .cse3 .cse4 (and .cse7 .cse8)) v_~y$r_buff0_thd1~0_84 (ite (and (not .cse3) .cse9) 0 v_~y$r_buff0_thd1~0_84)))) (= (ite .cse1 v_~y$r_buff1_thd1~0_74 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd1~0_83 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse10 .cse7))) v_~y$r_buff1_thd1~0_74 0)) v_~y$r_buff1_thd1~0_73) (= v_~y$w_buff0~0_109 v_~y$w_buff0~0_108)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_226, ~y$w_buff1~0=v_~y$w_buff1~0_112, ~y$w_buff0~0=v_~y$w_buff0~0_109, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~y~0=v_~y~0_187, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_213} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_225, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_73, ~weak$$choice0~0=v_~weak$$choice0~0_27, ~y$mem_tmp~0=v_~y$mem_tmp~0_50, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, ~y$flush_delayed~0=v_~y$flush_delayed~0_65, ~y~0=v_~y~0_185, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_212} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] [2022-12-06 06:43:08,660 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] L794-->L797: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [378] L864-->L870: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_52 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_60 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_197 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_187 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_198 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd0~0_60) v_~y$r_buff0_thd0~0_59) (= v_~y$w_buff1_used~0_186 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_187)) (= v_~y~0_157 (ite .cse2 v_~y$w_buff0~0_86 (ite .cse1 v_~y$w_buff1~0_89 v_~y~0_158))) (= (ite .cse2 0 v_~y$w_buff0_used~0_198) v_~y$w_buff0_used~0_197) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_186 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_59 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_52) v_~y$r_buff1_thd0~0_51)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_198, ~y$w_buff1~0=v_~y$w_buff1~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y~0=v_~y~0_158, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_187} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_197, ~y$w_buff1~0=v_~y$w_buff1~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_59, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y~0=v_~y~0_157, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_186} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:43:08,739 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] L794-->L797: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [410] L814-->L830: Formula: (let ((.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd3~0_62 256) 0))) (let ((.cse10 (not .cse9)) (.cse12 (= (mod v_~y$w_buff0_used~0_218 256) 0)) (.cse8 (and .cse5 .cse9)) (.cse11 (and (= (mod v_~y$w_buff1_used~0_205 256) 0) .cse9))) (let ((.cse1 (or .cse12 .cse8 .cse11)) (.cse2 (and (not .cse12) .cse10))) (let ((.cse6 (= (mod v_~y$w_buff1_used~0_204 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_90 256) 0))) (.cse7 (= (mod v_~y$w_buff0_used~0_217 256) 0)) (.cse3 (ite .cse1 v_~y~0_178 (ite .cse2 v_~y$w_buff0~0_103 v_~y$w_buff1~0_106)))) (and (= (ite .cse0 v_~y$w_buff0_used~0_218 (ite .cse1 v_~y$w_buff0_used~0_218 (ite .cse2 0 v_~y$w_buff0_used~0_218))) v_~y$w_buff0_used~0_217) (= v_~y~0_177 (ite .cse0 v_~y$mem_tmp~0_48 .cse3)) (= (ite .cse0 v_~y$r_buff1_thd3~0_56 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd3~0_61 256) 0))) (or (and .cse4 .cse5) (and .cse6 .cse4) .cse7)) v_~y$r_buff1_thd3~0_56 0)) v_~y$r_buff1_thd3~0_55) (= v_~y$w_buff0~0_103 v_~y$w_buff0~0_102) (= v_~y$r_buff0_thd3~0_61 (ite .cse0 v_~y$r_buff0_thd3~0_62 (ite (or .cse8 (and .cse6 .cse9) .cse7) v_~y$r_buff0_thd3~0_62 (ite (and (not .cse7) .cse10) 0 v_~y$r_buff0_thd3~0_62)))) (= 0 v_~y$flush_delayed~0_61) (= (ite .cse0 v_~y$w_buff1_used~0_205 (ite (or .cse8 .cse11 .cse7) v_~y$w_buff1_used~0_205 0)) v_~y$w_buff1_used~0_204) (= v_~__unbuffered_p2_EBX~0_20 .cse3) (= |v_P2Thread1of1ForFork0_#t~nondet6_1| v_~weak$$choice2~0_90) (= v_~y$w_buff1~0_105 v_~y$w_buff1~0_106) (= v_~y~0_178 v_~y$mem_tmp~0_48) (= |v_P2Thread1of1ForFork0_#t~nondet5_1| v_~weak$$choice0~0_25)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_218, ~y$w_buff1~0=v_~y$w_buff1~0_106, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_62, ~y$w_buff0~0=v_~y$w_buff0~0_103, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_1|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_1|, ~y~0=v_~y~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_205} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_217, ~weak$$choice0~0=v_~weak$$choice0~0_25, ~y$mem_tmp~0=v_~y$mem_tmp~0_48, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, ~y$w_buff1~0=v_~y$w_buff1~0_105, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_61, ~y$w_buff0~0=v_~y$w_buff0~0_102, ~y$flush_delayed~0=v_~y$flush_delayed~0_61, ~y~0=v_~y~0_177, ~weak$$choice2~0=v_~weak$$choice2~0_90, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_204} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-06 06:43:08,898 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:43:08,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1068 [2022-12-06 06:43:08,899 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 191 flow [2022-12-06 06:43:08,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:08,899 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:43:08,899 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:43:08,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:43:08,900 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:43:08,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:43:08,900 INFO L85 PathProgramCache]: Analyzing trace with hash 818536695, now seen corresponding path program 2 times [2022-12-06 06:43:08,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:43:08,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850667207] [2022-12-06 06:43:08,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:43:08,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:43:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:43:09,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:43:09,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:43:09,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850667207] [2022-12-06 06:43:09,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850667207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:43:09,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:43:09,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:43:09,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047799309] [2022-12-06 06:43:09,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:43:09,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:43:09,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:43:09,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:43:09,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:43:09,507 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:43:09,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 191 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:09,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:43:09,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:43:09,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:43:09,963 INFO L130 PetriNetUnfolder]: 1654/2461 cut-off events. [2022-12-06 06:43:09,965 INFO L131 PetriNetUnfolder]: For 2508/2508 co-relation queries the response was YES. [2022-12-06 06:43:09,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7839 conditions, 2461 events. 1654/2461 cut-off events. For 2508/2508 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10838 event pairs, 369 based on Foata normal form. 60/2521 useless extension candidates. Maximal degree in co-relation 7824. Up to 1018 conditions per place. [2022-12-06 06:43:09,976 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 40 selfloop transitions, 3 changer transitions 17/60 dead transitions. [2022-12-06 06:43:09,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 60 transitions, 410 flow [2022-12-06 06:43:09,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:43:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:43:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 06:43:09,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49107142857142855 [2022-12-06 06:43:09,979 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 191 flow. Second operand 4 states and 55 transitions. [2022-12-06 06:43:09,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 60 transitions, 410 flow [2022-12-06 06:43:09,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 60 transitions, 390 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 06:43:09,987 INFO L231 Difference]: Finished difference. Result has 41 places, 25 transitions, 124 flow [2022-12-06 06:43:09,987 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2022-12-06 06:43:09,989 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2022-12-06 06:43:09,989 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:43:09,990 INFO L89 Accepts]: Start accepts. Operand has 41 places, 25 transitions, 124 flow [2022-12-06 06:43:09,991 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:43:09,991 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:43:09,991 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 25 transitions, 124 flow [2022-12-06 06:43:09,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 25 transitions, 124 flow [2022-12-06 06:43:10,017 INFO L130 PetriNetUnfolder]: 63/165 cut-off events. [2022-12-06 06:43:10,017 INFO L131 PetriNetUnfolder]: For 163/179 co-relation queries the response was YES. [2022-12-06 06:43:10,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 165 events. 63/165 cut-off events. For 163/179 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 737 event pairs, 53 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 451. Up to 101 conditions per place. [2022-12-06 06:43:10,019 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 25 transitions, 124 flow [2022-12-06 06:43:10,019 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 06:43:10,035 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [378] L864-->L870: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_52 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_60 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_197 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_187 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_198 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd0~0_60) v_~y$r_buff0_thd0~0_59) (= v_~y$w_buff1_used~0_186 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_187)) (= v_~y~0_157 (ite .cse2 v_~y$w_buff0~0_86 (ite .cse1 v_~y$w_buff1~0_89 v_~y~0_158))) (= (ite .cse2 0 v_~y$w_buff0_used~0_198) v_~y$w_buff0_used~0_197) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_186 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_59 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_52) v_~y$r_buff1_thd0~0_51)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_198, ~y$w_buff1~0=v_~y$w_buff1~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y~0=v_~y~0_158, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_187} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_197, ~y$w_buff1~0=v_~y$w_buff1~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_59, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y~0=v_~y~0_157, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_186} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [403] L794-->L797: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-06 06:43:10,120 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L864-->L797: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_223 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_232 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_623 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_624 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_573 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_623 (ite .cse0 0 v_~y$w_buff0_used~0_624)) (= (ite .cse1 0 v_~y$r_buff0_thd0~0_232) v_~y$r_buff0_thd0~0_231) (= v_~y$w_buff1_used~0_572 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_573)) (= v_~y~0_541 (ite .cse0 v_~y$w_buff0~0_392 (ite .cse2 v_~y$w_buff1~0_357 v_~y~0_542))) (= (ite (or (and .cse3 (not (= 0 (mod v_~y$w_buff1_used~0_572 256)))) (and (not (= (mod v_~y$r_buff0_thd0~0_231 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_223) v_~y$r_buff1_thd0~0_222) (= v_~x~0_55 1)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_624, ~y$w_buff1~0=v_~y$w_buff1~0_357, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_232, ~y$w_buff0~0=v_~y$w_buff0~0_392, ~y~0=v_~y~0_542, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_223, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_573} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_623, ~y$w_buff1~0=v_~y$w_buff1~0_357, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_231, ~y$w_buff0~0=v_~y$w_buff0~0_392, ~y~0=v_~y~0_541, ~x~0=v_~x~0_55, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_222, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_572} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [442] $Ultimate##0-->L814: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~__unbuffered_p2_EAX~0_16 v_~x~0_7) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_7, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~x~0=v_~x~0_7, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0] [2022-12-06 06:43:10,217 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:43:10,218 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-06 06:43:10,218 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 134 flow [2022-12-06 06:43:10,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:10,218 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:43:10,218 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:43:10,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:43:10,219 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:43:10,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:43:10,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2015094150, now seen corresponding path program 1 times [2022-12-06 06:43:10,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:43:10,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287544741] [2022-12-06 06:43:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:43:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:43:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:43:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:43:11,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:43:11,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287544741] [2022-12-06 06:43:11,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287544741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:43:11,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:43:11,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:43:11,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160102621] [2022-12-06 06:43:11,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:43:11,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:43:11,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:43:11,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:43:11,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:43:11,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 06:43:11,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 134 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:11,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:43:11,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 06:43:11,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:43:11,527 INFO L130 PetriNetUnfolder]: 737/1157 cut-off events. [2022-12-06 06:43:11,527 INFO L131 PetriNetUnfolder]: For 1435/1435 co-relation queries the response was YES. [2022-12-06 06:43:11,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3819 conditions, 1157 events. 737/1157 cut-off events. For 1435/1435 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4590 event pairs, 190 based on Foata normal form. 1/1158 useless extension candidates. Maximal degree in co-relation 3801. Up to 1033 conditions per place. [2022-12-06 06:43:11,536 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 41 selfloop transitions, 13 changer transitions 0/55 dead transitions. [2022-12-06 06:43:11,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 347 flow [2022-12-06 06:43:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:43:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:43:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-12-06 06:43:11,538 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2022-12-06 06:43:11,538 INFO L175 Difference]: Start difference. First operand has 41 places, 25 transitions, 134 flow. Second operand 6 states and 60 transitions. [2022-12-06 06:43:11,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 347 flow [2022-12-06 06:43:11,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 321 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-06 06:43:11,542 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 203 flow [2022-12-06 06:43:11,542 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=203, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2022-12-06 06:43:11,543 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2022-12-06 06:43:11,543 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:43:11,543 INFO L89 Accepts]: Start accepts. Operand has 43 places, 34 transitions, 203 flow [2022-12-06 06:43:11,544 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:43:11,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:43:11,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 203 flow [2022-12-06 06:43:11,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 203 flow [2022-12-06 06:43:11,571 INFO L130 PetriNetUnfolder]: 77/208 cut-off events. [2022-12-06 06:43:11,572 INFO L131 PetriNetUnfolder]: For 259/334 co-relation queries the response was YES. [2022-12-06 06:43:11,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 208 events. 77/208 cut-off events. For 259/334 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1020 event pairs, 31 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 639. Up to 120 conditions per place. [2022-12-06 06:43:11,574 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 203 flow [2022-12-06 06:43:11,574 INFO L188 LiptonReduction]: Number of co-enabled transitions 250 [2022-12-06 06:43:11,656 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] L752-->L768: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd1~0_74 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd1~0_84 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and (= (mod v_~y$w_buff1_used~0_213 256) 0) .cse8)) (.cse4 (and .cse11 .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_226 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and (not .cse12) .cse9))) (let ((.cse0 (ite .cse5 v_~y~0_187 (ite .cse6 v_~y$w_buff0~0_109 v_~y$w_buff1~0_112))) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_225 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_212 256) 0))) (and (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_27) (= .cse0 v_~__unbuffered_p0_EAX~0_20) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_92) (= v_~y~0_187 v_~y$mem_tmp~0_50) (= v_~y$w_buff1_used~0_212 (ite .cse1 v_~y$w_buff1_used~0_213 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_213 0))) (= 0 v_~y$flush_delayed~0_65) (= v_~y$w_buff1~0_112 v_~y$w_buff1~0_111) (= (ite .cse1 v_~y$w_buff0_used~0_226 (ite .cse5 v_~y$w_buff0_used~0_226 (ite .cse6 0 v_~y$w_buff0_used~0_226))) v_~y$w_buff0_used~0_225) (= v_~y~0_185 (ite .cse1 v_~y$mem_tmp~0_50 .cse0)) (= v_~y$r_buff0_thd1~0_83 (ite .cse1 v_~y$r_buff0_thd1~0_84 (ite (or .cse3 .cse4 (and .cse7 .cse8)) v_~y$r_buff0_thd1~0_84 (ite (and (not .cse3) .cse9) 0 v_~y$r_buff0_thd1~0_84)))) (= (ite .cse1 v_~y$r_buff1_thd1~0_74 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd1~0_83 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse10 .cse7))) v_~y$r_buff1_thd1~0_74 0)) v_~y$r_buff1_thd1~0_73) (= v_~y$w_buff0~0_109 v_~y$w_buff0~0_108)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_226, ~y$w_buff1~0=v_~y$w_buff1~0_112, ~y$w_buff0~0=v_~y$w_buff0~0_109, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~y~0=v_~y~0_187, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_213} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_225, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_73, ~weak$$choice0~0=v_~weak$$choice0~0_27, ~y$mem_tmp~0=v_~y$mem_tmp~0_50, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, ~y$flush_delayed~0=v_~y$flush_delayed~0_65, ~y~0=v_~y~0_185, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_212} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] and [470] $Ultimate##0-->L794: Formula: (and (= v_~y$r_buff0_thd2~0_51 v_~y$r_buff1_thd2~0_39) (= v_~y$w_buff0_used~0_287 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~y$r_buff0_thd2~0_50 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_270 256) 0)) (not (= (mod v_~y$w_buff0_used~0_287 256) 0)))) 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~y$w_buff0_used~0_288 v_~y$w_buff1_used~0_270) (= v_~y$r_buff0_thd1~0_123 v_~y$r_buff1_thd1~0_113) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= 2 v_~y$w_buff0~0_150) (= v_~y$r_buff0_thd0~0_75 v_~y$r_buff1_thd0~0_65) (= v_~y$w_buff1~0_143 v_~y$w_buff0~0_151) (= v_~y$r_buff0_thd3~0_95 v_~y$r_buff1_thd3~0_89)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_288, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_95, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_75, ~y$w_buff0~0=v_~y$w_buff0~0_151, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_123, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_287, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_113, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$w_buff1~0=v_~y$w_buff1~0_143, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_95, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_75, ~y$w_buff0~0=v_~y$w_buff0~0_150, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_123, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_270, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:43:11,962 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] L752-->L768: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd1~0_74 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd1~0_84 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and (= (mod v_~y$w_buff1_used~0_213 256) 0) .cse8)) (.cse4 (and .cse11 .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_226 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and (not .cse12) .cse9))) (let ((.cse0 (ite .cse5 v_~y~0_187 (ite .cse6 v_~y$w_buff0~0_109 v_~y$w_buff1~0_112))) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_225 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_212 256) 0))) (and (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_27) (= .cse0 v_~__unbuffered_p0_EAX~0_20) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_92) (= v_~y~0_187 v_~y$mem_tmp~0_50) (= v_~y$w_buff1_used~0_212 (ite .cse1 v_~y$w_buff1_used~0_213 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_213 0))) (= 0 v_~y$flush_delayed~0_65) (= v_~y$w_buff1~0_112 v_~y$w_buff1~0_111) (= (ite .cse1 v_~y$w_buff0_used~0_226 (ite .cse5 v_~y$w_buff0_used~0_226 (ite .cse6 0 v_~y$w_buff0_used~0_226))) v_~y$w_buff0_used~0_225) (= v_~y~0_185 (ite .cse1 v_~y$mem_tmp~0_50 .cse0)) (= v_~y$r_buff0_thd1~0_83 (ite .cse1 v_~y$r_buff0_thd1~0_84 (ite (or .cse3 .cse4 (and .cse7 .cse8)) v_~y$r_buff0_thd1~0_84 (ite (and (not .cse3) .cse9) 0 v_~y$r_buff0_thd1~0_84)))) (= (ite .cse1 v_~y$r_buff1_thd1~0_74 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd1~0_83 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse10 .cse7))) v_~y$r_buff1_thd1~0_74 0)) v_~y$r_buff1_thd1~0_73) (= v_~y$w_buff0~0_109 v_~y$w_buff0~0_108)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_226, ~y$w_buff1~0=v_~y$w_buff1~0_112, ~y$w_buff0~0=v_~y$w_buff0~0_109, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~y~0=v_~y~0_187, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_213} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_225, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_73, ~weak$$choice0~0=v_~weak$$choice0~0_27, ~y$mem_tmp~0=v_~y$mem_tmp~0_50, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, ~y$flush_delayed~0=v_~y$flush_delayed~0_65, ~y~0=v_~y~0_185, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_212} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] and [378] L864-->L870: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_52 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_60 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_197 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_187 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_198 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd0~0_60) v_~y$r_buff0_thd0~0_59) (= v_~y$w_buff1_used~0_186 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_187)) (= v_~y~0_157 (ite .cse2 v_~y$w_buff0~0_86 (ite .cse1 v_~y$w_buff1~0_89 v_~y~0_158))) (= (ite .cse2 0 v_~y$w_buff0_used~0_198) v_~y$w_buff0_used~0_197) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_186 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_59 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_52) v_~y$r_buff1_thd0~0_51)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_198, ~y$w_buff1~0=v_~y$w_buff1~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y~0=v_~y~0_158, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_187} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_197, ~y$w_buff1~0=v_~y$w_buff1~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_59, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y~0=v_~y~0_157, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_186} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:43:12,677 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] L794-->L797: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [529] $Ultimate##0-->L830: Formula: (let ((.cse2 (= (mod v_~y$r_buff1_thd3~0_200 256) 0)) (.cse6 (= (mod v_~y$r_buff0_thd3~0_208 256) 0))) (let ((.cse8 (not .cse6)) (.cse12 (= (mod v_~y$w_buff0_used~0_656 256) 0)) (.cse7 (and .cse6 .cse2)) (.cse9 (and .cse6 (= (mod v_~y$w_buff1_used~0_605 256) 0)))) (let ((.cse10 (or .cse12 .cse7 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse5 (= (mod v_~y$w_buff1_used~0_604 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_655 256) 0)) (.cse0 (ite .cse10 v_~y~0_572 (ite .cse11 v_~y$w_buff0~0_413 v_~y$w_buff1~0_378))) (.cse1 (not (= (mod v_~weak$$choice2~0_172 256) 0)))) (and (= v_~y$flush_delayed~0_161 0) (= v_~weak$$choice2~0_172 |v_P2Thread1of1ForFork0_#t~nondet6_34|) (= v_~__unbuffered_p2_EBX~0_84 .cse0) (= (ite .cse1 v_~y$r_buff1_thd3~0_200 (ite (let ((.cse3 (= (mod v_~y$r_buff0_thd3~0_207 256) 0))) (or (and .cse2 .cse3) .cse4 (and .cse5 .cse3))) v_~y$r_buff1_thd3~0_200 0)) v_~y$r_buff1_thd3~0_199) (= (ite .cse1 v_~y$r_buff0_thd3~0_208 (ite (or (and .cse6 .cse5) .cse4 .cse7) v_~y$r_buff0_thd3~0_208 (ite (and (not .cse4) .cse8) 0 v_~y$r_buff0_thd3~0_208))) v_~y$r_buff0_thd3~0_207) (= |v_P2Thread1of1ForFork0_#in~arg.offset_21| v_P2Thread1of1ForFork0_~arg.offset_21) (= v_~weak$$choice0~0_111 |v_P2Thread1of1ForFork0_#t~nondet5_34|) (= (ite .cse1 v_~y$w_buff1_used~0_605 (ite (or .cse4 .cse7 .cse9) v_~y$w_buff1_used~0_605 0)) v_~y$w_buff1_used~0_604) (= v_~y~0_571 (ite .cse1 v_~y$mem_tmp~0_142 .cse0)) (= v_~y$w_buff1~0_378 v_~y$w_buff1~0_377) (= |v_P2Thread1of1ForFork0_#in~arg.base_21| v_P2Thread1of1ForFork0_~arg.base_21) (= v_~x~0_59 v_~__unbuffered_p2_EAX~0_76) (= v_~y$w_buff0~0_413 v_~y$w_buff0~0_412) (= (ite .cse1 v_~y$w_buff0_used~0_656 (ite .cse10 v_~y$w_buff0_used~0_656 (ite .cse11 0 v_~y$w_buff0_used~0_656))) v_~y$w_buff0_used~0_655) (= v_~y~0_572 v_~y$mem_tmp~0_142)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_200, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_656, ~y$w_buff1~0=v_~y$w_buff1~0_378, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_208, ~y$w_buff0~0=v_~y$w_buff0~0_413, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_34|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_34|, ~y~0=v_~y~0_572, ~x~0=v_~x~0_59, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_605} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_655, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_21, ~weak$$choice0~0=v_~weak$$choice0~0_111, ~y$mem_tmp~0=v_~y$mem_tmp~0_142, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_21, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_199, ~y$w_buff1~0=v_~y$w_buff1~0_377, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_207, ~y$w_buff0~0=v_~y$w_buff0~0_412, ~y$flush_delayed~0=v_~y$flush_delayed~0_161, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, ~y~0=v_~y~0_571, ~weak$$choice2~0=v_~weak$$choice2~0_172, ~x~0=v_~x~0_59, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_604} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-06 06:43:12,825 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:43:12,826 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1283 [2022-12-06 06:43:12,826 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 206 flow [2022-12-06 06:43:12,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:12,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:43:12,826 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:43:12,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:43:12,827 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:43:12,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:43:12,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1719034504, now seen corresponding path program 1 times [2022-12-06 06:43:12,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:43:12,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311664866] [2022-12-06 06:43:12,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:43:12,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:43:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:43:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:43:13,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:43:13,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311664866] [2022-12-06 06:43:13,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311664866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:43:13,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:43:13,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:43:13,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027016279] [2022-12-06 06:43:13,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:43:13,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:43:13,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:43:13,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:43:13,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:43:13,544 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 06:43:13,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:13,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:43:13,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 06:43:13,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:43:13,877 INFO L130 PetriNetUnfolder]: 788/1224 cut-off events. [2022-12-06 06:43:13,877 INFO L131 PetriNetUnfolder]: For 2396/2396 co-relation queries the response was YES. [2022-12-06 06:43:13,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4483 conditions, 1224 events. 788/1224 cut-off events. For 2396/2396 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5238 event pairs, 249 based on Foata normal form. 3/1227 useless extension candidates. Maximal degree in co-relation 4465. Up to 1042 conditions per place. [2022-12-06 06:43:13,885 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 39 selfloop transitions, 15 changer transitions 0/55 dead transitions. [2022-12-06 06:43:13,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 417 flow [2022-12-06 06:43:13,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:43:13,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:43:13,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-06 06:43:13,887 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43846153846153846 [2022-12-06 06:43:13,887 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 206 flow. Second operand 5 states and 57 transitions. [2022-12-06 06:43:13,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 417 flow [2022-12-06 06:43:13,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 399 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 06:43:13,892 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 287 flow [2022-12-06 06:43:13,892 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=287, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-12-06 06:43:13,893 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2022-12-06 06:43:13,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:43:13,893 INFO L89 Accepts]: Start accepts. Operand has 46 places, 38 transitions, 287 flow [2022-12-06 06:43:13,893 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:43:13,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:43:13,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 38 transitions, 287 flow [2022-12-06 06:43:13,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 38 transitions, 287 flow [2022-12-06 06:43:13,931 INFO L130 PetriNetUnfolder]: 86/208 cut-off events. [2022-12-06 06:43:13,932 INFO L131 PetriNetUnfolder]: For 484/710 co-relation queries the response was YES. [2022-12-06 06:43:13,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 208 events. 86/208 cut-off events. For 484/710 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1016 event pairs, 27 based on Foata normal form. 2/195 useless extension candidates. Maximal degree in co-relation 790. Up to 134 conditions per place. [2022-12-06 06:43:13,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 38 transitions, 287 flow [2022-12-06 06:43:13,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-06 06:43:14,141 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] L794-->L797: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [531] $Ultimate##0-->L830: Formula: (let ((.cse2 (= (mod v_~y$r_buff1_thd3~0_216 256) 0)) (.cse6 (= (mod v_~y$r_buff0_thd3~0_224 256) 0))) (let ((.cse8 (not .cse6)) (.cse11 (and .cse6 (= (mod v_~y$w_buff1_used~0_625 256) 0))) (.cse7 (and .cse6 .cse2)) (.cse12 (= (mod v_~y$w_buff0_used~0_676 256) 0))) (let ((.cse9 (or .cse11 .cse7 .cse12)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_624 256) 0)) (.cse5 (ite .cse9 v_~y~0_592 (ite .cse10 v_~y$w_buff0~0_425 v_~y$w_buff1~0_390))) (.cse0 (not (= (mod v_~weak$$choice2~0_176 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_675 256) 0))) (and (= v_~x~0_63 v_~__unbuffered_p2_EAX~0_80) (= v_~y~0_592 v_~y$mem_tmp~0_146) (= |v_P2Thread1of1ForFork0_#in~arg.base_25| v_P2Thread1of1ForFork0_~arg.base_25) (= (ite .cse0 v_~y$r_buff1_thd3~0_216 (ite (let ((.cse3 (= (mod v_~y$r_buff0_thd3~0_223 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse3))) v_~y$r_buff1_thd3~0_216 0)) v_~y$r_buff1_thd3~0_215) (= v_~weak$$choice0~0_115 |v_P2Thread1of1ForFork0_#t~nondet5_42|) (= v_~y$w_buff0~0_425 v_~y$w_buff0~0_424) (= v_~y$flush_delayed~0_165 0) (= |v_P2Thread1of1ForFork0_#in~arg.offset_25| v_P2Thread1of1ForFork0_~arg.offset_25) (= v_~y~0_591 (ite .cse0 v_~y$mem_tmp~0_146 .cse5)) (= v_~weak$$choice2~0_176 |v_P2Thread1of1ForFork0_#t~nondet6_42|) (= (ite .cse0 v_~y$r_buff0_thd3~0_224 (ite (or .cse1 (and .cse6 .cse4) .cse7) v_~y$r_buff0_thd3~0_224 (ite (and (not .cse1) .cse8) 0 v_~y$r_buff0_thd3~0_224))) v_~y$r_buff0_thd3~0_223) (= v_~y$w_buff0_used~0_675 (ite .cse0 v_~y$w_buff0_used~0_676 (ite .cse9 v_~y$w_buff0_used~0_676 (ite .cse10 0 v_~y$w_buff0_used~0_676)))) (= v_~__unbuffered_p2_EBX~0_88 .cse5) (= v_~y$w_buff1~0_389 v_~y$w_buff1~0_390) (= (ite .cse0 v_~y$w_buff1_used~0_625 (ite (or .cse1 .cse11 .cse7) v_~y$w_buff1_used~0_625 0)) v_~y$w_buff1_used~0_624)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_216, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_25|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_676, ~y$w_buff1~0=v_~y$w_buff1~0_390, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_224, ~y$w_buff0~0=v_~y$w_buff0~0_425, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_42|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_42|, ~y~0=v_~y~0_592, ~x~0=v_~x~0_63, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_25|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_625} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_88, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_25|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_675, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_25, ~weak$$choice0~0=v_~weak$$choice0~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_146, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_25, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_215, ~y$w_buff1~0=v_~y$w_buff1~0_389, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_223, ~y$w_buff0~0=v_~y$w_buff0~0_424, ~y$flush_delayed~0=v_~y$flush_delayed~0_165, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~y~0=v_~y~0_591, ~weak$$choice2~0=v_~weak$$choice2~0_176, ~x~0=v_~x~0_63, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_25|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_624} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-06 06:43:14,414 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [464] $Ultimate##0-->L745: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_240 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_240, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] and [470] $Ultimate##0-->L794: Formula: (and (= v_~y$r_buff0_thd2~0_51 v_~y$r_buff1_thd2~0_39) (= v_~y$w_buff0_used~0_287 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~y$r_buff0_thd2~0_50 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_270 256) 0)) (not (= (mod v_~y$w_buff0_used~0_287 256) 0)))) 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~y$w_buff0_used~0_288 v_~y$w_buff1_used~0_270) (= v_~y$r_buff0_thd1~0_123 v_~y$r_buff1_thd1~0_113) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= 2 v_~y$w_buff0~0_150) (= v_~y$r_buff0_thd0~0_75 v_~y$r_buff1_thd0~0_65) (= v_~y$w_buff1~0_143 v_~y$w_buff0~0_151) (= v_~y$r_buff0_thd3~0_95 v_~y$r_buff1_thd3~0_89)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_288, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_95, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_75, ~y$w_buff0~0=v_~y$w_buff0~0_151, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_123, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_287, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_113, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$w_buff1~0=v_~y$w_buff1~0_143, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_95, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_75, ~y$w_buff0~0=v_~y$w_buff0~0_150, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_123, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_270, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:43:14,509 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:43:14,510 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 617 [2022-12-06 06:43:14,510 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 289 flow [2022-12-06 06:43:14,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:14,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:43:14,510 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:43:14,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:43:14,511 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:43:14,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:43:14,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1381527869, now seen corresponding path program 1 times [2022-12-06 06:43:14,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:43:14,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451987185] [2022-12-06 06:43:14,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:43:14,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:43:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:43:15,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:43:15,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:43:15,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451987185] [2022-12-06 06:43:15,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451987185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:43:15,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:43:15,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:43:15,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711315376] [2022-12-06 06:43:15,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:43:15,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:43:15,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:43:15,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:43:15,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:43:15,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 06:43:15,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:15,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:43:15,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 06:43:15,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:43:15,710 INFO L130 PetriNetUnfolder]: 1093/1696 cut-off events. [2022-12-06 06:43:15,710 INFO L131 PetriNetUnfolder]: For 4282/4306 co-relation queries the response was YES. [2022-12-06 06:43:15,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6582 conditions, 1696 events. 1093/1696 cut-off events. For 4282/4306 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8049 event pairs, 158 based on Foata normal form. 35/1731 useless extension candidates. Maximal degree in co-relation 6562. Up to 888 conditions per place. [2022-12-06 06:43:15,723 INFO L137 encePairwiseOnDemand]: 12/29 looper letters, 73 selfloop transitions, 27 changer transitions 4/105 dead transitions. [2022-12-06 06:43:15,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 105 transitions, 864 flow [2022-12-06 06:43:15,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 06:43:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 06:43:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-12-06 06:43:15,726 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39846743295019155 [2022-12-06 06:43:15,726 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 289 flow. Second operand 9 states and 104 transitions. [2022-12-06 06:43:15,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 105 transitions, 864 flow [2022-12-06 06:43:15,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 105 transitions, 811 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 06:43:15,732 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 501 flow [2022-12-06 06:43:15,732 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=501, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2022-12-06 06:43:15,733 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 18 predicate places. [2022-12-06 06:43:15,733 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:43:15,734 INFO L89 Accepts]: Start accepts. Operand has 55 places, 52 transitions, 501 flow [2022-12-06 06:43:15,735 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:43:15,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:43:15,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 52 transitions, 501 flow [2022-12-06 06:43:15,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 52 transitions, 501 flow [2022-12-06 06:43:15,771 INFO L130 PetriNetUnfolder]: 104/259 cut-off events. [2022-12-06 06:43:15,771 INFO L131 PetriNetUnfolder]: For 963/1474 co-relation queries the response was YES. [2022-12-06 06:43:15,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 259 events. 104/259 cut-off events. For 963/1474 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1392 event pairs, 27 based on Foata normal form. 4/246 useless extension candidates. Maximal degree in co-relation 1122. Up to 164 conditions per place. [2022-12-06 06:43:15,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 52 transitions, 501 flow [2022-12-06 06:43:15,776 INFO L188 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-06 06:43:16,356 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:43:16,357 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 624 [2022-12-06 06:43:16,357 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 504 flow [2022-12-06 06:43:16,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:16,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:43:16,358 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:43:16,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:43:16,358 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:43:16,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:43:16,358 INFO L85 PathProgramCache]: Analyzing trace with hash 738868964, now seen corresponding path program 1 times [2022-12-06 06:43:16,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:43:16,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881146131] [2022-12-06 06:43:16,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:43:16,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:43:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:43:17,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:43:17,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:43:17,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881146131] [2022-12-06 06:43:17,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881146131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:43:17,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:43:17,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:43:17,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087469941] [2022-12-06 06:43:17,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:43:17,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:43:17,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:43:17,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:43:17,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:43:17,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 06:43:17,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:17,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:43:17,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 06:43:17,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:43:18,180 INFO L130 PetriNetUnfolder]: 1027/1587 cut-off events. [2022-12-06 06:43:18,181 INFO L131 PetriNetUnfolder]: For 6166/6166 co-relation queries the response was YES. [2022-12-06 06:43:18,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7226 conditions, 1587 events. 1027/1587 cut-off events. For 6166/6166 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7474 event pairs, 101 based on Foata normal form. 9/1596 useless extension candidates. Maximal degree in co-relation 7202. Up to 1373 conditions per place. [2022-12-06 06:43:18,194 INFO L137 encePairwiseOnDemand]: 15/30 looper letters, 67 selfloop transitions, 38 changer transitions 0/106 dead transitions. [2022-12-06 06:43:18,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 106 transitions, 1145 flow [2022-12-06 06:43:18,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:43:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:43:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-12-06 06:43:18,196 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2022-12-06 06:43:18,196 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 504 flow. Second operand 7 states and 79 transitions. [2022-12-06 06:43:18,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 106 transitions, 1145 flow [2022-12-06 06:43:18,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 106 transitions, 1109 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-06 06:43:18,206 INFO L231 Difference]: Finished difference. Result has 59 places, 82 transitions, 945 flow [2022-12-06 06:43:18,206 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=945, PETRI_PLACES=59, PETRI_TRANSITIONS=82} [2022-12-06 06:43:18,207 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 22 predicate places. [2022-12-06 06:43:18,207 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:43:18,207 INFO L89 Accepts]: Start accepts. Operand has 59 places, 82 transitions, 945 flow [2022-12-06 06:43:18,208 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:43:18,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:43:18,209 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 82 transitions, 945 flow [2022-12-06 06:43:18,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 82 transitions, 945 flow [2022-12-06 06:43:18,257 INFO L130 PetriNetUnfolder]: 167/365 cut-off events. [2022-12-06 06:43:18,258 INFO L131 PetriNetUnfolder]: For 1816/2719 co-relation queries the response was YES. [2022-12-06 06:43:18,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1830 conditions, 365 events. 167/365 cut-off events. For 1816/2719 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2035 event pairs, 10 based on Foata normal form. 8/365 useless extension candidates. Maximal degree in co-relation 1808. Up to 236 conditions per place. [2022-12-06 06:43:18,262 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 82 transitions, 945 flow [2022-12-06 06:43:18,262 INFO L188 LiptonReduction]: Number of co-enabled transitions 422 [2022-12-06 06:43:18,591 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [526] L752-->L794: Formula: (let ((.cse1 (= (mod v_~y$r_buff0_thd1~0_276 256) 0))) (let ((.cse5 (not .cse1)) (.cse2 (and .cse1 (= (mod v_~y$w_buff1_used~0_588 256) 0))) (.cse3 (and .cse1 (= (mod v_~y$r_buff1_thd1~0_276 256) 0))) (.cse10 (= (mod v_~y$w_buff0_used~0_639 256) 0))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_166 256) 0))) (.cse8 (or .cse2 .cse3 .cse10)) (.cse9 (and (not .cse10) .cse5))) (let ((.cse7 (ite .cse8 v_~y~0_556 (ite .cse9 v_~y$w_buff0~0_400 v_~y$w_buff1~0_365))) (.cse6 (ite .cse0 v_~y$w_buff0_used~0_639 (ite .cse8 v_~y$w_buff0_used~0_639 (ite .cse9 0 v_~y$w_buff0_used~0_639))))) (and (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_55| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_55|) (= (ite .cse0 v_~y$r_buff0_thd1~0_276 (let ((.cse4 (= (mod .cse6 256) 0))) (ite (or (and .cse1 (= (mod (ite .cse0 v_~y$w_buff1_used~0_588 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_588 0)) 256) 0)) .cse3 .cse4) v_~y$r_buff0_thd1~0_276 (ite (and (not .cse4) .cse5) 0 v_~y$r_buff0_thd1~0_276)))) v_~y$r_buff0_thd1~0_275) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_53| |v_P1Thread1of1ForFork2_~arg#1.base_53|) (= .cse7 v_~__unbuffered_p0_EAX~0_82) (= v_~y~0_555 (ite .cse0 v_~y$mem_tmp~0_136 .cse7)) (= v_~y$r_buff0_thd0~0_239 v_~y$r_buff1_thd0~0_230) (= v_~y$w_buff1~0_363 v_~y$w_buff0~0_400) (= 2 v_~y$w_buff0~0_398) (= v_~weak$$choice2~0_166 |v_P0Thread1of1ForFork1_#t~nondet4_42|) (= v_~y$w_buff0_used~0_637 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_53| |v_P1Thread1of1ForFork2_~arg#1.offset_53|) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_55| 0)) (= |v_P0Thread1of1ForFork1_#t~nondet3_42| v_~weak$$choice0~0_105) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_55| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_637 256) 0)) (not (= (mod v_~y$w_buff1_used~0_586 256) 0)))) 1 0)) (= v_~y$r_buff0_thd2~0_150 1) (= v_~y~0_556 v_~y$mem_tmp~0_136) (= v_~y$r_buff0_thd2~0_151 v_~y$r_buff1_thd2~0_105) (= v_~y$r_buff0_thd3~0_205 v_~y$r_buff1_thd3~0_197) (= v_~y$r_buff0_thd1~0_275 v_~y$r_buff1_thd1~0_274) (= .cse6 v_~y$w_buff1_used~0_586) (= v_~y$flush_delayed~0_155 0)))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_639, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_53|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_276, ~y$w_buff1~0=v_~y$w_buff1~0_365, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_205, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_239, ~y$w_buff0~0=v_~y$w_buff0~0_400, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_151, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_276, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_42|, ~y~0=v_~y~0_556, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_42|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_53|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_588} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_53|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_637, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_53|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_274, ~y$mem_tmp~0=v_~y$mem_tmp~0_136, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_197, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_55|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_205, ~y$w_buff0~0=v_~y$w_buff0~0_398, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_275, ~y$flush_delayed~0=v_~y$flush_delayed~0_155, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_53|, ~y~0=v_~y~0_555, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_53|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_55|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_105, ~weak$$choice0~0=v_~weak$$choice0~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_363, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_239, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_150, ~weak$$choice2~0=v_~weak$$choice2~0_166, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_230, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_586} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, P1Thread1of1ForFork2_~arg#1.offset, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] and [396] L768-->L775: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_56 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_66 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_183 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse5 (not (= 0 (mod v_~y$w_buff0_used~0_184 256))))) (.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_173 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd1~0_66) v_~y$r_buff0_thd1~0_65) (= (ite .cse1 0 v_~y$w_buff0_used~0_184) v_~y$w_buff0_used~0_183) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_173) v_~y$w_buff1_used~0_172) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_172 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd1~0_65 256) 0)))) 0 v_~y$r_buff1_thd1~0_56) v_~y$r_buff1_thd1~0_55) (= v_~y~0_143 (ite .cse1 v_~y$w_buff0~0_78 (ite .cse2 v_~y$w_buff1~0_77 v_~y~0_144)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_184, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_78, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_66, ~y~0=v_~y~0_144, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_173} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_55, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_183, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_78, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_65, ~y~0=v_~y~0_143, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_172} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:43:19,305 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] L794-->L797: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [442] $Ultimate##0-->L814: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~__unbuffered_p2_EAX~0_16 v_~x~0_7) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_7, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~x~0=v_~x~0_7, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0] [2022-12-06 06:43:19,323 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] L794-->L797: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [442] $Ultimate##0-->L814: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~__unbuffered_p2_EAX~0_16 v_~x~0_7) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_7, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~x~0=v_~x~0_7, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0] [2022-12-06 06:43:19,529 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [541] L794-->L814: Formula: (and (= v_~x~0_75 v_~__unbuffered_p2_EAX~0_96) (= v_~x~0_75 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_37| v_P2Thread1of1ForFork0_~arg.base_37) (= |v_P2Thread1of1ForFork0_#in~arg.offset_37| v_P2Thread1of1ForFork0_~arg.offset_37)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_37, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_37, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~x~0=v_~x~0_75, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~x~0] and [395] L752-->L768: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd1~0_74 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd1~0_84 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and (= (mod v_~y$w_buff1_used~0_213 256) 0) .cse8)) (.cse4 (and .cse11 .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_226 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and (not .cse12) .cse9))) (let ((.cse0 (ite .cse5 v_~y~0_187 (ite .cse6 v_~y$w_buff0~0_109 v_~y$w_buff1~0_112))) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_225 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_212 256) 0))) (and (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_27) (= .cse0 v_~__unbuffered_p0_EAX~0_20) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_92) (= v_~y~0_187 v_~y$mem_tmp~0_50) (= v_~y$w_buff1_used~0_212 (ite .cse1 v_~y$w_buff1_used~0_213 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_213 0))) (= 0 v_~y$flush_delayed~0_65) (= v_~y$w_buff1~0_112 v_~y$w_buff1~0_111) (= (ite .cse1 v_~y$w_buff0_used~0_226 (ite .cse5 v_~y$w_buff0_used~0_226 (ite .cse6 0 v_~y$w_buff0_used~0_226))) v_~y$w_buff0_used~0_225) (= v_~y~0_185 (ite .cse1 v_~y$mem_tmp~0_50 .cse0)) (= v_~y$r_buff0_thd1~0_83 (ite .cse1 v_~y$r_buff0_thd1~0_84 (ite (or .cse3 .cse4 (and .cse7 .cse8)) v_~y$r_buff0_thd1~0_84 (ite (and (not .cse3) .cse9) 0 v_~y$r_buff0_thd1~0_84)))) (= (ite .cse1 v_~y$r_buff1_thd1~0_74 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd1~0_83 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse10 .cse7))) v_~y$r_buff1_thd1~0_74 0)) v_~y$r_buff1_thd1~0_73) (= v_~y$w_buff0~0_109 v_~y$w_buff0~0_108)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_226, ~y$w_buff1~0=v_~y$w_buff1~0_112, ~y$w_buff0~0=v_~y$w_buff0~0_109, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~y~0=v_~y~0_187, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_213} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_225, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_73, ~weak$$choice0~0=v_~weak$$choice0~0_27, ~y$mem_tmp~0=v_~y$mem_tmp~0_50, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, ~y$flush_delayed~0=v_~y$flush_delayed~0_65, ~y~0=v_~y~0_185, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_212} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] [2022-12-06 06:43:19,679 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [541] L794-->L814: Formula: (and (= v_~x~0_75 v_~__unbuffered_p2_EAX~0_96) (= v_~x~0_75 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_37| v_P2Thread1of1ForFork0_~arg.base_37) (= |v_P2Thread1of1ForFork0_#in~arg.offset_37| v_P2Thread1of1ForFork0_~arg.offset_37)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_37, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_37, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~x~0=v_~x~0_75, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~x~0] and [396] L768-->L775: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_56 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_66 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_183 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse5 (not (= 0 (mod v_~y$w_buff0_used~0_184 256))))) (.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_173 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd1~0_66) v_~y$r_buff0_thd1~0_65) (= (ite .cse1 0 v_~y$w_buff0_used~0_184) v_~y$w_buff0_used~0_183) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_173) v_~y$w_buff1_used~0_172) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_172 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd1~0_65 256) 0)))) 0 v_~y$r_buff1_thd1~0_56) v_~y$r_buff1_thd1~0_55) (= v_~y~0_143 (ite .cse1 v_~y$w_buff0~0_78 (ite .cse2 v_~y$w_buff1~0_77 v_~y~0_144)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_184, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_78, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_66, ~y~0=v_~y~0_144, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_173} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_55, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_183, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_78, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_65, ~y~0=v_~y~0_143, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_172} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:43:19,760 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [541] L794-->L814: Formula: (and (= v_~x~0_75 v_~__unbuffered_p2_EAX~0_96) (= v_~x~0_75 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_37| v_P2Thread1of1ForFork0_~arg.base_37) (= |v_P2Thread1of1ForFork0_#in~arg.offset_37| v_P2Thread1of1ForFork0_~arg.offset_37)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_37, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_37, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~x~0=v_~x~0_75, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~x~0] and [404] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_221 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_209 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_222 256) 0)) .cse5))) (and (= v_~y~0_181 (ite .cse0 v_~y$w_buff0~0_106 (ite .cse1 v_~y$w_buff1~0_109 v_~y~0_182))) (= (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_209) v_~y$w_buff1_used~0_208) (= v_~y$r_buff0_thd2~0_28 (ite .cse2 0 v_~y$r_buff0_thd2~0_29)) (= v_~y$w_buff0_used~0_221 (ite .cse0 0 v_~y$w_buff0_used~0_222)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_208 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_222, ~y$w_buff1~0=v_~y$w_buff1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_106, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_182, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_209} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_221, ~y$w_buff1~0=v_~y$w_buff1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_106, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_181, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:43:19,840 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [541] L794-->L814: Formula: (and (= v_~x~0_75 v_~__unbuffered_p2_EAX~0_96) (= v_~x~0_75 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_37| v_P2Thread1of1ForFork0_~arg.base_37) (= |v_P2Thread1of1ForFork0_#in~arg.offset_37| v_P2Thread1of1ForFork0_~arg.offset_37)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_37, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_37, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~x~0=v_~x~0_75, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~x~0] and [378] L864-->L870: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_52 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_60 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_197 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_187 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_198 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd0~0_60) v_~y$r_buff0_thd0~0_59) (= v_~y$w_buff1_used~0_186 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_187)) (= v_~y~0_157 (ite .cse2 v_~y$w_buff0~0_86 (ite .cse1 v_~y$w_buff1~0_89 v_~y~0_158))) (= (ite .cse2 0 v_~y$w_buff0_used~0_198) v_~y$w_buff0_used~0_197) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_186 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_59 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_52) v_~y$r_buff1_thd0~0_51)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_198, ~y$w_buff1~0=v_~y$w_buff1~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y~0=v_~y~0_158, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_187} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_197, ~y$w_buff1~0=v_~y$w_buff1~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_59, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y~0=v_~y~0_157, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_186} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:43:19,929 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [541] L794-->L814: Formula: (and (= v_~x~0_75 v_~__unbuffered_p2_EAX~0_96) (= v_~x~0_75 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_37| v_P2Thread1of1ForFork0_~arg.base_37) (= |v_P2Thread1of1ForFork0_#in~arg.offset_37| v_P2Thread1of1ForFork0_~arg.offset_37)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_37, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_37, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~x~0=v_~x~0_75, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~x~0] and [404] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_221 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_209 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_222 256) 0)) .cse5))) (and (= v_~y~0_181 (ite .cse0 v_~y$w_buff0~0_106 (ite .cse1 v_~y$w_buff1~0_109 v_~y~0_182))) (= (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_209) v_~y$w_buff1_used~0_208) (= v_~y$r_buff0_thd2~0_28 (ite .cse2 0 v_~y$r_buff0_thd2~0_29)) (= v_~y$w_buff0_used~0_221 (ite .cse0 0 v_~y$w_buff0_used~0_222)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_208 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_222, ~y$w_buff1~0=v_~y$w_buff1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_106, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_182, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_209} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_221, ~y$w_buff1~0=v_~y$w_buff1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_106, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_181, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:43:20,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [541] L794-->L814: Formula: (and (= v_~x~0_75 v_~__unbuffered_p2_EAX~0_96) (= v_~x~0_75 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_37| v_P2Thread1of1ForFork0_~arg.base_37) (= |v_P2Thread1of1ForFork0_#in~arg.offset_37| v_P2Thread1of1ForFork0_~arg.offset_37)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_37, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_37, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~x~0=v_~x~0_75, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~x~0] and [404] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_221 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_209 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_222 256) 0)) .cse5))) (and (= v_~y~0_181 (ite .cse0 v_~y$w_buff0~0_106 (ite .cse1 v_~y$w_buff1~0_109 v_~y~0_182))) (= (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_209) v_~y$w_buff1_used~0_208) (= v_~y$r_buff0_thd2~0_28 (ite .cse2 0 v_~y$r_buff0_thd2~0_29)) (= v_~y$w_buff0_used~0_221 (ite .cse0 0 v_~y$w_buff0_used~0_222)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_208 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_222, ~y$w_buff1~0=v_~y$w_buff1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_106, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_182, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_209} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_221, ~y$w_buff1~0=v_~y$w_buff1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_106, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_181, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:43:20,122 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [541] L794-->L814: Formula: (and (= v_~x~0_75 v_~__unbuffered_p2_EAX~0_96) (= v_~x~0_75 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_37| v_P2Thread1of1ForFork0_~arg.base_37) (= |v_P2Thread1of1ForFork0_#in~arg.offset_37| v_P2Thread1of1ForFork0_~arg.offset_37)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_37, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_37, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~x~0=v_~x~0_75, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~x~0] and [394] L745-->L752: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_50 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_60 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_167 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_168 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_157 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_156 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_157)) (= (ite .cse2 0 v_~y$w_buff0_used~0_168) v_~y$w_buff0_used~0_167) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_156 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd1~0_59 256) 0)))) 0 v_~y$r_buff1_thd1~0_50) v_~y$r_buff1_thd1~0_49) (= v_~y$r_buff0_thd1~0_59 (ite .cse0 0 v_~y$r_buff0_thd1~0_60)) (= (ite .cse2 v_~y$w_buff0~0_68 (ite .cse1 v_~y$w_buff1~0_67 v_~y~0_126)) v_~y~0_125)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_168, ~y$w_buff1~0=v_~y$w_buff1~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_60, ~y~0=v_~y~0_126, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_157} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_49, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_167, ~y$w_buff1~0=v_~y$w_buff1~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_59, ~y~0=v_~y~0_125, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_156} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:43:20,209 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [541] L794-->L814: Formula: (and (= v_~x~0_75 v_~__unbuffered_p2_EAX~0_96) (= v_~x~0_75 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_37| v_P2Thread1of1ForFork0_~arg.base_37) (= |v_P2Thread1of1ForFork0_#in~arg.offset_37| v_P2Thread1of1ForFork0_~arg.offset_37)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_37, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_37, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~x~0=v_~x~0_75, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~x~0] and [396] L768-->L775: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_56 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_66 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_183 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse5 (not (= 0 (mod v_~y$w_buff0_used~0_184 256))))) (.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_173 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd1~0_66) v_~y$r_buff0_thd1~0_65) (= (ite .cse1 0 v_~y$w_buff0_used~0_184) v_~y$w_buff0_used~0_183) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_173) v_~y$w_buff1_used~0_172) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_172 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd1~0_65 256) 0)))) 0 v_~y$r_buff1_thd1~0_56) v_~y$r_buff1_thd1~0_55) (= v_~y~0_143 (ite .cse1 v_~y$w_buff0~0_78 (ite .cse2 v_~y$w_buff1~0_77 v_~y~0_144)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_184, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_78, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_66, ~y~0=v_~y~0_144, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_173} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_55, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_183, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_78, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_65, ~y~0=v_~y~0_143, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_172} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:43:20,990 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 06:43:20,991 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2784 [2022-12-06 06:43:20,991 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 80 transitions, 992 flow [2022-12-06 06:43:20,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:20,991 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:43:20,991 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:43:20,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:43:20,991 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:43:20,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:43:20,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1430098658, now seen corresponding path program 1 times [2022-12-06 06:43:20,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:43:20,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571016985] [2022-12-06 06:43:20,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:43:20,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:43:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:43:21,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:43:21,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:43:21,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571016985] [2022-12-06 06:43:21,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571016985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:43:21,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:43:21,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:43:21,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960622532] [2022-12-06 06:43:21,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:43:21,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:43:21,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:43:21,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:43:21,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:43:21,612 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 06:43:21,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 80 transitions, 992 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:21,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:43:21,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 06:43:21,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:43:22,224 INFO L130 PetriNetUnfolder]: 1272/2007 cut-off events. [2022-12-06 06:43:22,225 INFO L131 PetriNetUnfolder]: For 10395/10395 co-relation queries the response was YES. [2022-12-06 06:43:22,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9878 conditions, 2007 events. 1272/2007 cut-off events. For 10395/10395 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 10182 event pairs, 106 based on Foata normal form. 36/2035 useless extension candidates. Maximal degree in co-relation 9853. Up to 1064 conditions per place. [2022-12-06 06:43:22,241 INFO L137 encePairwiseOnDemand]: 14/40 looper letters, 89 selfloop transitions, 60 changer transitions 4/154 dead transitions. [2022-12-06 06:43:22,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 154 transitions, 1951 flow [2022-12-06 06:43:22,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:43:22,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:43:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-12-06 06:43:22,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.334375 [2022-12-06 06:43:22,242 INFO L175 Difference]: Start difference. First operand has 58 places, 80 transitions, 992 flow. Second operand 8 states and 107 transitions. [2022-12-06 06:43:22,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 154 transitions, 1951 flow [2022-12-06 06:43:22,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 154 transitions, 1855 flow, removed 45 selfloop flow, removed 1 redundant places. [2022-12-06 06:43:22,257 INFO L231 Difference]: Finished difference. Result has 67 places, 107 transitions, 1506 flow [2022-12-06 06:43:22,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1506, PETRI_PLACES=67, PETRI_TRANSITIONS=107} [2022-12-06 06:43:22,258 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 30 predicate places. [2022-12-06 06:43:22,258 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:43:22,258 INFO L89 Accepts]: Start accepts. Operand has 67 places, 107 transitions, 1506 flow [2022-12-06 06:43:22,259 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:43:22,259 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:43:22,259 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 107 transitions, 1506 flow [2022-12-06 06:43:22,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 107 transitions, 1506 flow [2022-12-06 06:43:22,330 INFO L130 PetriNetUnfolder]: 170/422 cut-off events. [2022-12-06 06:43:22,330 INFO L131 PetriNetUnfolder]: For 3361/5454 co-relation queries the response was YES. [2022-12-06 06:43:22,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2538 conditions, 422 events. 170/422 cut-off events. For 3361/5454 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 2661 event pairs, 8 based on Foata normal form. 10/424 useless extension candidates. Maximal degree in co-relation 2512. Up to 279 conditions per place. [2022-12-06 06:43:22,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 107 transitions, 1506 flow [2022-12-06 06:43:22,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-06 06:43:22,628 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [536] $Ultimate##0-->L870: Formula: (let ((.cse32 (not (= (mod v_~y$r_buff0_thd1~0_309 256) 0)))) (let ((.cse15 (and .cse32 (not (= (mod v_~y$w_buff0_used~0_703 256) 0))))) (let ((.cse26 (ite .cse15 0 v_~y$w_buff0_used~0_703))) (let ((.cse27 (= (mod .cse26 256) 0))) (let ((.cse30 (not .cse27))) (let ((.cse31 (and .cse32 .cse30))) (let ((.cse8 (ite .cse31 0 v_~y$r_buff0_thd1~0_309)) (.cse29 (not (= (mod v_~y$r_buff1_thd1~0_310 256) 0)))) (let ((.cse16 (and (not (= (mod v_~y$w_buff1_used~0_650 256) 0)) .cse29)) (.cse11 (= (mod .cse8 256) 0))) (let ((.cse14 (not .cse11)) (.cse24 (ite (or .cse16 .cse31) 0 v_~y$w_buff1_used~0_650))) (let ((.cse28 (= (mod .cse24 256) 0)) (.cse22 (and .cse14 .cse30))) (let ((.cse17 (ite (or (and (not .cse28) .cse29) .cse22) 0 v_~y$r_buff1_thd1~0_310))) (let ((.cse18 (= (mod .cse17 256) 0))) (let ((.cse12 (and .cse18 .cse11)) (.cse25 (and .cse11 .cse28))) (let ((.cse4 (not (= (mod v_~weak$$choice2~0_182 256) 0))) (.cse21 (or .cse12 .cse25 .cse27))) (let ((.cse20 (ite .cse4 .cse26 (ite .cse21 .cse26 (ite .cse22 0 .cse26))))) (let ((.cse9 (= (mod .cse20 256) 0))) (let ((.cse2 (ite .cse4 .cse24 (ite (or .cse9 .cse12 .cse25) .cse24 0)))) (let ((.cse13 (not .cse9)) (.cse10 (= (mod .cse2 256) 0)) (.cse7 (not (= 0 (mod v_~y$r_buff1_thd0~0_239 256)))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_701 256) 0))) (.cse23 (not (= (mod v_~y$r_buff0_thd0~0_248 256) 0)))) (let ((.cse1 (and .cse6 .cse23)) (.cse0 (and (not .cse10) .cse7)) (.cse3 (and .cse13 .cse23)) (.cse5 (ite .cse21 v_~y$mem_tmp~0_152 (ite .cse22 v_~y$w_buff0~0_445 v_~y$w_buff1~0_408)))) (and (= v_~y$w_buff1_used~0_648 (ite (or .cse0 .cse1) 0 .cse2)) (= v_~y$r_buff0_thd0~0_247 (ite .cse1 0 v_~y$r_buff0_thd0~0_248)) (= v_~y~0_615 (ite .cse3 v_~y$w_buff0~0_444 (ite .cse0 v_~y$w_buff1~0_407 (ite .cse4 v_~y$mem_tmp~0_152 .cse5)))) (= v_~y$w_buff0~0_445 v_~y$w_buff0~0_444) (= v_~y$r_buff1_thd0~0_238 (ite (or (and .cse6 (not (= (mod v_~y$r_buff0_thd0~0_247 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_648 256) 0)) .cse7)) 0 v_~y$r_buff1_thd0~0_239)) (= v_~y$r_buff0_thd1~0_307 (ite .cse4 .cse8 (ite (or .cse9 (and .cse10 .cse11) .cse12) .cse8 (ite (and .cse13 .cse14) 0 .cse8)))) (= v_~y$mem_tmp~0_152 (ite .cse15 v_~y$w_buff0~0_445 (ite .cse16 v_~y$w_buff1~0_408 1))) (= v_~y$w_buff1~0_408 v_~y$w_buff1~0_407) (= v_~weak$$choice2~0_182 |v_P0Thread1of1ForFork1_#t~nondet4_54|) (= v_~y$r_buff1_thd1~0_308 (ite .cse4 .cse17 (ite (let ((.cse19 (= (mod v_~y$r_buff0_thd1~0_307 256) 0))) (or .cse9 (and .cse18 .cse19) (and .cse10 .cse19))) .cse17 0))) (= |v_P0Thread1of1ForFork1_#in~arg.base_25| v_P0Thread1of1ForFork1_~arg.base_25) (= (ite .cse3 0 .cse20) v_~y$w_buff0_used~0_701) (= |v_P0Thread1of1ForFork1_#t~nondet3_54| v_~weak$$choice0~0_121) (= v_~y$flush_delayed~0_171 0) (= v_P0Thread1of1ForFork1_~arg.offset_25 |v_P0Thread1of1ForFork1_#in~arg.offset_25|) (= .cse5 v_~__unbuffered_p0_EAX~0_88))))))))))))))))))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_703, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_310, ~y$w_buff1~0=v_~y$w_buff1~0_408, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_248, ~y$w_buff0~0=v_~y$w_buff0~0_445, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_309, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_54|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_239, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_54|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_650} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_701, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_25, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_308, ~weak$$choice0~0=v_~weak$$choice0~0_121, ~y$mem_tmp~0=v_~y$mem_tmp~0_152, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_407, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_247, ~y$w_buff0~0=v_~y$w_buff0~0_444, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_307, ~y$flush_delayed~0=v_~y$flush_delayed~0_171, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_25, ~y~0=v_~y~0_615, ~weak$$choice2~0=v_~weak$$choice2~0_182, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_238, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_648} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg.base, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] and [470] $Ultimate##0-->L794: Formula: (and (= v_~y$r_buff0_thd2~0_51 v_~y$r_buff1_thd2~0_39) (= v_~y$w_buff0_used~0_287 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~y$r_buff0_thd2~0_50 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_270 256) 0)) (not (= (mod v_~y$w_buff0_used~0_287 256) 0)))) 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~y$w_buff0_used~0_288 v_~y$w_buff1_used~0_270) (= v_~y$r_buff0_thd1~0_123 v_~y$r_buff1_thd1~0_113) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= 2 v_~y$w_buff0~0_150) (= v_~y$r_buff0_thd0~0_75 v_~y$r_buff1_thd0~0_65) (= v_~y$w_buff1~0_143 v_~y$w_buff0~0_151) (= v_~y$r_buff0_thd3~0_95 v_~y$r_buff1_thd3~0_89)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_288, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_95, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_75, ~y$w_buff0~0=v_~y$w_buff0~0_151, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_123, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_287, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_113, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$w_buff1~0=v_~y$w_buff1~0_143, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_95, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_75, ~y$w_buff0~0=v_~y$w_buff0~0_150, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_123, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_270, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:43:23,193 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [536] $Ultimate##0-->L870: Formula: (let ((.cse32 (not (= (mod v_~y$r_buff0_thd1~0_309 256) 0)))) (let ((.cse15 (and .cse32 (not (= (mod v_~y$w_buff0_used~0_703 256) 0))))) (let ((.cse26 (ite .cse15 0 v_~y$w_buff0_used~0_703))) (let ((.cse27 (= (mod .cse26 256) 0))) (let ((.cse30 (not .cse27))) (let ((.cse31 (and .cse32 .cse30))) (let ((.cse8 (ite .cse31 0 v_~y$r_buff0_thd1~0_309)) (.cse29 (not (= (mod v_~y$r_buff1_thd1~0_310 256) 0)))) (let ((.cse16 (and (not (= (mod v_~y$w_buff1_used~0_650 256) 0)) .cse29)) (.cse11 (= (mod .cse8 256) 0))) (let ((.cse14 (not .cse11)) (.cse24 (ite (or .cse16 .cse31) 0 v_~y$w_buff1_used~0_650))) (let ((.cse28 (= (mod .cse24 256) 0)) (.cse22 (and .cse14 .cse30))) (let ((.cse17 (ite (or (and (not .cse28) .cse29) .cse22) 0 v_~y$r_buff1_thd1~0_310))) (let ((.cse18 (= (mod .cse17 256) 0))) (let ((.cse12 (and .cse18 .cse11)) (.cse25 (and .cse11 .cse28))) (let ((.cse4 (not (= (mod v_~weak$$choice2~0_182 256) 0))) (.cse21 (or .cse12 .cse25 .cse27))) (let ((.cse20 (ite .cse4 .cse26 (ite .cse21 .cse26 (ite .cse22 0 .cse26))))) (let ((.cse9 (= (mod .cse20 256) 0))) (let ((.cse2 (ite .cse4 .cse24 (ite (or .cse9 .cse12 .cse25) .cse24 0)))) (let ((.cse13 (not .cse9)) (.cse10 (= (mod .cse2 256) 0)) (.cse7 (not (= 0 (mod v_~y$r_buff1_thd0~0_239 256)))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_701 256) 0))) (.cse23 (not (= (mod v_~y$r_buff0_thd0~0_248 256) 0)))) (let ((.cse1 (and .cse6 .cse23)) (.cse0 (and (not .cse10) .cse7)) (.cse3 (and .cse13 .cse23)) (.cse5 (ite .cse21 v_~y$mem_tmp~0_152 (ite .cse22 v_~y$w_buff0~0_445 v_~y$w_buff1~0_408)))) (and (= v_~y$w_buff1_used~0_648 (ite (or .cse0 .cse1) 0 .cse2)) (= v_~y$r_buff0_thd0~0_247 (ite .cse1 0 v_~y$r_buff0_thd0~0_248)) (= v_~y~0_615 (ite .cse3 v_~y$w_buff0~0_444 (ite .cse0 v_~y$w_buff1~0_407 (ite .cse4 v_~y$mem_tmp~0_152 .cse5)))) (= v_~y$w_buff0~0_445 v_~y$w_buff0~0_444) (= v_~y$r_buff1_thd0~0_238 (ite (or (and .cse6 (not (= (mod v_~y$r_buff0_thd0~0_247 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_648 256) 0)) .cse7)) 0 v_~y$r_buff1_thd0~0_239)) (= v_~y$r_buff0_thd1~0_307 (ite .cse4 .cse8 (ite (or .cse9 (and .cse10 .cse11) .cse12) .cse8 (ite (and .cse13 .cse14) 0 .cse8)))) (= v_~y$mem_tmp~0_152 (ite .cse15 v_~y$w_buff0~0_445 (ite .cse16 v_~y$w_buff1~0_408 1))) (= v_~y$w_buff1~0_408 v_~y$w_buff1~0_407) (= v_~weak$$choice2~0_182 |v_P0Thread1of1ForFork1_#t~nondet4_54|) (= v_~y$r_buff1_thd1~0_308 (ite .cse4 .cse17 (ite (let ((.cse19 (= (mod v_~y$r_buff0_thd1~0_307 256) 0))) (or .cse9 (and .cse18 .cse19) (and .cse10 .cse19))) .cse17 0))) (= |v_P0Thread1of1ForFork1_#in~arg.base_25| v_P0Thread1of1ForFork1_~arg.base_25) (= (ite .cse3 0 .cse20) v_~y$w_buff0_used~0_701) (= |v_P0Thread1of1ForFork1_#t~nondet3_54| v_~weak$$choice0~0_121) (= v_~y$flush_delayed~0_171 0) (= v_P0Thread1of1ForFork1_~arg.offset_25 |v_P0Thread1of1ForFork1_#in~arg.offset_25|) (= .cse5 v_~__unbuffered_p0_EAX~0_88))))))))))))))))))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_703, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_310, ~y$w_buff1~0=v_~y$w_buff1~0_408, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_248, ~y$w_buff0~0=v_~y$w_buff0~0_445, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_309, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_54|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_239, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_54|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_650} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_701, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_25, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_308, ~weak$$choice0~0=v_~weak$$choice0~0_121, ~y$mem_tmp~0=v_~y$mem_tmp~0_152, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_407, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_247, ~y$w_buff0~0=v_~y$w_buff0~0_444, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_307, ~y$flush_delayed~0=v_~y$flush_delayed~0_171, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_25, ~y~0=v_~y~0_615, ~weak$$choice2~0=v_~weak$$choice2~0_182, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_238, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_648} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg.base, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] and [396] L768-->L775: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_56 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_66 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_183 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse5 (not (= 0 (mod v_~y$w_buff0_used~0_184 256))))) (.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_173 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd1~0_66) v_~y$r_buff0_thd1~0_65) (= (ite .cse1 0 v_~y$w_buff0_used~0_184) v_~y$w_buff0_used~0_183) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_173) v_~y$w_buff1_used~0_172) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_172 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd1~0_65 256) 0)))) 0 v_~y$r_buff1_thd1~0_56) v_~y$r_buff1_thd1~0_55) (= v_~y~0_143 (ite .cse1 v_~y$w_buff0~0_78 (ite .cse2 v_~y$w_buff1~0_77 v_~y~0_144)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_184, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_78, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_66, ~y~0=v_~y~0_144, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_173} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_55, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_183, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_78, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_65, ~y~0=v_~y~0_143, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_172} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 06:43:23,774 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [553] $Ultimate##0-->L775: Formula: (let ((.cse43 (not (= (mod v_~y$r_buff0_thd1~0_377 256) 0)))) (let ((.cse9 (and (not (= (mod v_~y$w_buff0_used~0_852 256) 0)) .cse43))) (let ((.cse37 (ite .cse9 0 v_~y$w_buff0_used~0_852))) (let ((.cse38 (= (mod .cse37 256) 0))) (let ((.cse41 (not .cse38))) (let ((.cse42 (and .cse41 .cse43))) (let ((.cse29 (ite .cse42 0 v_~y$r_buff0_thd1~0_377)) (.cse40 (not (= (mod v_~y$r_buff1_thd1~0_380 256) 0)))) (let ((.cse10 (and .cse40 (not (= (mod v_~y$w_buff1_used~0_794 256) 0)))) (.cse30 (= (mod .cse29 256) 0))) (let ((.cse33 (not .cse30)) (.cse35 (ite (or .cse42 .cse10) 0 v_~y$w_buff1_used~0_794))) (let ((.cse39 (= (mod .cse35 256) 0)) (.cse21 (and .cse41 .cse33))) (let ((.cse24 (ite (or (and .cse40 (not .cse39)) .cse21) 0 v_~y$r_buff1_thd1~0_380))) (let ((.cse27 (= (mod .cse24 256) 0))) (let ((.cse36 (and .cse39 .cse30)) (.cse31 (and .cse27 .cse30))) (let ((.cse7 (not (= (mod v_~weak$$choice2~0_200 256) 0))) (.cse20 (or .cse36 .cse38 .cse31))) (let ((.cse34 (ite .cse7 .cse37 (ite .cse20 .cse37 (ite .cse21 0 .cse37))))) (let ((.cse26 (= (mod .cse34 256) 0))) (let ((.cse32 (not .cse26)) (.cse28 (not (= (mod v_~y$r_buff0_thd0~0_297 256) 0)))) (let ((.cse23 (ite .cse7 .cse35 (ite (or .cse26 .cse36 .cse31) .cse35 0))) (.cse5 (and .cse32 .cse28))) (let ((.cse14 (ite .cse5 0 .cse34)) (.cse25 (= (mod .cse23 256) 0))) (let ((.cse15 (ite .cse7 .cse29 (ite (or .cse26 (and .cse25 .cse30) .cse31) .cse29 (ite (and .cse32 .cse33) 0 .cse29)))) (.cse11 (not (= (mod .cse14 256) 0))) (.cse12 (not (= (mod v_~y$r_buff1_thd0~0_290 256) 0)))) (let ((.cse6 (and .cse12 (not .cse25))) (.cse8 (and .cse11 .cse28)) (.cse22 (= (mod .cse15 256) 0))) (let ((.cse18 (ite .cse7 .cse24 (ite (or (and .cse25 .cse22) .cse26 (and .cse27 .cse22)) .cse24 0))) (.cse2 (ite (or .cse6 .cse8) 0 .cse23))) (let ((.cse17 (not (= (mod v_~y$w_buff0_used~0_850 256) 0))) (.cse19 (not .cse22)) (.cse13 (not (= (mod .cse2 256) 0))) (.cse16 (not (= (mod .cse18 256) 0)))) (let ((.cse0 (and .cse13 .cse16)) (.cse3 (ite .cse20 v_~y$mem_tmp~0_170 (ite .cse21 v_~y$w_buff0~0_531 v_~y$w_buff1~0_491))) (.cse4 (and .cse11 .cse19)) (.cse1 (and .cse17 .cse19))) (and (= v_~y$w_buff1_used~0_792 (ite (or .cse0 .cse1) 0 .cse2)) (= v_~weak$$choice2~0_200 |v_P0Thread1of1ForFork1_#t~nondet4_78|) (= v_P0Thread1of1ForFork1_~arg.offset_29 |v_P0Thread1of1ForFork1_#in~arg.offset_29|) (= v_~__unbuffered_p0_EAX~0_118 .cse3) (= v_~y$flush_delayed~0_189 0) (= v_~y$w_buff1~0_491 v_~y$w_buff1~0_490) (= |v_P0Thread1of1ForFork1_#t~nondet3_78| v_~weak$$choice0~0_139) (= v_~y~0_757 (ite .cse4 v_~y$w_buff0~0_530 (ite .cse0 v_~y$w_buff1~0_490 (ite .cse5 v_~y$w_buff0~0_530 (ite .cse6 v_~y$w_buff1~0_490 (ite .cse7 v_~y$mem_tmp~0_170 .cse3)))))) (= v_~y$w_buff0~0_531 v_~y$w_buff0~0_530) (= |v_P0Thread1of1ForFork1_#in~arg.base_29| v_P0Thread1of1ForFork1_~arg.base_29) (= v_~y$r_buff0_thd0~0_296 (ite .cse8 0 v_~y$r_buff0_thd0~0_297)) (= (ite .cse9 v_~y$w_buff0~0_531 (ite .cse10 v_~y$w_buff1~0_491 1)) v_~y$mem_tmp~0_170) (= v_~y$r_buff1_thd0~0_289 (ite (or (and .cse11 (not (= (mod v_~y$r_buff0_thd0~0_296 256) 0))) (and .cse12 .cse13)) 0 v_~y$r_buff1_thd0~0_290)) (= (ite .cse4 0 .cse14) v_~y$w_buff0_used~0_850) (= v_~y$r_buff0_thd1~0_375 (ite .cse1 0 .cse15)) (= v_~y$r_buff1_thd1~0_378 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_792 256) 0)) .cse16) (and .cse17 (not (= (mod v_~y$r_buff0_thd1~0_375 256) 0)))) 0 .cse18))))))))))))))))))))))))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_380, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_852, ~y$w_buff1~0=v_~y$w_buff1~0_491, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_29|, ~y$w_buff0~0=v_~y$w_buff0~0_531, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_297, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_377, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_78|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_29|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_290, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_78|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_794} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_850, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_29|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_29, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_378, ~weak$$choice0~0=v_~weak$$choice0~0_139, ~y$mem_tmp~0=v_~y$mem_tmp~0_170, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_490, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_29|, ~y$w_buff0~0=v_~y$w_buff0~0_530, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_296, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_375, ~y$flush_delayed~0=v_~y$flush_delayed~0_189, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_29, ~y~0=v_~y~0_757, ~weak$$choice2~0=v_~weak$$choice2~0_200, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_289, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_792} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg.base, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] and [470] $Ultimate##0-->L794: Formula: (and (= v_~y$r_buff0_thd2~0_51 v_~y$r_buff1_thd2~0_39) (= v_~y$w_buff0_used~0_287 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~y$r_buff0_thd2~0_50 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_270 256) 0)) (not (= (mod v_~y$w_buff0_used~0_287 256) 0)))) 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~y$w_buff0_used~0_288 v_~y$w_buff1_used~0_270) (= v_~y$r_buff0_thd1~0_123 v_~y$r_buff1_thd1~0_113) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= 2 v_~y$w_buff0~0_150) (= v_~y$r_buff0_thd0~0_75 v_~y$r_buff1_thd0~0_65) (= v_~y$w_buff1~0_143 v_~y$w_buff0~0_151) (= v_~y$r_buff0_thd3~0_95 v_~y$r_buff1_thd3~0_89)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_288, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_95, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_75, ~y$w_buff0~0=v_~y$w_buff0~0_151, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_123, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_287, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_113, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$w_buff1~0=v_~y$w_buff1~0_143, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_95, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_75, ~y$w_buff0~0=v_~y$w_buff0~0_150, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_123, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_270, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:43:24,618 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:43:24,619 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2361 [2022-12-06 06:43:24,619 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 106 transitions, 1506 flow [2022-12-06 06:43:24,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:24,620 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:43:24,620 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:43:24,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:43:24,620 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:43:24,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:43:24,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1429901834, now seen corresponding path program 1 times [2022-12-06 06:43:24,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:43:24,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139067128] [2022-12-06 06:43:24,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:43:24,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:43:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:43:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:43:24,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:43:24,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139067128] [2022-12-06 06:43:24,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139067128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:43:24,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:43:24,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:43:24,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153483189] [2022-12-06 06:43:24,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:43:24,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:43:24,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:43:24,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:43:24,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:43:24,777 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-06 06:43:24,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 106 transitions, 1506 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:43:24,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:43:24,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-06 06:43:24,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:43:25,034 INFO L130 PetriNetUnfolder]: 680/1166 cut-off events. [2022-12-06 06:43:25,034 INFO L131 PetriNetUnfolder]: For 9643/9643 co-relation queries the response was YES. [2022-12-06 06:43:25,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6450 conditions, 1166 events. 680/1166 cut-off events. For 9643/9643 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5757 event pairs, 119 based on Foata normal form. 72/1235 useless extension candidates. Maximal degree in co-relation 6421. Up to 908 conditions per place. [2022-12-06 06:43:25,048 INFO L137 encePairwiseOnDemand]: 36/41 looper letters, 104 selfloop transitions, 4 changer transitions 9/118 dead transitions. [2022-12-06 06:43:25,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 118 transitions, 1792 flow [2022-12-06 06:43:25,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:43:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:43:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-06 06:43:25,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4796747967479675 [2022-12-06 06:43:25,050 INFO L175 Difference]: Start difference. First operand has 67 places, 106 transitions, 1506 flow. Second operand 3 states and 59 transitions. [2022-12-06 06:43:25,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 118 transitions, 1792 flow [2022-12-06 06:43:25,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 118 transitions, 1671 flow, removed 53 selfloop flow, removed 3 redundant places. [2022-12-06 06:43:25,063 INFO L231 Difference]: Finished difference. Result has 67 places, 79 transitions, 979 flow [2022-12-06 06:43:25,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=979, PETRI_PLACES=67, PETRI_TRANSITIONS=79} [2022-12-06 06:43:25,064 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 30 predicate places. [2022-12-06 06:43:25,064 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:43:25,064 INFO L89 Accepts]: Start accepts. Operand has 67 places, 79 transitions, 979 flow [2022-12-06 06:43:25,066 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:43:25,066 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:43:25,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 79 transitions, 979 flow [2022-12-06 06:43:25,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 79 transitions, 979 flow [2022-12-06 06:43:25,122 INFO L130 PetriNetUnfolder]: 175/417 cut-off events. [2022-12-06 06:43:25,122 INFO L131 PetriNetUnfolder]: For 2687/3024 co-relation queries the response was YES. [2022-12-06 06:43:25,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2162 conditions, 417 events. 175/417 cut-off events. For 2687/3024 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2498 event pairs, 34 based on Foata normal form. 3/396 useless extension candidates. Maximal degree in co-relation 2135. Up to 200 conditions per place. [2022-12-06 06:43:25,128 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 79 transitions, 979 flow [2022-12-06 06:43:25,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 06:43:25,248 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [544] L794-->L804: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_773 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd2~0_114 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_167 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_774 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_717 256) 0)) .cse0)) (.cse2 (and .cse5 .cse1))) (and (= v_~x~0_81 v_~__unbuffered_p2_EAX~0_104) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_716 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_166 256) 0)))) 0 v_~y$r_buff1_thd2~0_114) v_~y$r_buff1_thd2~0_113) (= |v_P2Thread1of1ForFork0_#in~arg.offset_43| v_P2Thread1of1ForFork0_~arg.offset_43) (= v_~y$r_buff0_thd2~0_166 (ite .cse2 0 v_~y$r_buff0_thd2~0_167)) (= v_~x~0_81 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_43| v_P2Thread1of1ForFork0_~arg.base_43) (= v_~y~0_683 (ite .cse3 v_~y$w_buff0~0_488 (ite .cse4 v_~y$w_buff1~0_449 v_~y~0_684))) (= (ite .cse3 0 v_~y$w_buff0_used~0_774) v_~y$w_buff0_used~0_773) (= v_~y$w_buff1_used~0_716 (ite (or .cse4 .cse2) 0 v_~y$w_buff1_used~0_717))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_114, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_43|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_774, ~y$w_buff1~0=v_~y$w_buff1~0_449, ~y$w_buff0~0=v_~y$w_buff0~0_488, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_167, ~y~0=v_~y~0_684, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_43|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_717} OutVars{P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_43|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_773, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_43, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_43, ~y$w_buff1~0=v_~y$w_buff1~0_449, ~y$w_buff0~0=v_~y$w_buff0~0_488, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_166, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_104, ~y~0=v_~y~0_683, ~x~0=v_~x~0_81, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_43|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_716} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P2Thread1of1ForFork0_~arg.base, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, ~y$r_buff0_thd2~0, ~__unbuffered_p2_EAX~0, ~y~0, ~x~0, ~y$w_buff1_used~0] and [410] L814-->L830: Formula: (let ((.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd3~0_62 256) 0))) (let ((.cse10 (not .cse9)) (.cse12 (= (mod v_~y$w_buff0_used~0_218 256) 0)) (.cse8 (and .cse5 .cse9)) (.cse11 (and (= (mod v_~y$w_buff1_used~0_205 256) 0) .cse9))) (let ((.cse1 (or .cse12 .cse8 .cse11)) (.cse2 (and (not .cse12) .cse10))) (let ((.cse6 (= (mod v_~y$w_buff1_used~0_204 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_90 256) 0))) (.cse7 (= (mod v_~y$w_buff0_used~0_217 256) 0)) (.cse3 (ite .cse1 v_~y~0_178 (ite .cse2 v_~y$w_buff0~0_103 v_~y$w_buff1~0_106)))) (and (= (ite .cse0 v_~y$w_buff0_used~0_218 (ite .cse1 v_~y$w_buff0_used~0_218 (ite .cse2 0 v_~y$w_buff0_used~0_218))) v_~y$w_buff0_used~0_217) (= v_~y~0_177 (ite .cse0 v_~y$mem_tmp~0_48 .cse3)) (= (ite .cse0 v_~y$r_buff1_thd3~0_56 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd3~0_61 256) 0))) (or (and .cse4 .cse5) (and .cse6 .cse4) .cse7)) v_~y$r_buff1_thd3~0_56 0)) v_~y$r_buff1_thd3~0_55) (= v_~y$w_buff0~0_103 v_~y$w_buff0~0_102) (= v_~y$r_buff0_thd3~0_61 (ite .cse0 v_~y$r_buff0_thd3~0_62 (ite (or .cse8 (and .cse6 .cse9) .cse7) v_~y$r_buff0_thd3~0_62 (ite (and (not .cse7) .cse10) 0 v_~y$r_buff0_thd3~0_62)))) (= 0 v_~y$flush_delayed~0_61) (= (ite .cse0 v_~y$w_buff1_used~0_205 (ite (or .cse8 .cse11 .cse7) v_~y$w_buff1_used~0_205 0)) v_~y$w_buff1_used~0_204) (= v_~__unbuffered_p2_EBX~0_20 .cse3) (= |v_P2Thread1of1ForFork0_#t~nondet6_1| v_~weak$$choice2~0_90) (= v_~y$w_buff1~0_105 v_~y$w_buff1~0_106) (= v_~y~0_178 v_~y$mem_tmp~0_48) (= |v_P2Thread1of1ForFork0_#t~nondet5_1| v_~weak$$choice0~0_25)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_218, ~y$w_buff1~0=v_~y$w_buff1~0_106, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_62, ~y$w_buff0~0=v_~y$w_buff0~0_103, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_1|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_1|, ~y~0=v_~y~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_205} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_217, ~weak$$choice0~0=v_~weak$$choice0~0_25, ~y$mem_tmp~0=v_~y$mem_tmp~0_48, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, ~y$w_buff1~0=v_~y$w_buff1~0_105, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_61, ~y$w_buff0~0=v_~y$w_buff0~0_102, ~y$flush_delayed~0=v_~y$flush_delayed~0_61, ~y~0=v_~y~0_177, ~weak$$choice2~0=v_~weak$$choice2~0_90, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_204} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] Received shutdown request... [2022-12-06 06:50:36,713 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 06:50:37,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown