/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:29:21,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:29:21,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:29:21,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:29:21,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:29:21,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:29:21,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:29:21,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:29:21,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:29:21,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:29:21,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:29:21,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:29:21,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:29:21,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:29:21,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:29:21,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:29:21,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:29:21,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:29:21,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:29:21,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:29:21,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:29:21,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:29:21,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:29:21,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:29:21,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:29:21,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:29:21,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:29:21,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:29:21,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:29:21,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:29:21,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:29:21,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:29:21,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:29:21,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:29:21,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:29:21,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:29:21,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:29:21,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:29:21,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:29:21,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:29:21,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:29:21,097 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:29:21,121 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:29:21,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:29:21,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:29:21,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:29:21,123 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:29:21,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:29:21,124 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:29:21,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:29:21,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:29:21,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:29:21,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:29:21,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:29:21,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:29:21,125 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:29:21,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:29:21,125 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:29:21,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:29:21,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:29:21,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:29:21,126 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:29:21,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:29:21,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:29:21,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:29:21,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:29:21,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:29:21,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:29:21,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:29:21,126 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:29:21,126 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 04:29:21,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:29:21,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:29:21,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:29:21,383 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:29:21,384 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:29:21,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2022-12-06 04:29:22,399 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:29:22,628 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:29:22,628 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2022-12-06 04:29:22,636 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae56a7a8/6c1109d6bc124d3b9343b265392f3126/FLAG0660a04f9 [2022-12-06 04:29:22,646 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae56a7a8/6c1109d6bc124d3b9343b265392f3126 [2022-12-06 04:29:22,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:29:22,652 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:29:22,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:29:22,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:29:22,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:29:22,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:29:22" (1/1) ... [2022-12-06 04:29:22,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eaa09f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:22, skipping insertion in model container [2022-12-06 04:29:22,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:29:22" (1/1) ... [2022-12-06 04:29:22,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:29:22,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:29:22,811 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/safe016_rmo.oepc.i[993,1006] [2022-12-06 04:29:22,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:22,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:22,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:22,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:22,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:22,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:22,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:22,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:22,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:22,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:22,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:22,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:22,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:22,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:22,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:22,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:22,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:22,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:22,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:22,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:22,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:22,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:29:23,026 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:29:23,034 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/safe016_rmo.oepc.i[993,1006] [2022-12-06 04:29:23,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:23,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:23,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:29:23,126 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:29:23,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:23 WrapperNode [2022-12-06 04:29:23,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:29:23,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:29:23,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:29:23,129 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:29:23,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:23" (1/1) ... [2022-12-06 04:29:23,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:23" (1/1) ... [2022-12-06 04:29:23,169 INFO L138 Inliner]: procedures = 177, calls = 85, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 185 [2022-12-06 04:29:23,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:29:23,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:29:23,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:29:23,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:29:23,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:23" (1/1) ... [2022-12-06 04:29:23,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:23" (1/1) ... [2022-12-06 04:29:23,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:23" (1/1) ... [2022-12-06 04:29:23,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:23" (1/1) ... [2022-12-06 04:29:23,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:23" (1/1) ... [2022-12-06 04:29:23,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:23" (1/1) ... [2022-12-06 04:29:23,195 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:23" (1/1) ... [2022-12-06 04:29:23,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:23" (1/1) ... [2022-12-06 04:29:23,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:29:23,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:29:23,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:29:23,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:29:23,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:23" (1/1) ... [2022-12-06 04:29:23,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:29:23,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:29:23,253 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 04:29:23,297 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 04:29:23,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:29:23,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:29:23,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:29:23,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:29:23,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:29:23,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:29:23,327 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:29:23,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:29:23,327 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:29:23,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:29:23,327 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:29:23,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:29:23,327 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:29:23,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:29:23,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:29:23,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:29:23,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:29:23,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:29:23,330 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 04:29:23,524 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:29:23,525 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:29:23,775 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:29:24,034 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:29:24,034 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:29:24,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:29:24 BoogieIcfgContainer [2022-12-06 04:29:24,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:29:24,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:29:24,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:29:24,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:29:24,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:29:22" (1/3) ... [2022-12-06 04:29:24,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffdce68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:29:24, skipping insertion in model container [2022-12-06 04:29:24,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:23" (2/3) ... [2022-12-06 04:29:24,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffdce68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:29:24, skipping insertion in model container [2022-12-06 04:29:24,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:29:24" (3/3) ... [2022-12-06 04:29:24,042 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_rmo.oepc.i [2022-12-06 04:29:24,055 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:29:24,056 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:29:24,056 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:29:24,112 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:29:24,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2022-12-06 04:29:24,247 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2022-12-06 04:29:24,247 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:24,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-06 04:29:24,253 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2022-12-06 04:29:24,259 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 124 transitions, 260 flow [2022-12-06 04:29:24,260 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:24,279 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 124 transitions, 260 flow [2022-12-06 04:29:24,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 124 transitions, 260 flow [2022-12-06 04:29:24,314 INFO L130 PetriNetUnfolder]: 1/124 cut-off events. [2022-12-06 04:29:24,315 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:24,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 1/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 04:29:24,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 124 transitions, 260 flow [2022-12-06 04:29:24,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 1736 [2022-12-06 04:29:33,608 INFO L203 LiptonReduction]: Total number of compositions: 102 [2022-12-06 04:29:33,625 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:29:33,630 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;@2d9bbe61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:29:33,630 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 04:29:33,634 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 04:29:33,634 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:33,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:33,636 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:33,638 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:33,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:33,646 INFO L85 PathProgramCache]: Analyzing trace with hash 516841787, now seen corresponding path program 1 times [2022-12-06 04:29:33,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:33,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244584794] [2022-12-06 04:29:33,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:33,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:33,820 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 04:29:33,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:33,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244584794] [2022-12-06 04:29:33,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244584794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:33,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:33,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:29:33,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98706647] [2022-12-06 04:29:33,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:33,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:29:33,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:33,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:29:33,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:29:33,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 04:29:33,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 60 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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 04:29:33,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:33,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 04:29:33,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:34,210 INFO L130 PetriNetUnfolder]: 1667/2351 cut-off events. [2022-12-06 04:29:34,210 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 04:29:34,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4795 conditions, 2351 events. 1667/2351 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10151 event pairs, 1667 based on Foata normal form. 0/2341 useless extension candidates. Maximal degree in co-relation 4783. Up to 2341 conditions per place. [2022-12-06 04:29:34,226 INFO L137 encePairwiseOnDemand]: 23/24 looper letters, 21 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2022-12-06 04:29:34,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 23 transitions, 100 flow [2022-12-06 04:29:34,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:29:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:29:34,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2022-12-06 04:29:34,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 04:29:34,235 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 60 flow. Second operand 2 states and 26 transitions. [2022-12-06 04:29:34,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 23 transitions, 100 flow [2022-12-06 04:29:34,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 96 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:29:34,240 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 54 flow [2022-12-06 04:29:34,241 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-12-06 04:29:34,244 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 04:29:34,244 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:34,244 INFO L89 Accepts]: Start accepts. Operand has 33 places, 23 transitions, 54 flow [2022-12-06 04:29:34,246 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:34,246 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:34,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 54 flow [2022-12-06 04:29:34,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 54 flow [2022-12-06 04:29:34,258 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-06 04:29:34,259 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:34,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 04:29:34,259 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 54 flow [2022-12-06 04:29:34,259 INFO L188 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-06 04:29:34,358 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:34,360 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-06 04:29:34,360 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 54 flow [2022-12-06 04:29:34,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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 04:29:34,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:34,361 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:34,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:29:34,364 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:34,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:34,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1531237524, now seen corresponding path program 1 times [2022-12-06 04:29:34,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:34,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699392656] [2022-12-06 04:29:34,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:34,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:34,554 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 04:29:34,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:34,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699392656] [2022-12-06 04:29:34,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699392656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:34,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:34,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:29:34,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523663591] [2022-12-06 04:29:34,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:34,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:29:34,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:34,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:29:34,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:29:34,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 04:29:34,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 54 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 04:29:34,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:34,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 04:29:34,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:34,928 INFO L130 PetriNetUnfolder]: 2185/3052 cut-off events. [2022-12-06 04:29:34,928 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:34,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6234 conditions, 3052 events. 2185/3052 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 14042 event pairs, 445 based on Foata normal form. 32/3081 useless extension candidates. Maximal degree in co-relation 6226. Up to 2745 conditions per place. [2022-12-06 04:29:34,943 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 36 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2022-12-06 04:29:34,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 172 flow [2022-12-06 04:29:34,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:29:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:29:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 04:29:34,946 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2022-12-06 04:29:34,946 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 54 flow. Second operand 3 states and 43 transitions. [2022-12-06 04:29:34,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 172 flow [2022-12-06 04:29:34,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:29:34,948 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 73 flow [2022-12-06 04:29:34,948 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2022-12-06 04:29:34,948 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2022-12-06 04:29:34,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:34,949 INFO L89 Accepts]: Start accepts. Operand has 35 places, 25 transitions, 73 flow [2022-12-06 04:29:34,949 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:34,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:34,950 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 73 flow [2022-12-06 04:29:34,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 73 flow [2022-12-06 04:29:34,956 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-06 04:29:34,956 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:34,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 31 events. 3/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 46. Up to 10 conditions per place. [2022-12-06 04:29:34,957 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 73 flow [2022-12-06 04:29:34,957 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 04:29:34,994 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:34,995 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-06 04:29:34,996 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 73 flow [2022-12-06 04:29:34,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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 04:29:34,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:34,996 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:34,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:29:34,996 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:34,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:34,997 INFO L85 PathProgramCache]: Analyzing trace with hash -223724596, now seen corresponding path program 1 times [2022-12-06 04:29:34,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:34,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116003048] [2022-12-06 04:29:34,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:34,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:35,471 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 04:29:35,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:35,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116003048] [2022-12-06 04:29:35,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116003048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:35,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:35,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:29:35,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323710254] [2022-12-06 04:29:35,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:35,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:29:35,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:35,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:29:35,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:29:35,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 04:29:35,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 04:29:35,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:35,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 04:29:35,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:35,875 INFO L130 PetriNetUnfolder]: 2354/3315 cut-off events. [2022-12-06 04:29:35,876 INFO L131 PetriNetUnfolder]: For 455/456 co-relation queries the response was YES. [2022-12-06 04:29:35,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7401 conditions, 3315 events. 2354/3315 cut-off events. For 455/456 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 14952 event pairs, 404 based on Foata normal form. 40/3354 useless extension candidates. Maximal degree in co-relation 7390. Up to 2813 conditions per place. [2022-12-06 04:29:35,894 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 33 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2022-12-06 04:29:35,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 174 flow [2022-12-06 04:29:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:29:35,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:29:35,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 04:29:35,896 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2022-12-06 04:29:35,896 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 73 flow. Second operand 3 states and 37 transitions. [2022-12-06 04:29:35,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 174 flow [2022-12-06 04:29:35,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:29:35,897 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 78 flow [2022-12-06 04:29:35,897 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, 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=78, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2022-12-06 04:29:35,899 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2022-12-06 04:29:35,899 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:35,899 INFO L89 Accepts]: Start accepts. Operand has 37 places, 25 transitions, 78 flow [2022-12-06 04:29:35,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:35,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:35,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 78 flow [2022-12-06 04:29:35,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 25 transitions, 78 flow [2022-12-06 04:29:35,905 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-06 04:29:35,905 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:29:35,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 31 events. 3/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2022-12-06 04:29:35,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 78 flow [2022-12-06 04:29:35,906 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-06 04:29:35,909 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:35,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 04:29:35,910 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 78 flow [2022-12-06 04:29:35,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 04:29:35,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:35,910 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:35,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:29:35,910 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:35,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:35,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1885262680, now seen corresponding path program 1 times [2022-12-06 04:29:35,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:35,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644516243] [2022-12-06 04:29:35,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:35,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:36,380 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 04:29:36,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:36,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644516243] [2022-12-06 04:29:36,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644516243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:36,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:36,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:29:36,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490335704] [2022-12-06 04:29:36,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:36,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:29:36,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:36,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:29:36,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:29:36,381 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 04:29:36,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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 04:29:36,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:36,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 04:29:36,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:36,749 INFO L130 PetriNetUnfolder]: 2400/3401 cut-off events. [2022-12-06 04:29:36,750 INFO L131 PetriNetUnfolder]: For 819/819 co-relation queries the response was YES. [2022-12-06 04:29:36,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7833 conditions, 3401 events. 2400/3401 cut-off events. For 819/819 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15257 event pairs, 644 based on Foata normal form. 32/3433 useless extension candidates. Maximal degree in co-relation 7820. Up to 2545 conditions per place. [2022-12-06 04:29:36,768 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 38 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2022-12-06 04:29:36,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 203 flow [2022-12-06 04:29:36,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:29:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:29:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 04:29:36,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2022-12-06 04:29:36,770 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 78 flow. Second operand 3 states and 43 transitions. [2022-12-06 04:29:36,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 203 flow [2022-12-06 04:29:36,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:29:36,775 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 82 flow [2022-12-06 04:29:36,775 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=82, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-06 04:29:36,776 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-06 04:29:36,776 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:36,776 INFO L89 Accepts]: Start accepts. Operand has 38 places, 25 transitions, 82 flow [2022-12-06 04:29:36,778 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:36,778 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:36,778 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 82 flow [2022-12-06 04:29:36,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 25 transitions, 82 flow [2022-12-06 04:29:36,784 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-06 04:29:36,784 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 04:29:36,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 31 events. 3/31 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. [2022-12-06 04:29:36,785 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 25 transitions, 82 flow [2022-12-06 04:29:36,785 INFO L188 LiptonReduction]: Number of co-enabled transitions 288 [2022-12-06 04:29:36,904 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:36,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-06 04:29:36,905 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 82 flow [2022-12-06 04:29:36,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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 04:29:36,905 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:36,905 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:36,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:29:36,906 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:36,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash 276722776, now seen corresponding path program 1 times [2022-12-06 04:29:36,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:36,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189018523] [2022-12-06 04:29:36,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:36,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:36,964 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 04:29:36,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:36,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189018523] [2022-12-06 04:29:36,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189018523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:36,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:36,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:29:36,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470641353] [2022-12-06 04:29:36,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:36,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:29:36,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:36,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:29:36,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:29:36,968 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 04:29:36,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 04:29:36,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:36,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 04:29:36,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:37,332 INFO L130 PetriNetUnfolder]: 2471/3538 cut-off events. [2022-12-06 04:29:37,332 INFO L131 PetriNetUnfolder]: For 1113/1113 co-relation queries the response was YES. [2022-12-06 04:29:37,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8468 conditions, 3538 events. 2471/3538 cut-off events. For 1113/1113 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 17022 event pairs, 1399 based on Foata normal form. 72/3600 useless extension candidates. Maximal degree in co-relation 8454. Up to 2197 conditions per place. [2022-12-06 04:29:37,351 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 37 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2022-12-06 04:29:37,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 201 flow [2022-12-06 04:29:37,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:29:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:29:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 04:29:37,352 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2022-12-06 04:29:37,353 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 82 flow. Second operand 3 states and 43 transitions. [2022-12-06 04:29:37,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 201 flow [2022-12-06 04:29:37,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:29:37,354 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 89 flow [2022-12-06 04:29:37,354 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2022-12-06 04:29:37,355 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-06 04:29:37,355 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:37,355 INFO L89 Accepts]: Start accepts. Operand has 39 places, 25 transitions, 89 flow [2022-12-06 04:29:37,355 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:37,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:37,355 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 25 transitions, 89 flow [2022-12-06 04:29:37,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 25 transitions, 89 flow [2022-12-06 04:29:37,360 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-12-06 04:29:37,360 INFO L131 PetriNetUnfolder]: For 19/25 co-relation queries the response was YES. [2022-12-06 04:29:37,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 30 events. 0/30 cut-off events. For 19/25 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-12-06 04:29:37,361 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 25 transitions, 89 flow [2022-12-06 04:29:37,361 INFO L188 LiptonReduction]: Number of co-enabled transitions 288 [2022-12-06 04:29:37,362 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:37,362 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 04:29:37,363 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 89 flow [2022-12-06 04:29:37,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 04:29:37,363 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:37,363 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:37,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:29:37,363 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:37,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:37,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1412347120, now seen corresponding path program 1 times [2022-12-06 04:29:37,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:37,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621834345] [2022-12-06 04:29:37,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:37,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:38,372 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 04:29:38,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:38,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621834345] [2022-12-06 04:29:38,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621834345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:38,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:38,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:29:38,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914760908] [2022-12-06 04:29:38,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:38,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:29:38,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:38,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:29:38,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:29:38,374 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 04:29:38,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 89 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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 04:29:38,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:38,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 04:29:38,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:38,730 INFO L130 PetriNetUnfolder]: 2548/3645 cut-off events. [2022-12-06 04:29:38,731 INFO L131 PetriNetUnfolder]: For 1641/1690 co-relation queries the response was YES. [2022-12-06 04:29:38,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8832 conditions, 3645 events. 2548/3645 cut-off events. For 1641/1690 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17004 event pairs, 634 based on Foata normal form. 22/3663 useless extension candidates. Maximal degree in co-relation 8818. Up to 3201 conditions per place. [2022-12-06 04:29:38,748 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 32 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2022-12-06 04:29:38,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 194 flow [2022-12-06 04:29:38,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:29:38,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:29:38,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 04:29:38,750 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2022-12-06 04:29:38,750 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 89 flow. Second operand 3 states and 37 transitions. [2022-12-06 04:29:38,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 194 flow [2022-12-06 04:29:38,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 186 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 04:29:38,754 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 103 flow [2022-12-06 04:29:38,754 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-12-06 04:29:38,755 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-06 04:29:38,756 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:38,756 INFO L89 Accepts]: Start accepts. Operand has 41 places, 27 transitions, 103 flow [2022-12-06 04:29:38,756 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:38,756 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:38,756 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 27 transitions, 103 flow [2022-12-06 04:29:38,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 27 transitions, 103 flow [2022-12-06 04:29:38,764 INFO L130 PetriNetUnfolder]: 5/48 cut-off events. [2022-12-06 04:29:38,764 INFO L131 PetriNetUnfolder]: For 60/72 co-relation queries the response was YES. [2022-12-06 04:29:38,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 48 events. 5/48 cut-off events. For 60/72 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 2 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 104. Up to 15 conditions per place. [2022-12-06 04:29:38,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 27 transitions, 103 flow [2022-12-06 04:29:38,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 318 [2022-12-06 04:29:38,766 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:38,766 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 04:29:38,766 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 103 flow [2022-12-06 04:29:38,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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 04:29:38,767 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:38,767 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:38,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:29:38,767 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:38,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:38,767 INFO L85 PathProgramCache]: Analyzing trace with hash 833084695, now seen corresponding path program 1 times [2022-12-06 04:29:38,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:38,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463506221] [2022-12-06 04:29:38,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:38,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:38,972 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 04:29:38,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:38,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463506221] [2022-12-06 04:29:38,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463506221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:38,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:38,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:29:38,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29997194] [2022-12-06 04:29:38,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:38,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:29:38,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:38,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:29:38,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:29:38,986 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 04:29:38,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:29:38,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:38,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 04:29:38,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:39,455 INFO L130 PetriNetUnfolder]: 3065/4368 cut-off events. [2022-12-06 04:29:39,455 INFO L131 PetriNetUnfolder]: For 2116/2174 co-relation queries the response was YES. [2022-12-06 04:29:39,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10812 conditions, 4368 events. 3065/4368 cut-off events. For 2116/2174 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 20909 event pairs, 2186 based on Foata normal form. 43/4407 useless extension candidates. Maximal degree in co-relation 10796. Up to 3793 conditions per place. [2022-12-06 04:29:39,470 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 29 selfloop transitions, 9 changer transitions 0/40 dead transitions. [2022-12-06 04:29:39,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 214 flow [2022-12-06 04:29:39,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:29:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:29:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 04:29:39,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42391304347826086 [2022-12-06 04:29:39,472 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 103 flow. Second operand 4 states and 39 transitions. [2022-12-06 04:29:39,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 214 flow [2022-12-06 04:29:39,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:29:39,474 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 155 flow [2022-12-06 04:29:39,474 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-12-06 04:29:39,474 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-06 04:29:39,474 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:39,474 INFO L89 Accepts]: Start accepts. Operand has 44 places, 33 transitions, 155 flow [2022-12-06 04:29:39,475 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:39,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:39,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 155 flow [2022-12-06 04:29:39,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 155 flow [2022-12-06 04:29:39,505 INFO L130 PetriNetUnfolder]: 95/244 cut-off events. [2022-12-06 04:29:39,505 INFO L131 PetriNetUnfolder]: For 259/289 co-relation queries the response was YES. [2022-12-06 04:29:39,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 244 events. 95/244 cut-off events. For 259/289 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1174 event pairs, 43 based on Foata normal form. 2/232 useless extension candidates. Maximal degree in co-relation 643. Up to 148 conditions per place. [2022-12-06 04:29:39,508 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 155 flow [2022-12-06 04:29:39,508 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-06 04:29:39,509 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:39,510 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 04:29:39,510 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 155 flow [2022-12-06 04:29:39,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:29:39,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:39,510 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:39,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:29:39,510 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:39,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:39,510 INFO L85 PathProgramCache]: Analyzing trace with hash 832997275, now seen corresponding path program 2 times [2022-12-06 04:29:39,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:39,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995164336] [2022-12-06 04:29:39,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:39,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:39,807 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 04:29:39,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:39,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995164336] [2022-12-06 04:29:39,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995164336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:39,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:39,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:29:39,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400766707] [2022-12-06 04:29:39,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:39,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:29:39,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:39,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:29:39,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:29:39,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 04:29:39,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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 04:29:39,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:39,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 04:29:39,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:40,481 INFO L130 PetriNetUnfolder]: 4289/6222 cut-off events. [2022-12-06 04:29:40,481 INFO L131 PetriNetUnfolder]: For 5065/5122 co-relation queries the response was YES. [2022-12-06 04:29:40,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17759 conditions, 6222 events. 4289/6222 cut-off events. For 5065/5122 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 33461 event pairs, 1883 based on Foata normal form. 91/6310 useless extension candidates. Maximal degree in co-relation 17741. Up to 3484 conditions per place. [2022-12-06 04:29:40,556 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 40 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2022-12-06 04:29:40,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 328 flow [2022-12-06 04:29:40,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:29:40,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:29:40,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-12-06 04:29:40,558 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4608695652173913 [2022-12-06 04:29:40,558 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 155 flow. Second operand 5 states and 53 transitions. [2022-12-06 04:29:40,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 328 flow [2022-12-06 04:29:40,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 316 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:29:40,562 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 191 flow [2022-12-06 04:29:40,562 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2022-12-06 04:29:40,562 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-12-06 04:29:40,562 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:40,562 INFO L89 Accepts]: Start accepts. Operand has 47 places, 35 transitions, 191 flow [2022-12-06 04:29:40,563 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:40,563 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:40,563 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 191 flow [2022-12-06 04:29:40,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 35 transitions, 191 flow [2022-12-06 04:29:40,601 INFO L130 PetriNetUnfolder]: 115/353 cut-off events. [2022-12-06 04:29:40,601 INFO L131 PetriNetUnfolder]: For 407/433 co-relation queries the response was YES. [2022-12-06 04:29:40,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 353 events. 115/353 cut-off events. For 407/433 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2143 event pairs, 59 based on Foata normal form. 2/342 useless extension candidates. Maximal degree in co-relation 925. Up to 196 conditions per place. [2022-12-06 04:29:40,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 35 transitions, 191 flow [2022-12-06 04:29:40,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 390 [2022-12-06 04:29:40,606 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:40,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 04:29:40,607 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 191 flow [2022-12-06 04:29:40,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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 04:29:40,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:40,607 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:40,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:29:40,607 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:40,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:40,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1467032228, now seen corresponding path program 1 times [2022-12-06 04:29:40,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:40,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726060131] [2022-12-06 04:29:40,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:40,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:40,755 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 04:29:40,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:40,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726060131] [2022-12-06 04:29:40,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726060131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:40,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:40,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:29:40,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613828408] [2022-12-06 04:29:40,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:40,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:29:40,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:40,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:29:40,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:29:40,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 04:29:40,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 04:29:40,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:40,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 04:29:40,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:41,334 INFO L130 PetriNetUnfolder]: 3912/5828 cut-off events. [2022-12-06 04:29:41,334 INFO L131 PetriNetUnfolder]: For 6210/6404 co-relation queries the response was YES. [2022-12-06 04:29:41,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17137 conditions, 5828 events. 3912/5828 cut-off events. For 6210/6404 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 33804 event pairs, 447 based on Foata normal form. 626/6433 useless extension candidates. Maximal degree in co-relation 17118. Up to 2678 conditions per place. [2022-12-06 04:29:41,352 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 65 selfloop transitions, 6 changer transitions 3/78 dead transitions. [2022-12-06 04:29:41,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 78 transitions, 541 flow [2022-12-06 04:29:41,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:29:41,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:29:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 04:29:41,353 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6304347826086957 [2022-12-06 04:29:41,353 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 191 flow. Second operand 4 states and 58 transitions. [2022-12-06 04:29:41,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 78 transitions, 541 flow [2022-12-06 04:29:41,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 78 transitions, 509 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:29:41,358 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 221 flow [2022-12-06 04:29:41,359 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2022-12-06 04:29:41,359 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2022-12-06 04:29:41,359 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:41,359 INFO L89 Accepts]: Start accepts. Operand has 49 places, 39 transitions, 221 flow [2022-12-06 04:29:41,362 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:41,362 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:41,362 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 39 transitions, 221 flow [2022-12-06 04:29:41,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 39 transitions, 221 flow [2022-12-06 04:29:41,489 INFO L130 PetriNetUnfolder]: 698/1326 cut-off events. [2022-12-06 04:29:41,489 INFO L131 PetriNetUnfolder]: For 1645/1988 co-relation queries the response was YES. [2022-12-06 04:29:41,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3838 conditions, 1326 events. 698/1326 cut-off events. For 1645/1988 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 9194 event pairs, 362 based on Foata normal form. 5/1120 useless extension candidates. Maximal degree in co-relation 3819. Up to 851 conditions per place. [2022-12-06 04:29:41,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 39 transitions, 221 flow [2022-12-06 04:29:41,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-06 04:29:41,505 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:41,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-06 04:29:41,505 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 221 flow [2022-12-06 04:29:41,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 04:29:41,506 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:41,506 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:41,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:29:41,506 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:41,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:41,506 INFO L85 PathProgramCache]: Analyzing trace with hash 34540273, now seen corresponding path program 1 times [2022-12-06 04:29:41,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:41,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498150873] [2022-12-06 04:29:41,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:41,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:41,679 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 04:29:41,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:41,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498150873] [2022-12-06 04:29:41,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498150873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:41,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:41,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:29:41,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108562844] [2022-12-06 04:29:41,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:41,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:29:41,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:41,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:29:41,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:29:41,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 04:29:41,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 04:29:41,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:41,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 04:29:41,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:42,107 INFO L130 PetriNetUnfolder]: 2456/3822 cut-off events. [2022-12-06 04:29:42,107 INFO L131 PetriNetUnfolder]: For 5348/5486 co-relation queries the response was YES. [2022-12-06 04:29:42,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13638 conditions, 3822 events. 2456/3822 cut-off events. For 5348/5486 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 21776 event pairs, 180 based on Foata normal form. 489/4303 useless extension candidates. Maximal degree in co-relation 13616. Up to 1554 conditions per place. [2022-12-06 04:29:42,124 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 81 selfloop transitions, 10 changer transitions 6/101 dead transitions. [2022-12-06 04:29:42,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 101 transitions, 713 flow [2022-12-06 04:29:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:29:42,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:29:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-06 04:29:42,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6434782608695652 [2022-12-06 04:29:42,127 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 221 flow. Second operand 5 states and 74 transitions. [2022-12-06 04:29:42,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 101 transitions, 713 flow [2022-12-06 04:29:42,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 101 transitions, 700 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:29:42,133 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 275 flow [2022-12-06 04:29:42,133 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-06 04:29:42,134 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2022-12-06 04:29:42,134 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:42,134 INFO L89 Accepts]: Start accepts. Operand has 53 places, 43 transitions, 275 flow [2022-12-06 04:29:42,135 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:42,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:42,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 43 transitions, 275 flow [2022-12-06 04:29:42,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 275 flow [2022-12-06 04:29:42,216 INFO L130 PetriNetUnfolder]: 396/872 cut-off events. [2022-12-06 04:29:42,217 INFO L131 PetriNetUnfolder]: For 1546/1879 co-relation queries the response was YES. [2022-12-06 04:29:42,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3175 conditions, 872 events. 396/872 cut-off events. For 1546/1879 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 5927 event pairs, 126 based on Foata normal form. 35/807 useless extension candidates. Maximal degree in co-relation 3154. Up to 533 conditions per place. [2022-12-06 04:29:42,223 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 43 transitions, 275 flow [2022-12-06 04:29:42,223 INFO L188 LiptonReduction]: Number of co-enabled transitions 548 [2022-12-06 04:29:42,232 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:42,233 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 04:29:42,234 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 275 flow [2022-12-06 04:29:42,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 04:29:42,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:42,234 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:42,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:29:42,234 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:42,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:42,234 INFO L85 PathProgramCache]: Analyzing trace with hash -435632494, now seen corresponding path program 1 times [2022-12-06 04:29:42,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:42,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139088078] [2022-12-06 04:29:42,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:42,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:42,417 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 04:29:42,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:42,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139088078] [2022-12-06 04:29:42,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139088078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:42,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:42,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:29:42,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013984575] [2022-12-06 04:29:42,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:42,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:29:42,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:42,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:29:42,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:29:42,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 04:29:42,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 04:29:42,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:42,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 04:29:42,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:42,711 INFO L130 PetriNetUnfolder]: 1487/2378 cut-off events. [2022-12-06 04:29:42,711 INFO L131 PetriNetUnfolder]: For 4832/4929 co-relation queries the response was YES. [2022-12-06 04:29:42,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9633 conditions, 2378 events. 1487/2378 cut-off events. For 4832/4929 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 12686 event pairs, 170 based on Foata normal form. 265/2635 useless extension candidates. Maximal degree in co-relation 9609. Up to 920 conditions per place. [2022-12-06 04:29:42,722 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 85 selfloop transitions, 14 changer transitions 7/110 dead transitions. [2022-12-06 04:29:42,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 110 transitions, 829 flow [2022-12-06 04:29:42,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:29:42,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:29:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-12-06 04:29:42,723 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2022-12-06 04:29:42,723 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 275 flow. Second operand 6 states and 88 transitions. [2022-12-06 04:29:42,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 110 transitions, 829 flow [2022-12-06 04:29:42,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 110 transitions, 797 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 04:29:42,740 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 307 flow [2022-12-06 04:29:42,740 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=307, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2022-12-06 04:29:42,741 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2022-12-06 04:29:42,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:42,741 INFO L89 Accepts]: Start accepts. Operand has 56 places, 45 transitions, 307 flow [2022-12-06 04:29:42,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:42,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:42,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 45 transitions, 307 flow [2022-12-06 04:29:42,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 307 flow [2022-12-06 04:29:42,780 INFO L130 PetriNetUnfolder]: 198/494 cut-off events. [2022-12-06 04:29:42,780 INFO L131 PetriNetUnfolder]: For 1139/1400 co-relation queries the response was YES. [2022-12-06 04:29:42,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1992 conditions, 494 events. 198/494 cut-off events. For 1139/1400 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3013 event pairs, 30 based on Foata normal form. 37/477 useless extension candidates. Maximal degree in co-relation 1970. Up to 283 conditions per place. [2022-12-06 04:29:42,785 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 307 flow [2022-12-06 04:29:42,785 INFO L188 LiptonReduction]: Number of co-enabled transitions 508 [2022-12-06 04:29:43,128 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:29:43,129 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 388 [2022-12-06 04:29:43,129 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 307 flow [2022-12-06 04:29:43,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 04:29:43,129 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:43,129 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:43,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:29:43,129 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:43,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:43,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1811808071, now seen corresponding path program 1 times [2022-12-06 04:29:43,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:43,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359258186] [2022-12-06 04:29:43,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:43,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:43,338 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 04:29:43,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:43,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359258186] [2022-12-06 04:29:43,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359258186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:43,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:43,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:29:43,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543116783] [2022-12-06 04:29:43,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:43,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:29:43,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:43,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:29:43,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:29:43,340 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 04:29:43,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 307 flow. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:29:43,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:43,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 04:29:43,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:43,607 INFO L130 PetriNetUnfolder]: 1173/1854 cut-off events. [2022-12-06 04:29:43,607 INFO L131 PetriNetUnfolder]: For 3793/3877 co-relation queries the response was YES. [2022-12-06 04:29:43,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7788 conditions, 1854 events. 1173/1854 cut-off events. For 3793/3877 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 9548 event pairs, 174 based on Foata normal form. 121/1968 useless extension candidates. Maximal degree in co-relation 7763. Up to 700 conditions per place. [2022-12-06 04:29:43,616 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 60 selfloop transitions, 18 changer transitions 14/94 dead transitions. [2022-12-06 04:29:43,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 94 transitions, 727 flow [2022-12-06 04:29:43,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:29:43,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:29:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-06 04:29:43,617 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:29:43,617 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 307 flow. Second operand 7 states and 84 transitions. [2022-12-06 04:29:43,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 94 transitions, 727 flow [2022-12-06 04:29:43,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 94 transitions, 658 flow, removed 14 selfloop flow, removed 7 redundant places. [2022-12-06 04:29:43,636 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 282 flow [2022-12-06 04:29:43,636 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2022-12-06 04:29:43,637 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2022-12-06 04:29:43,637 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:43,637 INFO L89 Accepts]: Start accepts. Operand has 57 places, 41 transitions, 282 flow [2022-12-06 04:29:43,639 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:43,639 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:43,639 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 41 transitions, 282 flow [2022-12-06 04:29:43,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 41 transitions, 282 flow [2022-12-06 04:29:43,652 INFO L130 PetriNetUnfolder]: 59/159 cut-off events. [2022-12-06 04:29:43,653 INFO L131 PetriNetUnfolder]: For 220/226 co-relation queries the response was YES. [2022-12-06 04:29:43,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 159 events. 59/159 cut-off events. For 220/226 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 689 event pairs, 11 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 537. Up to 46 conditions per place. [2022-12-06 04:29:43,654 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 41 transitions, 282 flow [2022-12-06 04:29:43,654 INFO L188 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-06 04:29:43,686 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] L807-->L809: Formula: (= |v_#memory_int_12| (store |v_#memory_int_13| |v_~#y~0.base_10| (store (select |v_#memory_int_13| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_13|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [690] $Ultimate##0-->L780: Formula: (let ((.cse8 (= (mod v_~y$w_buff1_used~0_246 256) 0)) (.cse10 (= (mod v_~y$r_buff1_thd1~0_74 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_246 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd1~0_75 256) 0))) (let ((.cse13 (= (mod v_~weak$$choice2~0_106 256) 0)) (.cse15 (select |v_#memory_int_305| |v_~#y~0.base_178|)) (.cse5 (not .cse3)) (.cse9 (not .cse16)) (.cse1 (and .cse10 .cse3)) (.cse14 (and .cse3 .cse8))) (let ((.cse2 (= (mod v_~y$w_buff1_used~0_245 256) 0)) (.cse7 (or .cse16 .cse1 .cse14)) (.cse11 (and .cse5 .cse9)) (.cse6 (select .cse15 |v_~#y~0.offset_178|)) (.cse0 (not .cse13)) (.cse4 (= (mod v_~y$w_buff0_used~0_245 256) 0))) (and (= v_~y$w_buff1~0_148 v_~y$w_buff1~0_147) (= v_~y$r_buff0_thd1~0_74 (ite .cse0 v_~y$r_buff0_thd1~0_75 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~y$r_buff0_thd1~0_75 (ite (and (not .cse4) .cse5) 0 v_~y$r_buff0_thd1~0_75)))) (= 0 v_~y$flush_delayed~0_82) (or (and (= v_~__unbuffered_p0_EAX~0_80 |v_P0_#t~mem6_55|) (= |v_P0_#t~mem6_55| .cse6) .cse7) (and (or .cse5 (not .cse8)) (= |v_P0Thread1of1ForFork0_#t~mem6_22| |v_P0_#t~mem6_55|) .cse9 (or (not .cse10) .cse5) (= (ite .cse11 v_~y$w_buff0~0_130 v_~y$w_buff1~0_148) v_~__unbuffered_p0_EAX~0_80))) (= (ite .cse0 v_~y$r_buff1_thd1~0_74 (ite (let ((.cse12 (= (mod v_~y$r_buff0_thd1~0_74 256) 0))) (or (and .cse10 .cse12) (and .cse2 .cse12) .cse4)) v_~y$r_buff1_thd1~0_74 0)) v_~y$r_buff1_thd1~0_73) (= v_~__unbuffered_p0_EAX$read_delayed~0_52 1) (= v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_57 |v_~#y~0.offset_178|) (= (ite .cse0 v_~y$w_buff0_used~0_246 (ite .cse7 v_~y$w_buff0_used~0_246 (ite .cse11 0 v_~y$w_buff0_used~0_246))) v_~y$w_buff0_used~0_245) (= |v_~#y~0.base_178| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_57) (= |v_P0Thread1of1ForFork0_#t~nondet3_22| v_~weak$$choice0~0_52) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y$mem_tmp~0_56 .cse6) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (or (and (= |v_P0Thread1of1ForFork0_#t~mem9_22| |v_P0_#t~mem9_35|) (= |v_P0_#t~ite10_36| v_~y$mem_tmp~0_56) .cse0) (and (= v_~__unbuffered_p0_EAX~0_80 |v_P0_#t~mem9_35|) .cse13 (= |v_P0_#t~ite10_36| |v_P0_#t~mem9_35|))) (= |v_P0Thread1of1ForFork0_#t~nondet4_22| v_~weak$$choice2~0_106) (= v_~y$w_buff1_used~0_245 (ite .cse0 v_~y$w_buff1_used~0_246 (ite (or .cse1 .cse14 .cse4) v_~y$w_buff1_used~0_246 0))) (= |v_#memory_int_304| (store |v_#memory_int_305| |v_~#y~0.base_178| (store .cse15 |v_~#y~0.offset_178| |v_P0_#t~ite10_36|))) (= v_~y$w_buff0~0_129 v_~y$w_buff0~0_130))))) InVars {~#y~0.offset=|v_~#y~0.offset_178|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_246, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~#y~0.base=|v_~#y~0.base_178|, P0Thread1of1ForFork0_#t~mem9=|v_P0Thread1of1ForFork0_#t~mem9_22|, P0Thread1of1ForFork0_#t~mem6=|v_P0Thread1of1ForFork0_#t~mem6_22|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff1~0=v_~y$w_buff1~0_148, ~y$w_buff0~0=v_~y$w_buff0~0_130, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_75, #memory_int=|v_#memory_int_305|, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_22|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_22|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_246} OutVars{P0Thread1of1ForFork0_#t~ite10=|v_P0Thread1of1ForFork0_#t~ite10_13|, ~#y~0.offset=|v_~#y~0.offset_178|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_245, ~#y~0.base=|v_~#y~0.base_178|, P0Thread1of1ForFork0_#t~mem8=|v_P0Thread1of1ForFork0_#t~mem8_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_#t~mem5=|v_P0Thread1of1ForFork0_#t~mem5_13|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_73, ~y$mem_tmp~0=v_~y$mem_tmp~0_56, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0~0=v_~y$w_buff0~0_129, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_74, ~y$flush_delayed~0=v_~y$flush_delayed~0_82, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_52, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_57, ~weak$$choice0~0=v_~weak$$choice0~0_52, ~y$w_buff1~0=v_~y$w_buff1~0_147, P0Thread1of1ForFork0_#t~ite7=|v_P0Thread1of1ForFork0_#t~ite7_13|, #memory_int=|v_#memory_int_304|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_57, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_245} AuxVars[|v_P0_#t~mem6_55|, |v_P0_#t~mem9_35|, |v_P0_#t~ite10_36|] AssignedVars[P0Thread1of1ForFork0_#t~ite10, ~y$w_buff0_used~0, P0Thread1of1ForFork0_#t~mem8, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_#t~mem9, P0Thread1of1ForFork0_#t~mem6, P0Thread1of1ForFork0_#t~mem5, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p0_EAX$read_delayed~0, P0Thread1of1ForFork0_~arg.offset, ~__unbuffered_p0_EAX$read_delayed_var~0.base, ~weak$$choice0~0, ~y$w_buff1~0, P0Thread1of1ForFork0_#t~ite7, #memory_int, ~__unbuffered_p0_EAX$read_delayed_var~0.offset, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-06 04:29:44,204 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] L807-->L809: Formula: (= |v_#memory_int_12| (store |v_#memory_int_13| |v_~#y~0.base_10| (store (select |v_#memory_int_13| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_13|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [741] L856-3-->L858-2: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2164~0#1.base_14| 0)) (= |v_ULTIMATE.start_main_~#t2164~0#1.offset_14| 0) (= |v_#length_92| (store |v_#length_93| |v_ULTIMATE.start_main_~#t2164~0#1.base_14| 4)) (= (+ |v_#pthreadsForks_70| 1) |v_#pthreadsForks_69|) (= (select |v_#valid_102| |v_ULTIMATE.start_main_~#t2164~0#1.base_14|) 0) (= |v_#pthreadsForks_70| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= (store |v_#memory_int_421| |v_ULTIMATE.start_main_~#t2164~0#1.base_14| (store (select |v_#memory_int_421| |v_ULTIMATE.start_main_~#t2164~0#1.base_14|) |v_ULTIMATE.start_main_~#t2164~0#1.offset_14| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_420|) (= (store |v_#valid_102| |v_ULTIMATE.start_main_~#t2164~0#1.base_14| 1) |v_#valid_101|) (< |v_#StackHeapBarrier_50| |v_ULTIMATE.start_main_~#t2164~0#1.base_14|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_50|, #pthreadsForks=|v_#pthreadsForks_70|, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_421|, #length=|v_#length_93|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_7|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, ULTIMATE.start_main_~#t2164~0#1.offset=|v_ULTIMATE.start_main_~#t2164~0#1.offset_14|, #pthreadsForks=|v_#pthreadsForks_69|, ULTIMATE.start_main_~#t2164~0#1.base=|v_ULTIMATE.start_main_~#t2164~0#1.base_14|, #valid=|v_#valid_101|, #memory_int=|v_#memory_int_420|, #length=|v_#length_92|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_~#t2164~0#1.offset, #pthreadsForks, ULTIMATE.start_main_~#t2164~0#1.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~pre21#1] [2022-12-06 04:29:44,532 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] L807-->L809: Formula: (= |v_#memory_int_12| (store |v_#memory_int_13| |v_~#y~0.base_10| (store (select |v_#memory_int_13| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_13|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [714] $Ultimate##0-->L826: Formula: (and (= |v_P3Thread1of1ForFork1_#in~arg.offset_5| v_P3Thread1of1ForFork1_~arg.offset_5) (= (store |v_#memory_int_373| |v_~#y~0.base_196| (store (select |v_#memory_int_373| |v_~#y~0.base_196|) |v_~#y~0.offset_196| 2)) |v_#memory_int_372|) (= v_P3Thread1of1ForFork1_~arg.base_5 |v_P3Thread1of1ForFork1_#in~arg.base_5|)) InVars {~#y~0.offset=|v_~#y~0.offset_196|, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_5|, #memory_int=|v_#memory_int_373|, ~#y~0.base=|v_~#y~0.base_196|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_5|} OutVars{~#y~0.offset=|v_~#y~0.offset_196|, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_5|, #memory_int=|v_#memory_int_372|, ~#y~0.base=|v_~#y~0.base_196|, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_5, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_5|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[#memory_int, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] [2022-12-06 04:29:44,551 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [745] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_19| 0) (= v_~__unbuffered_cnt~0_143 (+ v_~__unbuffered_cnt~0_144 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_19|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_144} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_143, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_19|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_121 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-06 04:29:44,569 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [733] L783-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= |v_P0Thread1of1ForFork0_#res.base_9| 0) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_121 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-06 04:30:46,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [733] L783-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= |v_P0Thread1of1ForFork0_#res.base_9| 0) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] and [759] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse21 (= (mod v_~y$w_buff0_used~0_574 256) 0)) (.cse20 (= (mod v_~y$r_buff0_thd0~0_268 256) 0))) (let ((.cse14 (not .cse20)) (.cse15 (not .cse21))) (let ((.cse6 (ite (and .cse14 .cse15) 0 v_~y$w_buff0_used~0_574))) (let ((.cse8 (= (mod .cse6 256) 0))) (let ((.cse30 (not .cse8))) (let ((.cse31 (and .cse30 .cse14))) (let ((.cse18 (= (mod v_~y$r_buff1_thd0~0_265 256) 0)) (.cse19 (= (mod v_~y$w_buff1_used~0_562 256) 0)) (.cse26 (ite .cse31 0 v_~y$r_buff0_thd0~0_268))) (let ((.cse27 (= 0 (mod .cse26 256))) (.cse16 (not .cse19)) (.cse17 (not .cse18))) (let ((.cse11 (ite (or (and .cse16 .cse17) .cse31) 0 v_~y$w_buff1_used~0_562)) (.cse28 (not .cse27))) (let ((.cse10 (and .cse28 .cse30)) (.cse29 (= (mod .cse11 256) 0))) (let ((.cse22 (ite (or .cse10 (and (not .cse29) .cse17)) 0 v_~y$r_buff1_thd0~0_265))) (let ((.cse25 (= (mod .cse22 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_200 256) 0))) (let ((.cse9 (and .cse29 .cse27)) (.cse0 (select |v_#memory_int_758| |v_~#y~0.base_334|)) (.cse4 (not .cse5)) (.cse7 (and .cse25 .cse27)) (.cse24 (= (mod v_~y$w_buff1_used~0_561 256) 0)) (.cse12 (= (mod v_~y$w_buff0_used~0_573 256) 0))) (and (= |v_#memory_int_757| (store |v_#memory_int_758| |v_~#y~0.base_334| (store .cse0 |v_~#y~0.offset_334| |v_ULTIMATE.start_main_#t~ite40#1_123|))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_79| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|) (= v_~main$tmp_guard1~0_66 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_89) (= 2 v_~__unbuffered_p0_EAX~0_232) |v_ULTIMATE.start_main_#t~short38#1_208|)) 1 0) 0) 0 1)) (= v_~y$flush_delayed~0_180 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_79| 0)) (= (mod v_~main$tmp_guard0~0_112 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem34#1_183| |v_ULTIMATE.start_main_#t~mem34#1_181|)) (.cse1 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_176 256) 0))) (or (and .cse1 (= |v_ULTIMATE.start_main_#t~ite35#1_178| |v_ULTIMATE.start_main_#t~ite35#1_180|) (= v_~__unbuffered_p0_EAX~0_233 v_~__unbuffered_p0_EAX~0_232) .cse2) (and (let ((.cse3 (= (mod v_~weak$$choice1~0_75 256) 0))) (or (and .cse3 (= |v_ULTIMATE.start_main_#t~ite35#1_178| v_~__unbuffered_p0_EAX~0_233) .cse2) (and (= |v_ULTIMATE.start_main_#t~mem34#1_181| (select (select (store |v_#memory_int_758| |v_~#y~0.base_334| (store .cse0 |v_~#y~0.offset_334| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_161) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_161)) (= |v_ULTIMATE.start_main_#t~mem34#1_181| |v_ULTIMATE.start_main_#t~ite35#1_178|) (not .cse3)))) (not .cse1) (= |v_ULTIMATE.start_main_#t~ite35#1_178| v_~__unbuffered_p0_EAX~0_232)))) (= (ite (= (ite (= v_~__unbuffered_cnt~0_289 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_112) (= v_~y$mem_tmp~0_158 2) (or (and (= v_~y$mem_tmp~0_158 |v_ULTIMATE.start_main_#t~ite40#1_123|) (= |v_ULTIMATE.start_main_#t~mem39#1_151| |v_ULTIMATE.start_main_#t~mem39#1_153|) .cse4) (and (= |v_ULTIMATE.start_main_#t~mem39#1_151| 2) (= |v_ULTIMATE.start_main_#t~mem39#1_151| |v_ULTIMATE.start_main_#t~ite40#1_123|) .cse5)) (= v_~y$w_buff1~0_374 v_~y$w_buff1~0_373) (= 2 v_~x~0_111) (= v_~y$w_buff0~0_366 v_~y$w_buff0~0_365) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= v_~y$w_buff0_used~0_573 (ite .cse4 .cse6 (ite (or .cse7 .cse8 .cse9) .cse6 (ite .cse10 0 .cse6)))) (= (ite .cse4 .cse11 (ite (or .cse7 .cse12 .cse9) .cse11 0)) v_~y$w_buff1_used~0_561) (= (mod v_~main$tmp_guard1~0_66 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|) (= v_~weak$$choice2~0_200 |v_ULTIMATE.start_main_#t~nondet29#1_123|) (= v_~weak$$choice1~0_75 |v_ULTIMATE.start_main_#t~nondet33#1_113|) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~mem25#1_177| |v_ULTIMATE.start_main_#t~mem25#1_175|))) (or (and (= |v_ULTIMATE.start_main_#t~ite26#1_176| |v_ULTIMATE.start_main_#t~ite26#1_174|) .cse13 .cse14 .cse15 (= v_~y$mem_tmp~0_158 v_~y$w_buff0~0_366)) (and (= v_~y$mem_tmp~0_158 |v_ULTIMATE.start_main_#t~ite26#1_174|) (or (and .cse13 .cse16 .cse17 (= v_~y$w_buff1~0_374 |v_ULTIMATE.start_main_#t~ite26#1_174|)) (and (or .cse18 .cse19) (= |v_ULTIMATE.start_main_#t~ite26#1_174| |v_ULTIMATE.start_main_#t~mem25#1_175|) (= (select .cse0 |v_~#y~0.offset_334|) |v_ULTIMATE.start_main_#t~mem25#1_175|))) (or .cse20 .cse21)))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0) (= (ite .cse4 .cse22 (ite (let ((.cse23 (= (mod v_~y$r_buff0_thd0~0_267 256) 0))) (or (and .cse23 .cse24) (and .cse23 .cse25) .cse12)) .cse22 0)) v_~y$r_buff1_thd0~0_264) (= v_~y$r_buff0_thd0~0_267 (ite .cse4 .cse26 (ite (or .cse7 (and .cse24 .cse27) .cse12) .cse26 (ite (and (not .cse12) .cse28) 0 .cse26)))) (= |v_ULTIMATE.start_main_#t~nondet28#1_111| v_~weak$$choice0~0_150) |v_ULTIMATE.start_main_#t~short38#1_207|)))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_334|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_574, ~#y~0.base=|v_~#y~0.base_334|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_183|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_177|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_180|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, ~y$w_buff0~0=v_~y$w_buff0~0_366, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_89, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_176, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_153|, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_176|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_123|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_161, ~y$w_buff1~0=v_~y$w_buff1~0_374, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_113|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_268, #memory_int=|v_#memory_int_758|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_161, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289, ~x~0=v_~x~0_111, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_265, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_562, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_111|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_74|, ~#y~0.offset=|v_~#y~0.offset_334|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_573, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_65|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_66, ~#y~0.base=|v_~#y~0.base_334|, ULTIMATE.start_main_#t~short38#1=|v_ULTIMATE.start_main_#t~short38#1_206|, ~y$mem_tmp~0=v_~y$mem_tmp~0_158, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_232, ~weak$$choice1~0=v_~weak$$choice1~0_75, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_168|, ~y$w_buff0~0=v_~y$w_buff0~0_365, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_79|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_118|, ~y$flush_delayed~0=v_~y$flush_delayed~0_180, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_89, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_176, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_122|, ULTIMATE.start_main_#t~ite27#1=|v_ULTIMATE.start_main_#t~ite27#1_138|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_112, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_161, ~weak$$choice0~0=v_~weak$$choice0~0_150, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~y$w_buff1~0=v_~y$w_buff1~0_373, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_71|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_267, #memory_int=|v_#memory_int_757|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_161, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_57|, ~weak$$choice2~0=v_~weak$$choice2~0_200, ~x~0=v_~x~0_111, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_264, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_143|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_561, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_123|, |v_ULTIMATE.start_main_#t~mem39#1_151|, |v_ULTIMATE.start_main_#t~ite35#1_178|, |v_ULTIMATE.start_main_#t~mem25#1_175|, |v_ULTIMATE.start_main_#t~mem34#1_181|, |v_ULTIMATE.start_main_#t~ite26#1_174|, |v_ULTIMATE.start_main_#t~short38#1_208|, |v_ULTIMATE.start_main_#t~short38#1_207|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem30#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_#t~short38#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite27#1, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet29#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet33#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~nondet24#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 04:30:48,011 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [713] L834-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#res.offset_19| 0) (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P3Thread1of1ForFork1_#res.base_19| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_19|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset] and [759] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse21 (= (mod v_~y$w_buff0_used~0_574 256) 0)) (.cse20 (= (mod v_~y$r_buff0_thd0~0_268 256) 0))) (let ((.cse14 (not .cse20)) (.cse15 (not .cse21))) (let ((.cse6 (ite (and .cse14 .cse15) 0 v_~y$w_buff0_used~0_574))) (let ((.cse8 (= (mod .cse6 256) 0))) (let ((.cse30 (not .cse8))) (let ((.cse31 (and .cse30 .cse14))) (let ((.cse18 (= (mod v_~y$r_buff1_thd0~0_265 256) 0)) (.cse19 (= (mod v_~y$w_buff1_used~0_562 256) 0)) (.cse26 (ite .cse31 0 v_~y$r_buff0_thd0~0_268))) (let ((.cse27 (= 0 (mod .cse26 256))) (.cse16 (not .cse19)) (.cse17 (not .cse18))) (let ((.cse11 (ite (or (and .cse16 .cse17) .cse31) 0 v_~y$w_buff1_used~0_562)) (.cse28 (not .cse27))) (let ((.cse10 (and .cse28 .cse30)) (.cse29 (= (mod .cse11 256) 0))) (let ((.cse22 (ite (or .cse10 (and (not .cse29) .cse17)) 0 v_~y$r_buff1_thd0~0_265))) (let ((.cse25 (= (mod .cse22 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_200 256) 0))) (let ((.cse9 (and .cse29 .cse27)) (.cse0 (select |v_#memory_int_758| |v_~#y~0.base_334|)) (.cse4 (not .cse5)) (.cse7 (and .cse25 .cse27)) (.cse24 (= (mod v_~y$w_buff1_used~0_561 256) 0)) (.cse12 (= (mod v_~y$w_buff0_used~0_573 256) 0))) (and (= |v_#memory_int_757| (store |v_#memory_int_758| |v_~#y~0.base_334| (store .cse0 |v_~#y~0.offset_334| |v_ULTIMATE.start_main_#t~ite40#1_123|))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_79| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|) (= v_~main$tmp_guard1~0_66 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_89) (= 2 v_~__unbuffered_p0_EAX~0_232) |v_ULTIMATE.start_main_#t~short38#1_208|)) 1 0) 0) 0 1)) (= v_~y$flush_delayed~0_180 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_79| 0)) (= (mod v_~main$tmp_guard0~0_112 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem34#1_183| |v_ULTIMATE.start_main_#t~mem34#1_181|)) (.cse1 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_176 256) 0))) (or (and .cse1 (= |v_ULTIMATE.start_main_#t~ite35#1_178| |v_ULTIMATE.start_main_#t~ite35#1_180|) (= v_~__unbuffered_p0_EAX~0_233 v_~__unbuffered_p0_EAX~0_232) .cse2) (and (let ((.cse3 (= (mod v_~weak$$choice1~0_75 256) 0))) (or (and .cse3 (= |v_ULTIMATE.start_main_#t~ite35#1_178| v_~__unbuffered_p0_EAX~0_233) .cse2) (and (= |v_ULTIMATE.start_main_#t~mem34#1_181| (select (select (store |v_#memory_int_758| |v_~#y~0.base_334| (store .cse0 |v_~#y~0.offset_334| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_161) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_161)) (= |v_ULTIMATE.start_main_#t~mem34#1_181| |v_ULTIMATE.start_main_#t~ite35#1_178|) (not .cse3)))) (not .cse1) (= |v_ULTIMATE.start_main_#t~ite35#1_178| v_~__unbuffered_p0_EAX~0_232)))) (= (ite (= (ite (= v_~__unbuffered_cnt~0_289 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_112) (= v_~y$mem_tmp~0_158 2) (or (and (= v_~y$mem_tmp~0_158 |v_ULTIMATE.start_main_#t~ite40#1_123|) (= |v_ULTIMATE.start_main_#t~mem39#1_151| |v_ULTIMATE.start_main_#t~mem39#1_153|) .cse4) (and (= |v_ULTIMATE.start_main_#t~mem39#1_151| 2) (= |v_ULTIMATE.start_main_#t~mem39#1_151| |v_ULTIMATE.start_main_#t~ite40#1_123|) .cse5)) (= v_~y$w_buff1~0_374 v_~y$w_buff1~0_373) (= 2 v_~x~0_111) (= v_~y$w_buff0~0_366 v_~y$w_buff0~0_365) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= v_~y$w_buff0_used~0_573 (ite .cse4 .cse6 (ite (or .cse7 .cse8 .cse9) .cse6 (ite .cse10 0 .cse6)))) (= (ite .cse4 .cse11 (ite (or .cse7 .cse12 .cse9) .cse11 0)) v_~y$w_buff1_used~0_561) (= (mod v_~main$tmp_guard1~0_66 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|) (= v_~weak$$choice2~0_200 |v_ULTIMATE.start_main_#t~nondet29#1_123|) (= v_~weak$$choice1~0_75 |v_ULTIMATE.start_main_#t~nondet33#1_113|) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~mem25#1_177| |v_ULTIMATE.start_main_#t~mem25#1_175|))) (or (and (= |v_ULTIMATE.start_main_#t~ite26#1_176| |v_ULTIMATE.start_main_#t~ite26#1_174|) .cse13 .cse14 .cse15 (= v_~y$mem_tmp~0_158 v_~y$w_buff0~0_366)) (and (= v_~y$mem_tmp~0_158 |v_ULTIMATE.start_main_#t~ite26#1_174|) (or (and .cse13 .cse16 .cse17 (= v_~y$w_buff1~0_374 |v_ULTIMATE.start_main_#t~ite26#1_174|)) (and (or .cse18 .cse19) (= |v_ULTIMATE.start_main_#t~ite26#1_174| |v_ULTIMATE.start_main_#t~mem25#1_175|) (= (select .cse0 |v_~#y~0.offset_334|) |v_ULTIMATE.start_main_#t~mem25#1_175|))) (or .cse20 .cse21)))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0) (= (ite .cse4 .cse22 (ite (let ((.cse23 (= (mod v_~y$r_buff0_thd0~0_267 256) 0))) (or (and .cse23 .cse24) (and .cse23 .cse25) .cse12)) .cse22 0)) v_~y$r_buff1_thd0~0_264) (= v_~y$r_buff0_thd0~0_267 (ite .cse4 .cse26 (ite (or .cse7 (and .cse24 .cse27) .cse12) .cse26 (ite (and (not .cse12) .cse28) 0 .cse26)))) (= |v_ULTIMATE.start_main_#t~nondet28#1_111| v_~weak$$choice0~0_150) |v_ULTIMATE.start_main_#t~short38#1_207|)))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_334|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_574, ~#y~0.base=|v_~#y~0.base_334|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_183|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_177|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_180|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, ~y$w_buff0~0=v_~y$w_buff0~0_366, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_89, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_176, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_153|, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_176|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_123|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_161, ~y$w_buff1~0=v_~y$w_buff1~0_374, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_113|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_268, #memory_int=|v_#memory_int_758|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_161, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289, ~x~0=v_~x~0_111, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_265, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_562, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_111|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_74|, ~#y~0.offset=|v_~#y~0.offset_334|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_573, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_65|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_66, ~#y~0.base=|v_~#y~0.base_334|, ULTIMATE.start_main_#t~short38#1=|v_ULTIMATE.start_main_#t~short38#1_206|, ~y$mem_tmp~0=v_~y$mem_tmp~0_158, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_232, ~weak$$choice1~0=v_~weak$$choice1~0_75, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_168|, ~y$w_buff0~0=v_~y$w_buff0~0_365, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_79|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_118|, ~y$flush_delayed~0=v_~y$flush_delayed~0_180, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_89, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_176, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_122|, ULTIMATE.start_main_#t~ite27#1=|v_ULTIMATE.start_main_#t~ite27#1_138|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_112, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_161, ~weak$$choice0~0=v_~weak$$choice0~0_150, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~y$w_buff1~0=v_~y$w_buff1~0_373, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_71|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_267, #memory_int=|v_#memory_int_757|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_161, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_57|, ~weak$$choice2~0=v_~weak$$choice2~0_200, ~x~0=v_~x~0_111, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_264, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_143|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_561, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_123|, |v_ULTIMATE.start_main_#t~mem39#1_151|, |v_ULTIMATE.start_main_#t~ite35#1_178|, |v_ULTIMATE.start_main_#t~mem25#1_175|, |v_ULTIMATE.start_main_#t~mem34#1_181|, |v_ULTIMATE.start_main_#t~ite26#1_174|, |v_ULTIMATE.start_main_#t~short38#1_208|, |v_ULTIMATE.start_main_#t~short38#1_207|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem30#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_#t~short38#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite27#1, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet29#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet33#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~nondet24#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 04:30:49,328 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L817-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.base_7| 0) (= |v_P2Thread1of1ForFork3_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_171 (+ v_~__unbuffered_cnt~0_172 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_172} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_7|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] and [759] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse21 (= (mod v_~y$w_buff0_used~0_574 256) 0)) (.cse20 (= (mod v_~y$r_buff0_thd0~0_268 256) 0))) (let ((.cse14 (not .cse20)) (.cse15 (not .cse21))) (let ((.cse6 (ite (and .cse14 .cse15) 0 v_~y$w_buff0_used~0_574))) (let ((.cse8 (= (mod .cse6 256) 0))) (let ((.cse30 (not .cse8))) (let ((.cse31 (and .cse30 .cse14))) (let ((.cse18 (= (mod v_~y$r_buff1_thd0~0_265 256) 0)) (.cse19 (= (mod v_~y$w_buff1_used~0_562 256) 0)) (.cse26 (ite .cse31 0 v_~y$r_buff0_thd0~0_268))) (let ((.cse27 (= 0 (mod .cse26 256))) (.cse16 (not .cse19)) (.cse17 (not .cse18))) (let ((.cse11 (ite (or (and .cse16 .cse17) .cse31) 0 v_~y$w_buff1_used~0_562)) (.cse28 (not .cse27))) (let ((.cse10 (and .cse28 .cse30)) (.cse29 (= (mod .cse11 256) 0))) (let ((.cse22 (ite (or .cse10 (and (not .cse29) .cse17)) 0 v_~y$r_buff1_thd0~0_265))) (let ((.cse25 (= (mod .cse22 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_200 256) 0))) (let ((.cse9 (and .cse29 .cse27)) (.cse0 (select |v_#memory_int_758| |v_~#y~0.base_334|)) (.cse4 (not .cse5)) (.cse7 (and .cse25 .cse27)) (.cse24 (= (mod v_~y$w_buff1_used~0_561 256) 0)) (.cse12 (= (mod v_~y$w_buff0_used~0_573 256) 0))) (and (= |v_#memory_int_757| (store |v_#memory_int_758| |v_~#y~0.base_334| (store .cse0 |v_~#y~0.offset_334| |v_ULTIMATE.start_main_#t~ite40#1_123|))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_79| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|) (= v_~main$tmp_guard1~0_66 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_89) (= 2 v_~__unbuffered_p0_EAX~0_232) |v_ULTIMATE.start_main_#t~short38#1_208|)) 1 0) 0) 0 1)) (= v_~y$flush_delayed~0_180 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_79| 0)) (= (mod v_~main$tmp_guard0~0_112 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem34#1_183| |v_ULTIMATE.start_main_#t~mem34#1_181|)) (.cse1 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_176 256) 0))) (or (and .cse1 (= |v_ULTIMATE.start_main_#t~ite35#1_178| |v_ULTIMATE.start_main_#t~ite35#1_180|) (= v_~__unbuffered_p0_EAX~0_233 v_~__unbuffered_p0_EAX~0_232) .cse2) (and (let ((.cse3 (= (mod v_~weak$$choice1~0_75 256) 0))) (or (and .cse3 (= |v_ULTIMATE.start_main_#t~ite35#1_178| v_~__unbuffered_p0_EAX~0_233) .cse2) (and (= |v_ULTIMATE.start_main_#t~mem34#1_181| (select (select (store |v_#memory_int_758| |v_~#y~0.base_334| (store .cse0 |v_~#y~0.offset_334| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_161) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_161)) (= |v_ULTIMATE.start_main_#t~mem34#1_181| |v_ULTIMATE.start_main_#t~ite35#1_178|) (not .cse3)))) (not .cse1) (= |v_ULTIMATE.start_main_#t~ite35#1_178| v_~__unbuffered_p0_EAX~0_232)))) (= (ite (= (ite (= v_~__unbuffered_cnt~0_289 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_112) (= v_~y$mem_tmp~0_158 2) (or (and (= v_~y$mem_tmp~0_158 |v_ULTIMATE.start_main_#t~ite40#1_123|) (= |v_ULTIMATE.start_main_#t~mem39#1_151| |v_ULTIMATE.start_main_#t~mem39#1_153|) .cse4) (and (= |v_ULTIMATE.start_main_#t~mem39#1_151| 2) (= |v_ULTIMATE.start_main_#t~mem39#1_151| |v_ULTIMATE.start_main_#t~ite40#1_123|) .cse5)) (= v_~y$w_buff1~0_374 v_~y$w_buff1~0_373) (= 2 v_~x~0_111) (= v_~y$w_buff0~0_366 v_~y$w_buff0~0_365) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= v_~y$w_buff0_used~0_573 (ite .cse4 .cse6 (ite (or .cse7 .cse8 .cse9) .cse6 (ite .cse10 0 .cse6)))) (= (ite .cse4 .cse11 (ite (or .cse7 .cse12 .cse9) .cse11 0)) v_~y$w_buff1_used~0_561) (= (mod v_~main$tmp_guard1~0_66 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|) (= v_~weak$$choice2~0_200 |v_ULTIMATE.start_main_#t~nondet29#1_123|) (= v_~weak$$choice1~0_75 |v_ULTIMATE.start_main_#t~nondet33#1_113|) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~mem25#1_177| |v_ULTIMATE.start_main_#t~mem25#1_175|))) (or (and (= |v_ULTIMATE.start_main_#t~ite26#1_176| |v_ULTIMATE.start_main_#t~ite26#1_174|) .cse13 .cse14 .cse15 (= v_~y$mem_tmp~0_158 v_~y$w_buff0~0_366)) (and (= v_~y$mem_tmp~0_158 |v_ULTIMATE.start_main_#t~ite26#1_174|) (or (and .cse13 .cse16 .cse17 (= v_~y$w_buff1~0_374 |v_ULTIMATE.start_main_#t~ite26#1_174|)) (and (or .cse18 .cse19) (= |v_ULTIMATE.start_main_#t~ite26#1_174| |v_ULTIMATE.start_main_#t~mem25#1_175|) (= (select .cse0 |v_~#y~0.offset_334|) |v_ULTIMATE.start_main_#t~mem25#1_175|))) (or .cse20 .cse21)))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0) (= (ite .cse4 .cse22 (ite (let ((.cse23 (= (mod v_~y$r_buff0_thd0~0_267 256) 0))) (or (and .cse23 .cse24) (and .cse23 .cse25) .cse12)) .cse22 0)) v_~y$r_buff1_thd0~0_264) (= v_~y$r_buff0_thd0~0_267 (ite .cse4 .cse26 (ite (or .cse7 (and .cse24 .cse27) .cse12) .cse26 (ite (and (not .cse12) .cse28) 0 .cse26)))) (= |v_ULTIMATE.start_main_#t~nondet28#1_111| v_~weak$$choice0~0_150) |v_ULTIMATE.start_main_#t~short38#1_207|)))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_334|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_574, ~#y~0.base=|v_~#y~0.base_334|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_183|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_177|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_180|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, ~y$w_buff0~0=v_~y$w_buff0~0_366, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_89, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_176, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_153|, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_176|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_123|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_161, ~y$w_buff1~0=v_~y$w_buff1~0_374, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_113|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_268, #memory_int=|v_#memory_int_758|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_161, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289, ~x~0=v_~x~0_111, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_265, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_562, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_111|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_74|, ~#y~0.offset=|v_~#y~0.offset_334|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_573, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_65|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_66, ~#y~0.base=|v_~#y~0.base_334|, ULTIMATE.start_main_#t~short38#1=|v_ULTIMATE.start_main_#t~short38#1_206|, ~y$mem_tmp~0=v_~y$mem_tmp~0_158, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_232, ~weak$$choice1~0=v_~weak$$choice1~0_75, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_168|, ~y$w_buff0~0=v_~y$w_buff0~0_365, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_79|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_118|, ~y$flush_delayed~0=v_~y$flush_delayed~0_180, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_89, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_176, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_122|, ULTIMATE.start_main_#t~ite27#1=|v_ULTIMATE.start_main_#t~ite27#1_138|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_112, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_161, ~weak$$choice0~0=v_~weak$$choice0~0_150, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~y$w_buff1~0=v_~y$w_buff1~0_373, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_71|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_267, #memory_int=|v_#memory_int_757|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_161, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_57|, ~weak$$choice2~0=v_~weak$$choice2~0_200, ~x~0=v_~x~0_111, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_264, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_143|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_561, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_123|, |v_ULTIMATE.start_main_#t~mem39#1_151|, |v_ULTIMATE.start_main_#t~ite35#1_178|, |v_ULTIMATE.start_main_#t~mem25#1_175|, |v_ULTIMATE.start_main_#t~mem34#1_181|, |v_ULTIMATE.start_main_#t~ite26#1_174|, |v_ULTIMATE.start_main_#t~short38#1_208|, |v_ULTIMATE.start_main_#t~short38#1_207|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem30#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_#t~short38#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite27#1, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet29#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet33#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~nondet24#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 04:30:50,598 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [745] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_19| 0) (= v_~__unbuffered_cnt~0_143 (+ v_~__unbuffered_cnt~0_144 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_19|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_144} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_143, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_19|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [759] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse21 (= (mod v_~y$w_buff0_used~0_574 256) 0)) (.cse20 (= (mod v_~y$r_buff0_thd0~0_268 256) 0))) (let ((.cse14 (not .cse20)) (.cse15 (not .cse21))) (let ((.cse6 (ite (and .cse14 .cse15) 0 v_~y$w_buff0_used~0_574))) (let ((.cse8 (= (mod .cse6 256) 0))) (let ((.cse30 (not .cse8))) (let ((.cse31 (and .cse30 .cse14))) (let ((.cse18 (= (mod v_~y$r_buff1_thd0~0_265 256) 0)) (.cse19 (= (mod v_~y$w_buff1_used~0_562 256) 0)) (.cse26 (ite .cse31 0 v_~y$r_buff0_thd0~0_268))) (let ((.cse27 (= 0 (mod .cse26 256))) (.cse16 (not .cse19)) (.cse17 (not .cse18))) (let ((.cse11 (ite (or (and .cse16 .cse17) .cse31) 0 v_~y$w_buff1_used~0_562)) (.cse28 (not .cse27))) (let ((.cse10 (and .cse28 .cse30)) (.cse29 (= (mod .cse11 256) 0))) (let ((.cse22 (ite (or .cse10 (and (not .cse29) .cse17)) 0 v_~y$r_buff1_thd0~0_265))) (let ((.cse25 (= (mod .cse22 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_200 256) 0))) (let ((.cse9 (and .cse29 .cse27)) (.cse0 (select |v_#memory_int_758| |v_~#y~0.base_334|)) (.cse4 (not .cse5)) (.cse7 (and .cse25 .cse27)) (.cse24 (= (mod v_~y$w_buff1_used~0_561 256) 0)) (.cse12 (= (mod v_~y$w_buff0_used~0_573 256) 0))) (and (= |v_#memory_int_757| (store |v_#memory_int_758| |v_~#y~0.base_334| (store .cse0 |v_~#y~0.offset_334| |v_ULTIMATE.start_main_#t~ite40#1_123|))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_79| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|) (= v_~main$tmp_guard1~0_66 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_89) (= 2 v_~__unbuffered_p0_EAX~0_232) |v_ULTIMATE.start_main_#t~short38#1_208|)) 1 0) 0) 0 1)) (= v_~y$flush_delayed~0_180 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_79| 0)) (= (mod v_~main$tmp_guard0~0_112 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem34#1_183| |v_ULTIMATE.start_main_#t~mem34#1_181|)) (.cse1 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_176 256) 0))) (or (and .cse1 (= |v_ULTIMATE.start_main_#t~ite35#1_178| |v_ULTIMATE.start_main_#t~ite35#1_180|) (= v_~__unbuffered_p0_EAX~0_233 v_~__unbuffered_p0_EAX~0_232) .cse2) (and (let ((.cse3 (= (mod v_~weak$$choice1~0_75 256) 0))) (or (and .cse3 (= |v_ULTIMATE.start_main_#t~ite35#1_178| v_~__unbuffered_p0_EAX~0_233) .cse2) (and (= |v_ULTIMATE.start_main_#t~mem34#1_181| (select (select (store |v_#memory_int_758| |v_~#y~0.base_334| (store .cse0 |v_~#y~0.offset_334| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_161) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_161)) (= |v_ULTIMATE.start_main_#t~mem34#1_181| |v_ULTIMATE.start_main_#t~ite35#1_178|) (not .cse3)))) (not .cse1) (= |v_ULTIMATE.start_main_#t~ite35#1_178| v_~__unbuffered_p0_EAX~0_232)))) (= (ite (= (ite (= v_~__unbuffered_cnt~0_289 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_112) (= v_~y$mem_tmp~0_158 2) (or (and (= v_~y$mem_tmp~0_158 |v_ULTIMATE.start_main_#t~ite40#1_123|) (= |v_ULTIMATE.start_main_#t~mem39#1_151| |v_ULTIMATE.start_main_#t~mem39#1_153|) .cse4) (and (= |v_ULTIMATE.start_main_#t~mem39#1_151| 2) (= |v_ULTIMATE.start_main_#t~mem39#1_151| |v_ULTIMATE.start_main_#t~ite40#1_123|) .cse5)) (= v_~y$w_buff1~0_374 v_~y$w_buff1~0_373) (= 2 v_~x~0_111) (= v_~y$w_buff0~0_366 v_~y$w_buff0~0_365) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= v_~y$w_buff0_used~0_573 (ite .cse4 .cse6 (ite (or .cse7 .cse8 .cse9) .cse6 (ite .cse10 0 .cse6)))) (= (ite .cse4 .cse11 (ite (or .cse7 .cse12 .cse9) .cse11 0)) v_~y$w_buff1_used~0_561) (= (mod v_~main$tmp_guard1~0_66 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|) (= v_~weak$$choice2~0_200 |v_ULTIMATE.start_main_#t~nondet29#1_123|) (= v_~weak$$choice1~0_75 |v_ULTIMATE.start_main_#t~nondet33#1_113|) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~mem25#1_177| |v_ULTIMATE.start_main_#t~mem25#1_175|))) (or (and (= |v_ULTIMATE.start_main_#t~ite26#1_176| |v_ULTIMATE.start_main_#t~ite26#1_174|) .cse13 .cse14 .cse15 (= v_~y$mem_tmp~0_158 v_~y$w_buff0~0_366)) (and (= v_~y$mem_tmp~0_158 |v_ULTIMATE.start_main_#t~ite26#1_174|) (or (and .cse13 .cse16 .cse17 (= v_~y$w_buff1~0_374 |v_ULTIMATE.start_main_#t~ite26#1_174|)) (and (or .cse18 .cse19) (= |v_ULTIMATE.start_main_#t~ite26#1_174| |v_ULTIMATE.start_main_#t~mem25#1_175|) (= (select .cse0 |v_~#y~0.offset_334|) |v_ULTIMATE.start_main_#t~mem25#1_175|))) (or .cse20 .cse21)))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0) (= (ite .cse4 .cse22 (ite (let ((.cse23 (= (mod v_~y$r_buff0_thd0~0_267 256) 0))) (or (and .cse23 .cse24) (and .cse23 .cse25) .cse12)) .cse22 0)) v_~y$r_buff1_thd0~0_264) (= v_~y$r_buff0_thd0~0_267 (ite .cse4 .cse26 (ite (or .cse7 (and .cse24 .cse27) .cse12) .cse26 (ite (and (not .cse12) .cse28) 0 .cse26)))) (= |v_ULTIMATE.start_main_#t~nondet28#1_111| v_~weak$$choice0~0_150) |v_ULTIMATE.start_main_#t~short38#1_207|)))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_334|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_574, ~#y~0.base=|v_~#y~0.base_334|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_183|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_177|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_180|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, ~y$w_buff0~0=v_~y$w_buff0~0_366, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_89, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_176, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_153|, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_176|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_123|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_161, ~y$w_buff1~0=v_~y$w_buff1~0_374, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_113|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_268, #memory_int=|v_#memory_int_758|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_161, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289, ~x~0=v_~x~0_111, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_265, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_562, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_111|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_74|, ~#y~0.offset=|v_~#y~0.offset_334|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_573, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_65|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_66, ~#y~0.base=|v_~#y~0.base_334|, ULTIMATE.start_main_#t~short38#1=|v_ULTIMATE.start_main_#t~short38#1_206|, ~y$mem_tmp~0=v_~y$mem_tmp~0_158, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_232, ~weak$$choice1~0=v_~weak$$choice1~0_75, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_168|, ~y$w_buff0~0=v_~y$w_buff0~0_365, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_79|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_118|, ~y$flush_delayed~0=v_~y$flush_delayed~0_180, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_89, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_176, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_122|, ULTIMATE.start_main_#t~ite27#1=|v_ULTIMATE.start_main_#t~ite27#1_138|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_112, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_161, ~weak$$choice0~0=v_~weak$$choice0~0_150, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~y$w_buff1~0=v_~y$w_buff1~0_373, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_71|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_267, #memory_int=|v_#memory_int_757|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_161, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_57|, ~weak$$choice2~0=v_~weak$$choice2~0_200, ~x~0=v_~x~0_111, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_264, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_143|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_561, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_123|, |v_ULTIMATE.start_main_#t~mem39#1_151|, |v_ULTIMATE.start_main_#t~ite35#1_178|, |v_ULTIMATE.start_main_#t~mem25#1_175|, |v_ULTIMATE.start_main_#t~mem34#1_181|, |v_ULTIMATE.start_main_#t~ite26#1_174|, |v_ULTIMATE.start_main_#t~short38#1_208|, |v_ULTIMATE.start_main_#t~short38#1_207|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem30#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_#t~short38#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite27#1, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet29#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet33#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~nondet24#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 04:30:51,906 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:30:51,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68270 [2022-12-06 04:30:51,907 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 288 flow [2022-12-06 04:30:51,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:30:51,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:30:51,907 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:51,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:30:51,908 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:30:51,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:30:51,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1500245478, now seen corresponding path program 1 times [2022-12-06 04:30:51,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:30:51,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066116735] [2022-12-06 04:30:51,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:30:51,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:30:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:30:51,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:30:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:30:52,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:30:52,081 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:30:52,082 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 04:30:52,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 04:30:52,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 04:30:52,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 04:30:52,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 04:30:52,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:30:52,088 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:30:52,091 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:30:52,091 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:30:52,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:30:52 BasicIcfg [2022-12-06 04:30:52,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:30:52,189 INFO L158 Benchmark]: Toolchain (without parser) took 89536.87ms. Allocated memory was 226.5MB in the beginning and 854.6MB in the end (delta: 628.1MB). Free memory was 199.8MB in the beginning and 663.4MB in the end (delta: -463.6MB). Peak memory consumption was 165.9MB. Max. memory is 8.0GB. [2022-12-06 04:30:52,189 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 226.5MB. Free memory is still 202.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:30:52,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.21ms. Allocated memory is still 226.5MB. Free memory was 199.8MB in the beginning and 171.4MB in the end (delta: 28.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 04:30:52,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.91ms. Allocated memory is still 226.5MB. Free memory was 171.4MB in the beginning and 168.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:30:52,189 INFO L158 Benchmark]: Boogie Preprocessor took 29.03ms. Allocated memory is still 226.5MB. Free memory was 168.8MB in the beginning and 166.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:30:52,189 INFO L158 Benchmark]: RCFGBuilder took 836.86ms. Allocated memory is still 226.5MB. Free memory was 166.1MB in the beginning and 95.4MB in the end (delta: 70.8MB). Peak memory consumption was 71.3MB. Max. memory is 8.0GB. [2022-12-06 04:30:52,189 INFO L158 Benchmark]: TraceAbstraction took 88150.54ms. Allocated memory was 226.5MB in the beginning and 854.6MB in the end (delta: 628.1MB). Free memory was 94.8MB in the beginning and 663.4MB in the end (delta: -568.6MB). Peak memory consumption was 61.1MB. Max. memory is 8.0GB. [2022-12-06 04:30:52,190 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 226.5MB. Free memory is still 202.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 475.21ms. Allocated memory is still 226.5MB. Free memory was 199.8MB in the beginning and 171.4MB in the end (delta: 28.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.91ms. Allocated memory is still 226.5MB. Free memory was 171.4MB in the beginning and 168.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.03ms. Allocated memory is still 226.5MB. Free memory was 168.8MB in the beginning and 166.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 836.86ms. Allocated memory is still 226.5MB. Free memory was 166.1MB in the beginning and 95.4MB in the end (delta: 70.8MB). Peak memory consumption was 71.3MB. Max. memory is 8.0GB. * TraceAbstraction took 88150.54ms. Allocated memory was 226.5MB in the beginning and 854.6MB in the end (delta: 628.1MB). Free memory was 94.8MB in the beginning and 663.4MB in the end (delta: -568.6MB). Peak memory consumption was 61.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3s, 136 PlacesBefore, 36 PlacesAfterwards, 124 TransitionsBefore, 24 TransitionsAfterwards, 1736 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 60 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 102 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1377, independent: 1306, independent conditional: 1306, independent unconditional: 0, dependent: 71, dependent conditional: 71, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1377, independent: 1306, independent conditional: 0, independent unconditional: 1306, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1377, independent: 1306, independent conditional: 0, independent unconditional: 1306, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1377, independent: 1306, independent conditional: 0, independent unconditional: 1306, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1100, independent: 1057, independent conditional: 0, independent unconditional: 1057, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1100, independent: 1029, independent conditional: 0, independent unconditional: 1029, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 409, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 376, dependent conditional: 0, dependent unconditional: 376, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1377, independent: 249, independent conditional: 0, independent unconditional: 249, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 1100, unknown conditional: 0, unknown unconditional: 1100] , Statistics on independence cache: Total cache size (in pairs): 1705, Positive cache size: 1662, Positive conditional cache size: 0, Positive unconditional cache size: 1662, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 32 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 63, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 63, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 97, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 63, unknown conditional: 0, unknown unconditional: 63] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 45, Positive conditional cache size: 0, Positive unconditional cache size: 45, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 50, independent conditional: 6, independent unconditional: 44, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 33, dependent conditional: 3, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 14, unknown conditional: 1, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 21, Negative conditional cache size: 1, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 63, independent: 47, independent conditional: 9, independent unconditional: 38, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 21, Negative conditional cache size: 1, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 38 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 59, independent: 44, independent conditional: 9, independent unconditional: 35, dependent: 15, dependent conditional: 10, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, independent: 44, independent conditional: 3, independent unconditional: 41, dependent: 15, dependent conditional: 10, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, independent: 44, independent conditional: 3, independent unconditional: 41, dependent: 15, dependent conditional: 10, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 115, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 115, dependent conditional: 115, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, independent: 44, independent conditional: 3, independent unconditional: 41, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 31, Negative conditional cache size: 11, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 86, independent: 69, independent conditional: 10, independent unconditional: 59, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 86, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 86, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 31, Negative conditional cache size: 11, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 93, independent: 78, independent conditional: 18, independent unconditional: 60, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 93, independent: 78, independent conditional: 8, independent unconditional: 70, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93, independent: 78, independent conditional: 8, independent unconditional: 70, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, independent: 78, independent conditional: 8, independent unconditional: 70, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 31, Negative conditional cache size: 11, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 85, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 85, independent: 77, independent conditional: 31, independent unconditional: 46, dependent: 8, dependent conditional: 1, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 85, independent: 77, independent conditional: 18, independent unconditional: 59, dependent: 8, dependent conditional: 1, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 85, independent: 77, independent conditional: 18, independent unconditional: 59, dependent: 8, dependent conditional: 1, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 85, independent: 76, independent conditional: 18, independent unconditional: 58, dependent: 8, dependent conditional: 1, dependent unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 57, Positive conditional cache size: 0, Positive unconditional cache size: 57, Negative cache size: 31, Negative conditional cache size: 11, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 390 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 87, independent conditional: 87, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 87, independent conditional: 42, independent unconditional: 45, dependent: 9, dependent conditional: 1, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, independent: 87, independent conditional: 26, independent unconditional: 61, dependent: 9, dependent conditional: 1, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, independent: 87, independent conditional: 26, independent unconditional: 61, dependent: 9, dependent conditional: 1, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, independent: 85, independent conditional: 25, independent unconditional: 60, dependent: 9, dependent conditional: 1, dependent unconditional: 8, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 59, Positive conditional cache size: 1, Positive unconditional cache size: 58, Negative cache size: 31, Negative conditional cache size: 11, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 60, Positive conditional cache size: 1, Positive unconditional cache size: 59, Negative cache size: 32, Negative conditional cache size: 11, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 548 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 61, Positive conditional cache size: 1, Positive unconditional cache size: 60, Negative cache size: 33, Negative conditional cache size: 11, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 56 PlacesBefore, 56 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 37, independent: 31, independent conditional: 27, independent unconditional: 4, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, independent: 31, independent conditional: 17, independent unconditional: 14, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, independent: 31, independent conditional: 17, independent unconditional: 14, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 6, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, independent: 21, independent conditional: 11, independent unconditional: 10, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 11, unknown conditional: 6, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 74, Positive conditional cache size: 7, Positive unconditional cache size: 67, Negative cache size: 34, Negative conditional cache size: 11, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 68.3s, 57 PlacesBefore, 53 PlacesAfterwards, 41 TransitionsBefore, 35 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 117, independent: 95, independent conditional: 95, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 117, independent: 95, independent conditional: 83, independent unconditional: 12, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 117, independent: 95, independent conditional: 55, independent unconditional: 40, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 117, independent: 95, independent conditional: 55, independent unconditional: 40, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 16, independent conditional: 12, independent unconditional: 4, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 117, independent: 79, independent conditional: 43, independent unconditional: 36, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 17, unknown conditional: 13, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 104, Positive conditional cache size: 19, Positive unconditional cache size: 85, Negative cache size: 35, Negative conditional cache size: 12, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2161; [L852] FCALL, FORK 0 pthread_create(&t2161, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2161, ((void *)0), P0, ((void *)0))=10, t2161={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] 0 pthread_t t2162; [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] EXPR 1 \read(y) [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L769] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L770] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L771] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L772] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L774] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L777] EXPR 1 \read(y) [L777] 1 __unbuffered_p0_EAX = y [L778] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L778] 1 y = y$flush_delayed ? y$mem_tmp : y [L779] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] FCALL, FORK 0 pthread_create(&t2162, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2162, ((void *)0), P1, ((void *)0))=11, t2161={7:0}, t2162={8:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] 0 pthread_t t2163; [L794] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] FCALL, FORK 0 pthread_create(&t2163, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2163, ((void *)0), P2, ((void *)0))=12, t2161={7:0}, t2162={8:0}, t2163={9:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 3 y = 1 [L857] 3 pthread_t t2164; [L858] FCALL, FORK 0 pthread_create(&t2164, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2164, ((void *)0), P3, ((void *)0))=13, t2161={7:0}, t2162={8:0}, t2163={9:0}, t2164={5:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 4 y = 2 [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 \read(y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 4 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 4 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 4 !(!cond) [L862] RET 4 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 4 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 4 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 4 \read(y) [L864] EXPR 4 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 4 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 4 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 4 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 4 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L871] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 4 y$flush_delayed = weak$$choice2 [L874] EXPR 4 \read(y) [L874] 4 y$mem_tmp = y [L875] EXPR 4 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 4 \read(y) [L875] EXPR 4 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 4 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 4 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 4 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 4 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 4 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 4 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 4 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 4 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 4 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 4 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 4 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 4 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 4 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 4 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 4 x == 2 && y == 2 [L884] EXPR 4 \read(y) [L884] EXPR 4 x == 2 && y == 2 [L884] 4 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L885] EXPR 4 y$flush_delayed ? y$mem_tmp : y [L885] EXPR 4 \read(y) [L885] EXPR 4 y$flush_delayed ? y$mem_tmp : y [L885] 4 y = y$flush_delayed ? y$mem_tmp : y [L886] 4 y$flush_delayed = (_Bool)0 [L888] CALL 4 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 87.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 467 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 467 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 680 IncrementalHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 6 mSDtfsCounter, 680 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=11, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 1070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:30:52,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...