/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:40:13,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:40:13,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:40:13,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:40:13,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:40:13,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:40:13,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:40:13,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:40:13,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:40:13,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:40:13,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:40:13,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:40:13,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:40:13,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:40:13,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:40:13,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:40:13,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:40:13,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:40:13,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:40:13,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:40:13,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:40:13,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:40:13,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:40:13,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:40:13,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:40:13,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:40:13,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:40:13,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:40:13,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:40:13,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:40:13,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:40:13,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:40:13,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:40:13,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:40:13,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:40:13,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:40:13,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:40:13,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:40:13,857 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:40:13,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:40:13,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:40:13,860 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:40:13,888 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:40:13,889 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:40:13,890 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:40:13,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:40:13,890 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:40:13,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:40:13,890 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:40:13,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:40:13,890 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:40:13,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:40:13,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:40:13,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:40:13,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:40:13,891 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:40:13,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:40:13,891 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:40:13,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:40:13,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:40:13,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:40:13,892 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:40:13,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:40:13,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:40:13,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:40:13,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:40:13,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:40:13,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:40:13,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:40:13,893 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:40:13,893 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:40:14,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:40:14,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:40:14,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:40:14,252 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:40:14,253 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:40:14,254 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2022-12-13 00:40:15,479 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:40:15,724 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:40:15,725 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2022-12-13 00:40:15,735 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33dc3d1fe/9ac1da73a0fe4d7d80ad452003f59dc6/FLAG79465ac80 [2022-12-13 00:40:15,749 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33dc3d1fe/9ac1da73a0fe4d7d80ad452003f59dc6 [2022-12-13 00:40:15,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:40:15,752 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:40:15,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:40:15,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:40:15,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:40:15,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:40:15" (1/1) ... [2022-12-13 00:40:15,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e286faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:15, skipping insertion in model container [2022-12-13 00:40:15,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:40:15" (1/1) ... [2022-12-13 00:40:15,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:40:15,814 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:40:15,947 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/mix031.oepc.i[945,958] [2022-12-13 00:40:16,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:40:16,134 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:40:16,146 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/mix031.oepc.i[945,958] [2022-12-13 00:40:16,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:40:16,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:40:16,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:40:16,263 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:40:16,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:16 WrapperNode [2022-12-13 00:40:16,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:40:16,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:40:16,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:40:16,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:40:16,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:16" (1/1) ... [2022-12-13 00:40:16,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:16" (1/1) ... [2022-12-13 00:40:16,338 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2022-12-13 00:40:16,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:40:16,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:40:16,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:40:16,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:40:16,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:16" (1/1) ... [2022-12-13 00:40:16,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:16" (1/1) ... [2022-12-13 00:40:16,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:16" (1/1) ... [2022-12-13 00:40:16,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:16" (1/1) ... [2022-12-13 00:40:16,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:16" (1/1) ... [2022-12-13 00:40:16,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:16" (1/1) ... [2022-12-13 00:40:16,378 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:16" (1/1) ... [2022-12-13 00:40:16,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:16" (1/1) ... [2022-12-13 00:40:16,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:40:16,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:40:16,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:40:16,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:40:16,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:16" (1/1) ... [2022-12-13 00:40:16,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:40:16,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:40:16,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:40:16,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:40:16,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:40:16,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:40:16,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:40:16,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:40:16,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:40:16,477 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:40:16,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:40:16,478 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:40:16,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:40:16,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:40:16,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:40:16,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:40:16,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:40:16,480 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:40:16,636 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:40:16,650 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:40:16,949 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:40:17,051 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:40:17,051 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:40:17,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:40:17 BoogieIcfgContainer [2022-12-13 00:40:17,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:40:17,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:40:17,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:40:17,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:40:17,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:40:15" (1/3) ... [2022-12-13 00:40:17,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e180a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:40:17, skipping insertion in model container [2022-12-13 00:40:17,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:40:16" (2/3) ... [2022-12-13 00:40:17,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e180a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:40:17, skipping insertion in model container [2022-12-13 00:40:17,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:40:17" (3/3) ... [2022-12-13 00:40:17,060 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2022-12-13 00:40:17,076 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:40:17,076 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:40:17,076 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:40:17,138 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:40:17,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 96 transitions, 202 flow [2022-12-13 00:40:17,234 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2022-12-13 00:40:17,234 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:40:17,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-13 00:40:17,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 96 transitions, 202 flow [2022-12-13 00:40:17,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 94 transitions, 194 flow [2022-12-13 00:40:17,246 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:17,271 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 94 transitions, 194 flow [2022-12-13 00:40:17,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 94 transitions, 194 flow [2022-12-13 00:40:17,296 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2022-12-13 00:40:17,296 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:40:17,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-13 00:40:17,299 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 94 transitions, 194 flow [2022-12-13 00:40:17,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 1346 [2022-12-13 00:40:21,931 INFO L241 LiptonReduction]: Total number of compositions: 76 [2022-12-13 00:40:21,945 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:40:21,951 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;@2f2e3c5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:40:21,951 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 00:40:21,953 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2022-12-13 00:40:21,953 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:40:21,953 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:21,954 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 00:40:21,954 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:40:21,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:21,958 INFO L85 PathProgramCache]: Analyzing trace with hash 441480, now seen corresponding path program 1 times [2022-12-13 00:40:21,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:21,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038454766] [2022-12-13 00:40:21,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:21,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:22,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:22,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:22,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038454766] [2022-12-13 00:40:22,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038454766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:22,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:22,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:40:22,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789487767] [2022-12-13 00:40:22,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:22,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:40:22,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:22,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:40:22,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:40:22,387 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2022-12-13 00:40:22,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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-13 00:40:22,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:22,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2022-12-13 00:40:22,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:22,813 INFO L130 PetriNetUnfolder]: 1622/3005 cut-off events. [2022-12-13 00:40:22,813 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 00:40:22,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5648 conditions, 3005 events. 1622/3005 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 20730 event pairs, 408 based on Foata normal form. 0/1563 useless extension candidates. Maximal degree in co-relation 5638. Up to 2326 conditions per place. [2022-12-13 00:40:22,824 INFO L137 encePairwiseOnDemand]: 48/55 looper letters, 26 selfloop transitions, 3 changer transitions 47/85 dead transitions. [2022-12-13 00:40:22,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 85 transitions, 329 flow [2022-12-13 00:40:22,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:40:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:40:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-12-13 00:40:22,835 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2022-12-13 00:40:22,836 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 116 flow. Second operand 3 states and 112 transitions. [2022-12-13 00:40:22,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 85 transitions, 329 flow [2022-12-13 00:40:22,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 85 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:40:22,841 INFO L231 Difference]: Finished difference. Result has 58 places, 27 transitions, 64 flow [2022-12-13 00:40:22,843 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=58, PETRI_TRANSITIONS=27} [2022-12-13 00:40:22,846 INFO L295 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2022-12-13 00:40:22,847 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:22,847 INFO L89 Accepts]: Start accepts. Operand has 58 places, 27 transitions, 64 flow [2022-12-13 00:40:22,850 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:22,850 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:22,850 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 27 transitions, 64 flow [2022-12-13 00:40:22,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 64 flow [2022-12-13 00:40:22,855 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-13 00:40:22,855 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:40:22,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 0/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 62 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:40:22,858 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 27 transitions, 64 flow [2022-12-13 00:40:22,858 INFO L226 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-13 00:40:22,943 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:40:22,945 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 00:40:22,945 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 64 flow [2022-12-13 00:40:22,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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-13 00:40:22,945 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:22,945 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:22,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:40:22,946 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:40:22,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:22,946 INFO L85 PathProgramCache]: Analyzing trace with hash -244421573, now seen corresponding path program 1 times [2022-12-13 00:40:22,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:22,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962117979] [2022-12-13 00:40:22,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:22,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:23,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:23,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962117979] [2022-12-13 00:40:23,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962117979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:23,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:23,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:40:23,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025368141] [2022-12-13 00:40:23,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:23,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:40:23,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:23,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:40:23,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:40:23,163 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2022-12-13 00:40:23,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:23,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:23,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2022-12-13 00:40:23,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:23,322 INFO L130 PetriNetUnfolder]: 493/874 cut-off events. [2022-12-13 00:40:23,323 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-13 00:40:23,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1795 conditions, 874 events. 493/874 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3994 event pairs, 193 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 1785. Up to 735 conditions per place. [2022-12-13 00:40:23,327 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 28 selfloop transitions, 3 changer transitions 2/38 dead transitions. [2022-12-13 00:40:23,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 158 flow [2022-12-13 00:40:23,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:40:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:40:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-13 00:40:23,329 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2022-12-13 00:40:23,329 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 64 flow. Second operand 3 states and 49 transitions. [2022-12-13 00:40:23,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 158 flow [2022-12-13 00:40:23,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:40:23,330 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 75 flow [2022-12-13 00:40:23,330 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2022-12-13 00:40:23,331 INFO L295 CegarLoopForPetriNet]: 61 programPoint places, -26 predicate places. [2022-12-13 00:40:23,331 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:23,331 INFO L89 Accepts]: Start accepts. Operand has 35 places, 28 transitions, 75 flow [2022-12-13 00:40:23,332 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:23,332 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:23,332 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 28 transitions, 75 flow [2022-12-13 00:40:23,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 28 transitions, 75 flow [2022-12-13 00:40:23,339 INFO L130 PetriNetUnfolder]: 3/42 cut-off events. [2022-12-13 00:40:23,339 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:40:23,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 42 events. 3/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 113 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-13 00:40:23,340 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 28 transitions, 75 flow [2022-12-13 00:40:23,341 INFO L226 LiptonReduction]: Number of co-enabled transitions 348 [2022-12-13 00:40:23,378 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:40:23,380 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-13 00:40:23,380 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 75 flow [2022-12-13 00:40:23,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:23,380 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:23,381 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:23,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:40:23,381 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:40:23,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:23,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1792983848, now seen corresponding path program 1 times [2022-12-13 00:40:23,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:23,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668214609] [2022-12-13 00:40:23,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:23,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:23,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:23,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668214609] [2022-12-13 00:40:23,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668214609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:23,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:23,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:40:23,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185017523] [2022-12-13 00:40:23,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:23,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:40:23,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:23,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:40:23,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:40:23,532 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2022-12-13 00:40:23,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 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-13 00:40:23,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:23,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2022-12-13 00:40:23,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:23,656 INFO L130 PetriNetUnfolder]: 354/645 cut-off events. [2022-12-13 00:40:23,661 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2022-12-13 00:40:23,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1386 conditions, 645 events. 354/645 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2753 event pairs, 134 based on Foata normal form. 15/542 useless extension candidates. Maximal degree in co-relation 1375. Up to 413 conditions per place. [2022-12-13 00:40:23,666 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 27 selfloop transitions, 3 changer transitions 1/36 dead transitions. [2022-12-13 00:40:23,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 153 flow [2022-12-13 00:40:23,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:40:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:40:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-13 00:40:23,669 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-13 00:40:23,669 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 75 flow. Second operand 3 states and 46 transitions. [2022-12-13 00:40:23,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 153 flow [2022-12-13 00:40:23,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:40:23,671 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 81 flow [2022-12-13 00:40:23,671 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2022-12-13 00:40:23,672 INFO L295 CegarLoopForPetriNet]: 61 programPoint places, -25 predicate places. [2022-12-13 00:40:23,673 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:23,673 INFO L89 Accepts]: Start accepts. Operand has 36 places, 27 transitions, 81 flow [2022-12-13 00:40:23,673 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:23,673 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:23,673 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 27 transitions, 81 flow [2022-12-13 00:40:23,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 81 flow [2022-12-13 00:40:23,679 INFO L130 PetriNetUnfolder]: 2/34 cut-off events. [2022-12-13 00:40:23,679 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 00:40:23,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 34 events. 2/34 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 91 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 47. Up to 8 conditions per place. [2022-12-13 00:40:23,680 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 81 flow [2022-12-13 00:40:23,680 INFO L226 LiptonReduction]: Number of co-enabled transitions 318 [2022-12-13 00:40:23,695 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:40:23,696 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 00:40:23,697 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 81 flow [2022-12-13 00:40:23,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 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-13 00:40:23,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:23,697 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:23,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:40:23,697 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:40:23,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:23,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1337334373, now seen corresponding path program 1 times [2022-12-13 00:40:23,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:23,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476674044] [2022-12-13 00:40:23,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:23,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:23,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:23,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476674044] [2022-12-13 00:40:23,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476674044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:23,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:23,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:40:23,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064832511] [2022-12-13 00:40:23,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:23,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:40:23,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:23,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:40:23,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:40:23,829 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2022-12-13 00:40:23,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-13 00:40:23,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:23,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2022-12-13 00:40:23,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:23,927 INFO L130 PetriNetUnfolder]: 218/432 cut-off events. [2022-12-13 00:40:23,927 INFO L131 PetriNetUnfolder]: For 124/130 co-relation queries the response was YES. [2022-12-13 00:40:23,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 432 events. 218/432 cut-off events. For 124/130 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1876 event pairs, 135 based on Foata normal form. 15/373 useless extension candidates. Maximal degree in co-relation 911. Up to 251 conditions per place. [2022-12-13 00:40:23,930 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 24 selfloop transitions, 3 changer transitions 1/36 dead transitions. [2022-12-13 00:40:23,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 36 transitions, 157 flow [2022-12-13 00:40:23,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:40:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:40:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-13 00:40:23,931 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2022-12-13 00:40:23,931 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 81 flow. Second operand 3 states and 49 transitions. [2022-12-13 00:40:23,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 36 transitions, 157 flow [2022-12-13 00:40:23,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 151 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:40:23,936 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 84 flow [2022-12-13 00:40:23,936 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2022-12-13 00:40:23,938 INFO L295 CegarLoopForPetriNet]: 61 programPoint places, -25 predicate places. [2022-12-13 00:40:23,938 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:23,938 INFO L89 Accepts]: Start accepts. Operand has 36 places, 26 transitions, 84 flow [2022-12-13 00:40:23,939 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:23,939 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:23,939 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 84 flow [2022-12-13 00:40:23,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 84 flow [2022-12-13 00:40:23,943 INFO L130 PetriNetUnfolder]: 1/31 cut-off events. [2022-12-13 00:40:23,944 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 00:40:23,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 31 events. 1/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 44. Up to 6 conditions per place. [2022-12-13 00:40:23,944 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 84 flow [2022-12-13 00:40:23,944 INFO L226 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-13 00:40:23,982 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:40:23,984 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 00:40:23,984 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 84 flow [2022-12-13 00:40:23,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-13 00:40:23,984 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:23,984 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:23,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:40:23,985 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:40:23,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:23,985 INFO L85 PathProgramCache]: Analyzing trace with hash -671220676, now seen corresponding path program 1 times [2022-12-13 00:40:23,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:23,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311685410] [2022-12-13 00:40:23,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:23,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:24,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:24,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311685410] [2022-12-13 00:40:24,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311685410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:24,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:24,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:40:24,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264678905] [2022-12-13 00:40:24,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:24,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:40:24,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:24,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:40:24,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:40:24,104 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2022-12-13 00:40:24,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:24,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:24,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2022-12-13 00:40:24,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:24,177 INFO L130 PetriNetUnfolder]: 134/299 cut-off events. [2022-12-13 00:40:24,177 INFO L131 PetriNetUnfolder]: For 105/108 co-relation queries the response was YES. [2022-12-13 00:40:24,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 299 events. 134/299 cut-off events. For 105/108 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1323 event pairs, 37 based on Foata normal form. 14/243 useless extension candidates. Maximal degree in co-relation 679. Up to 253 conditions per place. [2022-12-13 00:40:24,180 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 24 selfloop transitions, 7 changer transitions 1/39 dead transitions. [2022-12-13 00:40:24,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 174 flow [2022-12-13 00:40:24,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:40:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:40:24,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-13 00:40:24,181 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2022-12-13 00:40:24,181 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 84 flow. Second operand 3 states and 50 transitions. [2022-12-13 00:40:24,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 174 flow [2022-12-13 00:40:24,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:40:24,183 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 123 flow [2022-12-13 00:40:24,184 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2022-12-13 00:40:24,184 INFO L295 CegarLoopForPetriNet]: 61 programPoint places, -25 predicate places. [2022-12-13 00:40:24,184 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:24,185 INFO L89 Accepts]: Start accepts. Operand has 36 places, 31 transitions, 123 flow [2022-12-13 00:40:24,185 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:24,185 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:24,186 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 123 flow [2022-12-13 00:40:24,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 123 flow [2022-12-13 00:40:24,196 INFO L130 PetriNetUnfolder]: 28/114 cut-off events. [2022-12-13 00:40:24,196 INFO L131 PetriNetUnfolder]: For 48/51 co-relation queries the response was YES. [2022-12-13 00:40:24,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 114 events. 28/114 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 521 event pairs, 9 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 239. Up to 64 conditions per place. [2022-12-13 00:40:24,197 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 31 transitions, 123 flow [2022-12-13 00:40:24,198 INFO L226 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-13 00:40:24,223 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:40:24,224 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-13 00:40:24,224 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 123 flow [2022-12-13 00:40:24,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:24,224 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:24,224 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:24,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:40:24,225 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:40:24,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:24,225 INFO L85 PathProgramCache]: Analyzing trace with hash -409863919, now seen corresponding path program 1 times [2022-12-13 00:40:24,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:24,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321833907] [2022-12-13 00:40:24,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:24,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:24,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:24,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321833907] [2022-12-13 00:40:24,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321833907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:24,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:24,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:40:24,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629562298] [2022-12-13 00:40:24,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:24,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:40:24,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:24,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:40:24,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:40:24,381 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2022-12-13 00:40:24,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:24,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:24,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2022-12-13 00:40:24,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:24,443 INFO L130 PetriNetUnfolder]: 41/142 cut-off events. [2022-12-13 00:40:24,443 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-13 00:40:24,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 142 events. 41/142 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 563 event pairs, 10 based on Foata normal form. 24/132 useless extension candidates. Maximal degree in co-relation 405. Up to 58 conditions per place. [2022-12-13 00:40:24,445 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 18 selfloop transitions, 13 changer transitions 0/38 dead transitions. [2022-12-13 00:40:24,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 201 flow [2022-12-13 00:40:24,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:40:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:40:24,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-13 00:40:24,446 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-13 00:40:24,446 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 123 flow. Second operand 4 states and 52 transitions. [2022-12-13 00:40:24,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 201 flow [2022-12-13 00:40:24,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 182 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 00:40:24,448 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 144 flow [2022-12-13 00:40:24,448 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2022-12-13 00:40:24,449 INFO L295 CegarLoopForPetriNet]: 61 programPoint places, -25 predicate places. [2022-12-13 00:40:24,449 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:24,449 INFO L89 Accepts]: Start accepts. Operand has 36 places, 31 transitions, 144 flow [2022-12-13 00:40:24,450 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:24,450 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:24,450 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 144 flow [2022-12-13 00:40:24,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 144 flow [2022-12-13 00:40:24,468 INFO L130 PetriNetUnfolder]: 10/72 cut-off events. [2022-12-13 00:40:24,468 INFO L131 PetriNetUnfolder]: For 12/18 co-relation queries the response was YES. [2022-12-13 00:40:24,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 72 events. 10/72 cut-off events. For 12/18 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 248 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 166. Up to 37 conditions per place. [2022-12-13 00:40:24,469 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 31 transitions, 144 flow [2022-12-13 00:40:24,469 INFO L226 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-13 00:40:24,944 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:40:24,945 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 496 [2022-12-13 00:40:24,945 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 140 flow [2022-12-13 00:40:24,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:24,946 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:24,946 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:24,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:40:24,946 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:40:24,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:24,946 INFO L85 PathProgramCache]: Analyzing trace with hash 183275727, now seen corresponding path program 1 times [2022-12-13 00:40:24,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:24,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896800281] [2022-12-13 00:40:24,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:24,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:25,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:25,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896800281] [2022-12-13 00:40:25,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896800281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:25,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:25,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:40:25,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016250868] [2022-12-13 00:40:25,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:25,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:40:25,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:25,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:40:25,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:40:25,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2022-12-13 00:40:25,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:25,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:25,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2022-12-13 00:40:25,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:25,529 INFO L130 PetriNetUnfolder]: 63/172 cut-off events. [2022-12-13 00:40:25,529 INFO L131 PetriNetUnfolder]: For 119/125 co-relation queries the response was YES. [2022-12-13 00:40:25,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 172 events. 63/172 cut-off events. For 119/125 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 661 event pairs, 6 based on Foata normal form. 15/160 useless extension candidates. Maximal degree in co-relation 554. Up to 88 conditions per place. [2022-12-13 00:40:25,530 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 27 selfloop transitions, 8 changer transitions 20/60 dead transitions. [2022-12-13 00:40:25,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 60 transitions, 382 flow [2022-12-13 00:40:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 00:40:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 00:40:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2022-12-13 00:40:25,532 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2022-12-13 00:40:25,532 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 140 flow. Second operand 9 states and 83 transitions. [2022-12-13 00:40:25,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 60 transitions, 382 flow [2022-12-13 00:40:25,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 60 transitions, 336 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-13 00:40:25,534 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 150 flow [2022-12-13 00:40:25,535 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=150, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-12-13 00:40:25,535 INFO L295 CegarLoopForPetriNet]: 61 programPoint places, -18 predicate places. [2022-12-13 00:40:25,535 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:25,535 INFO L89 Accepts]: Start accepts. Operand has 43 places, 32 transitions, 150 flow [2022-12-13 00:40:25,536 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:25,536 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:25,536 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 150 flow [2022-12-13 00:40:25,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 150 flow [2022-12-13 00:40:25,545 INFO L130 PetriNetUnfolder]: 12/61 cut-off events. [2022-12-13 00:40:25,546 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-12-13 00:40:25,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 61 events. 12/61 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 208 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 150. Up to 28 conditions per place. [2022-12-13 00:40:25,547 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 32 transitions, 150 flow [2022-12-13 00:40:25,547 INFO L226 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-13 00:40:25,751 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [304] L784-->L787: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] and [356] $Ultimate##0-->L758: Formula: (and (= v_~a$w_buff0_used~0_181 1) (= v_~a$w_buff0_used~0_182 v_~a$w_buff1_used~0_157) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_11| |v_P0Thread1of1ForFork0_~arg#1.offset_11|) (= v_~a$r_buff0_thd1~0_74 1) (= v_~x~0_8 1) (= v_~a$r_buff0_thd1~0_75 v_~a$r_buff1_thd1~0_55) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~a$r_buff0_thd2~0_91 v_~a$r_buff1_thd2~0_96) (= v_~a$w_buff0~0_100 1) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= (ite (not (and (not (= (mod v_~a$w_buff0_used~0_181 256) 0)) (not (= (mod v_~a$w_buff1_used~0_157 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= |v_P0Thread1of1ForFork0_~arg#1.base_11| |v_P0Thread1of1ForFork0_#in~arg#1.base_11|) (= v_~a$w_buff0~0_101 v_~a$w_buff1~0_78) (= v_~a$r_buff0_thd0~0_39 v_~a$r_buff1_thd0~0_37)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_11|, ~a$w_buff0~0=v_~a$w_buff0~0_101, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_91, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_182, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_11|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_75, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_39} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_11|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_55, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_96, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_91, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_11|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_181, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_11|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_74, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_39, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_11|, ~a$w_buff1~0=v_~a$w_buff1~0_78, ~a$w_buff0~0=v_~a$w_buff0~0_100, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_37, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_157, ~x~0=v_~x~0_8, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd2~0, P0Thread1of1ForFork0_~arg#1.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.offset, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ~x~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] [2022-12-13 00:40:26,148 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [430] L784-->L758: Formula: (and (= v_~a$w_buff0~0_268 1) (= v_~a$r_buff0_thd2~0_210 v_~a$r_buff1_thd2~0_224) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_66| |v_P0Thread1of1ForFork0_~arg#1.offset_66|) (= v_~a$w_buff0_used~0_425 v_~a$w_buff1_used~0_366) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_68| 0)) (= v_~a$w_buff0~0_269 v_~a$w_buff1~0_216) (= v_~a$r_buff0_thd1~0_224 1) (= v_~a$r_buff0_thd0~0_155 v_~a$r_buff1_thd0~0_162) (= v_~x~0_53 1) (= |v_P0Thread1of1ForFork0_~arg#1.base_66| |v_P0Thread1of1ForFork0_#in~arg#1.base_66|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_68| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_68|) (= v_~a$r_buff0_thd1~0_225 v_~a$r_buff1_thd1~0_150) (= v_~z~0_38 v_~__unbuffered_p1_EAX~0_88) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_68| (ite (not (and (not (= (mod v_~a$w_buff0_used~0_424 256) 0)) (not (= (mod v_~a$w_buff1_used~0_366 256) 0)))) 1 0)) (= v_~a$w_buff0_used~0_424 1)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_66|, ~a$w_buff0~0=v_~a$w_buff0~0_269, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_210, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_425, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_66|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_225, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_155, ~z~0=v_~z~0_38} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_66|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_150, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_224, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_210, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_66|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_424, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_66|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_155, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_66|, ~a$w_buff1~0=v_~a$w_buff1~0_216, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, ~a$w_buff0~0=v_~a$w_buff0~0_268, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_68|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_162, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_366, ~z~0=v_~z~0_38, ~x~0=v_~x~0_53, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_68|} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd2~0, P0Thread1of1ForFork0_~arg#1.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.offset, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ~x~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] and [305] L787-->L803: Formula: (let ((.cse3 (= 0 (mod v_~a$r_buff1_thd2~0_60 256))) (.cse5 (= (mod v_~a$r_buff0_thd2~0_60 256) 0))) (let ((.cse7 (not .cse5)) (.cse11 (= (mod v_~a$w_buff0_used~0_112 256) 0)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_101 256) 0) .cse5)) (.cse6 (and .cse5 .cse3))) (let ((.cse4 (= (mod v_~a$w_buff1_used~0_100 256) 0)) (.cse1 (= (mod v_~a$w_buff0_used~0_111 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse8 (or .cse11 .cse10 .cse6)) (.cse9 (and (not .cse11) .cse7))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= (ite .cse0 v_~a$r_buff1_thd2~0_60 (ite (let ((.cse2 (= (mod v_~a$r_buff0_thd2~0_59 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse2 .cse4))) v_~a$r_buff1_thd2~0_60 0)) v_~a$r_buff1_thd2~0_59) (= v_~a$r_buff0_thd2~0_59 (ite .cse0 v_~a$r_buff0_thd2~0_60 (ite (or .cse1 (and .cse5 .cse4) .cse6) v_~a$r_buff0_thd2~0_60 (ite (and (not .cse1) .cse7) 0 v_~a$r_buff0_thd2~0_60)))) (= v_~a~0_76 v_~a$mem_tmp~0_22) (= |v_P1Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a~0_74 (ite .cse0 v_~a$mem_tmp~0_22 v_~__unbuffered_p1_EBX~0_12)) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= v_~__unbuffered_p1_EBX~0_12 (ite .cse8 v_~a~0_76 (ite .cse9 v_~a$w_buff0~0_47 v_~a$w_buff1~0_42))) (= v_~a$w_buff1_used~0_100 (ite .cse0 v_~a$w_buff1_used~0_101 (ite (or .cse1 .cse10 .cse6) v_~a$w_buff1_used~0_101 0))) (= (ite .cse0 v_~a$w_buff0_used~0_112 (ite .cse8 v_~a$w_buff0_used~0_112 (ite .cse9 0 v_~a$w_buff0_used~0_112))) v_~a$w_buff0_used~0_111) (= v_~weak$$choice2~0_34 |v_P1Thread1of1ForFork1_#t~nondet4_1|))))) InVars {~a~0=v_~a~0_76, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_47, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_1|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_60, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_1|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_101} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_59, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a~0=v_~a~0_74, ~a$mem_tmp~0=v_~a$mem_tmp~0_22, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet4, ~a$r_buff1_thd2~0, P1Thread1of1ForFork1_#t~nondet3, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0] [2022-12-13 00:40:26,526 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [356] $Ultimate##0-->L758: Formula: (and (= v_~a$w_buff0_used~0_181 1) (= v_~a$w_buff0_used~0_182 v_~a$w_buff1_used~0_157) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_11| |v_P0Thread1of1ForFork0_~arg#1.offset_11|) (= v_~a$r_buff0_thd1~0_74 1) (= v_~x~0_8 1) (= v_~a$r_buff0_thd1~0_75 v_~a$r_buff1_thd1~0_55) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~a$r_buff0_thd2~0_91 v_~a$r_buff1_thd2~0_96) (= v_~a$w_buff0~0_100 1) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= (ite (not (and (not (= (mod v_~a$w_buff0_used~0_181 256) 0)) (not (= (mod v_~a$w_buff1_used~0_157 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= |v_P0Thread1of1ForFork0_~arg#1.base_11| |v_P0Thread1of1ForFork0_#in~arg#1.base_11|) (= v_~a$w_buff0~0_101 v_~a$w_buff1~0_78) (= v_~a$r_buff0_thd0~0_39 v_~a$r_buff1_thd0~0_37)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_11|, ~a$w_buff0~0=v_~a$w_buff0~0_101, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_91, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_182, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_11|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_75, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_39} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_11|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_55, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_96, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_91, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_11|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_181, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_11|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_74, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_39, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_11|, ~a$w_buff1~0=v_~a$w_buff1~0_78, ~a$w_buff0~0=v_~a$w_buff0~0_100, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_37, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_157, ~x~0=v_~x~0_8, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd2~0, P0Thread1of1ForFork0_~arg#1.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.offset, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ~x~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] and [304] L784-->L787: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-13 00:40:26,920 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [432] L784-->L803: Formula: (let ((.cse4 (= (mod v_~a$r_buff0_thd2~0_217 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_434 256) 0))) (let ((.cse7 (and .cse4 .cse3))) (let ((.cse1 (or .cse4 .cse7)) (.cse2 (not .cse4)) (.cse6 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_432 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_74 256) 0)))) (and (= (ite .cse0 1 (ite .cse1 1 (ite .cse2 0 1))) v_~a$w_buff0_used~0_432) (= v_~weak$$choice2~0_74 |v_P1Thread1of1ForFork1_#t~nondet4_66|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_70| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_70|) (= v_~a$r_buff0_thd1~0_229 v_~a$r_buff1_thd1~0_152) (= v_~z~0_42 v_~__unbuffered_p1_EAX~0_92) (= (ite .cse3 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_70|) (= v_~a$w_buff0~0_278 v_~a$w_buff1~0_222) (= (ite .cse0 v_~a$r_buff0_thd2~0_217 (ite (or .cse4 .cse5 (and .cse4 .cse6)) v_~a$r_buff0_thd2~0_217 (ite (and .cse2 (not .cse5)) 0 v_~a$r_buff0_thd2~0_217))) v_~a$r_buff0_thd2~0_216) (= v_~a$r_buff0_thd0~0_157 v_~a$r_buff1_thd0~0_164) (= v_~weak$$choice0~0_49 |v_P1Thread1of1ForFork1_#t~nondet3_66|) (= v_~a$w_buff0~0_276 1) (= (ite .cse0 v_~a$w_buff0_used~0_434 (ite (or .cse4 .cse7 .cse5) v_~a$w_buff0_used~0_434 0)) v_~a$w_buff1_used~0_372) (= v_~__unbuffered_p1_EBX~0_122 (ite .cse1 v_~a~0_304 (ite .cse2 1 v_~a$w_buff0~0_278))) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_70| 0)) (= v_~a$flush_delayed~0_79 0) (= |v_P0Thread1of1ForFork0_~arg#1.base_68| |v_P0Thread1of1ForFork0_#in~arg#1.base_68|) (= (ite .cse0 v_~a$r_buff0_thd2~0_217 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd2~0_216 256) 0))) (or (and .cse4 .cse8) (and .cse8 .cse6) .cse5)) v_~a$r_buff0_thd2~0_217 0)) v_~a$r_buff1_thd2~0_230) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_68| |v_P0Thread1of1ForFork0_~arg#1.offset_68|) (= v_~x~0_55 1) (= v_~a~0_304 v_~a$mem_tmp~0_66) (= v_~a~0_303 (ite .cse0 v_~a$mem_tmp~0_66 v_~__unbuffered_p1_EBX~0_122)) (= v_~a$r_buff0_thd1~0_228 1))))) InVars {~a~0=v_~a~0_304, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_68|, ~a$w_buff0~0=v_~a$w_buff0~0_278, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_66|, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_66|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_217, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_434, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_68|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_229, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_157, ~z~0=v_~z~0_42} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_230, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_216, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_68|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_157, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_68|, ~a~0=v_~a~0_303, ~a$mem_tmp~0=v_~a$mem_tmp~0_66, ~a$w_buff1~0=v_~a$w_buff1~0_222, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_92, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_70|, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_70|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_122, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_68|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_152, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_68|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_432, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_228, ~weak$$choice0~0=v_~weak$$choice0~0_49, ~a$flush_delayed~0=v_~a$flush_delayed~0_79, ~a$w_buff0~0=v_~a$w_buff0~0_276, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_164, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, ~z~0=v_~z~0_42, ~weak$$choice2~0=v_~weak$$choice2~0_74, ~x~0=v_~x~0_55} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~a$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~nondet4, ~a$r_buff1_thd2~0, P1Thread1of1ForFork1_#t~nondet3, ~a$r_buff0_thd2~0, P0Thread1of1ForFork0_~arg#1.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.offset, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, ~a$flush_delayed~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x~0] and [295] L758-->L761: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_2) InVars {~x~0=v_~x~0_2} OutVars{~x~0=v_~x~0_2, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-13 00:40:27,191 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [434] $Ultimate##0-->L787: Formula: (and (= v_~a$w_buff0_used~0_442 1) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_74| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_74|) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_72| |v_P0Thread1of1ForFork0_~arg#1.offset_72|) (= v_~a$r_buff0_thd1~0_237 v_~a$r_buff1_thd1~0_156) (= v_~z~0_44 v_~__unbuffered_p1_EAX~0_94) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_74| 0)) (= (ite (not (and (not (= (mod v_~a$w_buff1_used~0_378 256) 0)) (not (= (mod v_~a$w_buff0_used~0_442 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_74|) (= v_~a$w_buff0~0_286 1) (= v_~a$r_buff0_thd0~0_161 v_~a$r_buff1_thd0~0_168) (= v_~a$w_buff0_used~0_443 v_~a$w_buff1_used~0_378) (= v_~a$r_buff0_thd1~0_236 1) (= v_~a$w_buff0~0_287 v_~a$w_buff1~0_228) (= |v_P0Thread1of1ForFork0_~arg#1.base_72| |v_P0Thread1of1ForFork0_#in~arg#1.base_72|) (= v_~x~0_59 1) (= v_~a$r_buff0_thd2~0_222 v_~a$r_buff1_thd2~0_236)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_72|, ~a$w_buff0~0=v_~a$w_buff0~0_287, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_222, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_443, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_72|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_237, ~z~0=v_~z~0_44, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_161} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_72|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_156, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_236, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_222, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_72|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_442, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_72|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_236, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_161, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_72|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_94, ~a$w_buff1~0=v_~a$w_buff1~0_228, ~a$w_buff0~0=v_~a$w_buff0~0_286, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_74|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_168, ~z~0=v_~z~0_44, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_378, ~x~0=v_~x~0_59, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_74|} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd2~0, P0Thread1of1ForFork0_~arg#1.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EAX~0, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ~x~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] and [295] L758-->L761: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_2) InVars {~x~0=v_~x~0_2} OutVars{~x~0=v_~x~0_2, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-13 00:40:27,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [437] $Ultimate##0-->L761: Formula: (and (= v_~a$w_buff0~0_298 1) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_78| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_78|) (= v_~a$w_buff0~0_299 v_~a$w_buff1~0_236) (= v_~a$r_buff0_thd1~0_245 v_~a$r_buff1_thd1~0_160) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_76| |v_P0Thread1of1ForFork0_~arg#1.offset_76|) (= v_~a$w_buff0_used~0_455 v_~a$w_buff1_used~0_386) (= v_~a$r_buff0_thd0~0_165 v_~a$r_buff1_thd0~0_172) (= v_~x~0_63 1) (= v_~z~0_50 v_~__unbuffered_p1_EAX~0_100) (= v_~a$r_buff0_thd1~0_244 1) (= (ite (not (and (not (= (mod v_~a$w_buff1_used~0_386 256) 0)) (not (= (mod v_~a$w_buff0_used~0_454 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_78|) (= |v_P0Thread1of1ForFork0_~arg#1.base_76| |v_P0Thread1of1ForFork0_#in~arg#1.base_76|) (= v_~a$w_buff0_used~0_454 1) (= v_~a$r_buff0_thd2~0_232 v_~a$r_buff1_thd2~0_244) (= v_~x~0_63 v_~__unbuffered_p0_EAX~0_95) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_78| 0))) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_76|, ~a$w_buff0~0=v_~a$w_buff0~0_299, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_232, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_76|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_245, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_165, ~z~0=v_~z~0_50} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_76|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_160, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_244, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_232, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_76|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_454, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_76|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_244, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_165, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_76|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_95, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_100, ~a$w_buff1~0=v_~a$w_buff1~0_236, ~a$w_buff0~0=v_~a$w_buff0~0_298, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_78|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_172, ~z~0=v_~z~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_386, ~x~0=v_~x~0_63, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_78|} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd2~0, P0Thread1of1ForFork0_~arg#1.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ~x~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] and [305] L787-->L803: Formula: (let ((.cse3 (= 0 (mod v_~a$r_buff1_thd2~0_60 256))) (.cse5 (= (mod v_~a$r_buff0_thd2~0_60 256) 0))) (let ((.cse7 (not .cse5)) (.cse11 (= (mod v_~a$w_buff0_used~0_112 256) 0)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_101 256) 0) .cse5)) (.cse6 (and .cse5 .cse3))) (let ((.cse4 (= (mod v_~a$w_buff1_used~0_100 256) 0)) (.cse1 (= (mod v_~a$w_buff0_used~0_111 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse8 (or .cse11 .cse10 .cse6)) (.cse9 (and (not .cse11) .cse7))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= (ite .cse0 v_~a$r_buff1_thd2~0_60 (ite (let ((.cse2 (= (mod v_~a$r_buff0_thd2~0_59 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse2 .cse4))) v_~a$r_buff1_thd2~0_60 0)) v_~a$r_buff1_thd2~0_59) (= v_~a$r_buff0_thd2~0_59 (ite .cse0 v_~a$r_buff0_thd2~0_60 (ite (or .cse1 (and .cse5 .cse4) .cse6) v_~a$r_buff0_thd2~0_60 (ite (and (not .cse1) .cse7) 0 v_~a$r_buff0_thd2~0_60)))) (= v_~a~0_76 v_~a$mem_tmp~0_22) (= |v_P1Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a~0_74 (ite .cse0 v_~a$mem_tmp~0_22 v_~__unbuffered_p1_EBX~0_12)) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= v_~__unbuffered_p1_EBX~0_12 (ite .cse8 v_~a~0_76 (ite .cse9 v_~a$w_buff0~0_47 v_~a$w_buff1~0_42))) (= v_~a$w_buff1_used~0_100 (ite .cse0 v_~a$w_buff1_used~0_101 (ite (or .cse1 .cse10 .cse6) v_~a$w_buff1_used~0_101 0))) (= (ite .cse0 v_~a$w_buff0_used~0_112 (ite .cse8 v_~a$w_buff0_used~0_112 (ite .cse9 0 v_~a$w_buff0_used~0_112))) v_~a$w_buff0_used~0_111) (= v_~weak$$choice2~0_34 |v_P1Thread1of1ForFork1_#t~nondet4_1|))))) InVars {~a~0=v_~a~0_76, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_47, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_1|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_60, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_1|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_101} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_59, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a~0=v_~a~0_74, ~a$mem_tmp~0=v_~a$mem_tmp~0_22, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet4, ~a$r_buff1_thd2~0, P1Thread1of1ForFork1_#t~nondet3, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0] [2022-12-13 00:40:27,633 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 00:40:27,634 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2099 [2022-12-13 00:40:27,634 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 146 flow [2022-12-13 00:40:27,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:27,635 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:27,635 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:27,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:40:27,635 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:40:27,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:27,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1862541930, now seen corresponding path program 1 times [2022-12-13 00:40:27,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:27,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492261432] [2022-12-13 00:40:27,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:27,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:27,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:27,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492261432] [2022-12-13 00:40:27,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492261432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:27,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:27,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:40:27,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932233628] [2022-12-13 00:40:27,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:27,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:40:27,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:27,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:40:27,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:40:27,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-13 00:40:27,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 146 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-13 00:40:27,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:27,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-13 00:40:27,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:27,940 INFO L130 PetriNetUnfolder]: 43/124 cut-off events. [2022-12-13 00:40:27,940 INFO L131 PetriNetUnfolder]: For 151/155 co-relation queries the response was YES. [2022-12-13 00:40:27,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 124 events. 43/124 cut-off events. For 151/155 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 477 event pairs, 5 based on Foata normal form. 13/114 useless extension candidates. Maximal degree in co-relation 400. Up to 55 conditions per place. [2022-12-13 00:40:27,941 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 18 selfloop transitions, 3 changer transitions 18/44 dead transitions. [2022-12-13 00:40:27,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 296 flow [2022-12-13 00:40:27,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:40:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:40:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-12-13 00:40:27,943 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2022-12-13 00:40:27,943 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 146 flow. Second operand 6 states and 50 transitions. [2022-12-13 00:40:27,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 296 flow [2022-12-13 00:40:27,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 268 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-13 00:40:27,945 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 115 flow [2022-12-13 00:40:27,945 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2022-12-13 00:40:27,946 INFO L295 CegarLoopForPetriNet]: 61 programPoint places, -23 predicate places. [2022-12-13 00:40:27,946 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:27,946 INFO L89 Accepts]: Start accepts. Operand has 38 places, 24 transitions, 115 flow [2022-12-13 00:40:27,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:27,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:27,947 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 24 transitions, 115 flow [2022-12-13 00:40:27,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 24 transitions, 115 flow [2022-12-13 00:40:27,955 INFO L130 PetriNetUnfolder]: 9/50 cut-off events. [2022-12-13 00:40:27,955 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-13 00:40:27,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 50 events. 9/50 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 154 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 123. Up to 28 conditions per place. [2022-12-13 00:40:27,955 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 24 transitions, 115 flow [2022-12-13 00:40:27,956 INFO L226 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-13 00:40:28,545 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [441] $Ultimate##0-->L764: Formula: (and (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_88| 0)) (= v_~x~0_73 1) (= |v_P0Thread1of1ForFork0_~arg#1.base_86| |v_P0Thread1of1ForFork0_#in~arg#1.base_86|) (= v_~a$r_buff0_thd2~0_252 v_~a$r_buff1_thd2~0_266) (= v_~a$w_buff0~0_324 1) (= v_~x~0_73 v_~__unbuffered_p0_EAX~0_105) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_88| (ite (not (and (not (= (mod v_~a$w_buff1_used~0_408 256) 0)) (not (= (mod v_~a$w_buff0_used~0_484 256) 0)))) 1 0)) (= v_~a$w_buff0_used~0_485 v_~a$w_buff1_used~0_408) (= v_~a$r_buff0_thd0~0_175 v_~a$r_buff1_thd0~0_182) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_86| |v_P0Thread1of1ForFork0_~arg#1.offset_86|) (= v_~a$r_buff0_thd1~0_265 v_~a$r_buff1_thd1~0_170) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_88| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_88|) (= v_~a$r_buff0_thd1~0_264 1) (= v_~a$w_buff0~0_325 v_~a$w_buff1~0_254) (= v_~__unbuffered_p0_EBX~0_100 v_~y~0_45) (= v_~a$w_buff0_used~0_484 1)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_86|, ~a$w_buff0~0=v_~a$w_buff0~0_325, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_252, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_485, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_86|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_265, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_175, ~y~0=v_~y~0_45} OutVars{~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_100, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_86|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_170, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_266, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_252, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_86|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_484, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_86|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_264, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_175, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_86|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~a$w_buff1~0=v_~a$w_buff1~0_254, ~a$w_buff0~0=v_~a$w_buff0~0_324, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_88|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_182, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_408, ~y~0=v_~y~0_45, ~x~0=v_~x~0_73, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_88|} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd2~0, P0Thread1of1ForFork0_~arg#1.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ~x~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] and [440] $Ultimate##0-->L803: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd2~0_263 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd2~0_249 256) 0))) (let ((.cse7 (not .cse5)) (.cse8 (and .cse5 (= (mod v_~a$w_buff1_used~0_405 256) 0))) (.cse6 (and .cse10 .cse5)) (.cse11 (= (mod v_~a$w_buff0_used~0_481 256) 0))) (let ((.cse3 (= (mod v_~a$w_buff0_used~0_480 256) 0)) (.cse4 (= 0 (mod v_~a$w_buff1_used~0_404 256))) (.cse1 (or .cse8 .cse6 .cse11)) (.cse2 (and .cse7 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_82 256) 0)))) (and (= v_~a~0_328 v_~a$mem_tmp~0_74) (= v_P1Thread1of1ForFork1_~arg.base_23 |v_P1Thread1of1ForFork1_#in~arg.base_23|) (= v_~z~0_54 v_~__unbuffered_p1_EAX~0_104) (= v_~a$w_buff0_used~0_480 (ite .cse0 v_~a$w_buff0_used~0_481 (ite .cse1 v_~a$w_buff0_used~0_481 (ite .cse2 0 v_~a$w_buff0_used~0_481)))) (= v_~z~0_54 1) (= v_~a$w_buff1~0_251 v_~a$w_buff1~0_250) (= (ite .cse0 v_~a$r_buff0_thd2~0_249 (ite (or .cse3 (and .cse4 .cse5) .cse6) v_~a$r_buff0_thd2~0_249 (ite (and (not .cse3) .cse7) 0 v_~a$r_buff0_thd2~0_249))) v_~a$r_buff0_thd2~0_248) (= (ite .cse0 v_~a$w_buff1_used~0_405 (ite (or .cse3 .cse8 .cse6) v_~a$w_buff1_used~0_405 0)) v_~a$w_buff1_used~0_404) (= (ite .cse0 v_~a$r_buff1_thd2~0_263 (ite (let ((.cse9 (= 0 (mod v_~a$r_buff0_thd2~0_248 256)))) (or .cse3 (and .cse9 .cse4) (and .cse10 .cse9))) v_~a$r_buff1_thd2~0_263 0)) v_~a$r_buff1_thd2~0_262) (= v_~a$flush_delayed~0_87 0) (= v_~weak$$choice2~0_82 |v_P1Thread1of1ForFork1_#t~nondet4_82|) (= (ite .cse1 v_~a~0_328 (ite .cse2 v_~a$w_buff0~0_321 v_~a$w_buff1~0_251)) v_~__unbuffered_p1_EBX~0_130) (= |v_P1Thread1of1ForFork1_#in~arg.offset_23| v_P1Thread1of1ForFork1_~arg.offset_23) (= v_~a~0_327 (ite .cse0 v_~a$mem_tmp~0_74 v_~__unbuffered_p1_EBX~0_130)) (= v_~weak$$choice0~0_57 |v_P1Thread1of1ForFork1_#t~nondet3_82|) (= v_~a$w_buff0~0_321 v_~a$w_buff0~0_320) (= v_~y~0_43 1))))) InVars {~a~0=v_~a~0_328, ~a$w_buff1~0=v_~a$w_buff1~0_251, ~a$w_buff0~0=v_~a$w_buff0~0_321, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_82|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_263, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_82|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_23|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_249, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_481, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_23|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_405} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_130, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_23, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_262, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_248, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_480, ~a~0=v_~a~0_327, ~a$mem_tmp~0=v_~a$mem_tmp~0_74, ~weak$$choice0~0=v_~weak$$choice0~0_57, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_23, ~a$w_buff1~0=v_~a$w_buff1~0_250, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, ~a$flush_delayed~0=v_~a$flush_delayed~0_87, ~a$w_buff0~0=v_~a$w_buff0~0_320, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_23|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_23|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_404, ~z~0=v_~z~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_82, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~nondet4, ~a$r_buff1_thd2~0, P1Thread1of1ForFork1_#t~nondet3, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~z~0, ~weak$$choice2~0, ~y~0] [2022-12-13 00:40:28,927 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:40:28,927 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 981 [2022-12-13 00:40:28,928 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 105 flow [2022-12-13 00:40:28,928 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-13 00:40:28,928 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:28,928 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:28,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:40:28,928 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:40:28,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:28,929 INFO L85 PathProgramCache]: Analyzing trace with hash 70230238, now seen corresponding path program 1 times [2022-12-13 00:40:28,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:28,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545857823] [2022-12-13 00:40:28,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:28,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:40:28,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:40:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:40:29,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:40:29,018 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:40:29,019 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 00:40:29,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 00:40:29,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 00:40:29,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 00:40:29,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 00:40:29,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:40:29,021 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:29,027 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:40:29,027 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:40:29,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:40:29 BasicIcfg [2022-12-13 00:40:29,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:40:29,094 INFO L158 Benchmark]: Toolchain (without parser) took 13341.62ms. Allocated memory was 201.3MB in the beginning and 306.2MB in the end (delta: 104.9MB). Free memory was 159.3MB in the beginning and 167.1MB in the end (delta: -7.9MB). Peak memory consumption was 98.0MB. Max. memory is 8.0GB. [2022-12-13 00:40:29,096 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 178.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:40:29,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.59ms. Allocated memory is still 201.3MB. Free memory was 159.3MB in the beginning and 133.1MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 00:40:29,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.12ms. Allocated memory is still 201.3MB. Free memory was 133.1MB in the beginning and 131.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:40:29,097 INFO L158 Benchmark]: Boogie Preprocessor took 55.23ms. Allocated memory is still 201.3MB. Free memory was 131.0MB in the beginning and 128.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:40:29,097 INFO L158 Benchmark]: RCFGBuilder took 657.96ms. Allocated memory is still 201.3MB. Free memory was 128.9MB in the beginning and 97.9MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-13 00:40:29,097 INFO L158 Benchmark]: TraceAbstraction took 12037.96ms. Allocated memory was 201.3MB in the beginning and 306.2MB in the end (delta: 104.9MB). Free memory was 96.9MB in the beginning and 167.1MB in the end (delta: -70.2MB). Peak memory consumption was 36.2MB. Max. memory is 8.0GB. [2022-12-13 00:40:29,099 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.13ms. Allocated memory is still 201.3MB. Free memory is still 178.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 510.59ms. Allocated memory is still 201.3MB. Free memory was 159.3MB in the beginning and 133.1MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 74.12ms. Allocated memory is still 201.3MB. Free memory was 133.1MB in the beginning and 131.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.23ms. Allocated memory is still 201.3MB. Free memory was 131.0MB in the beginning and 128.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 657.96ms. Allocated memory is still 201.3MB. Free memory was 128.9MB in the beginning and 97.9MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 12037.96ms. Allocated memory was 201.3MB in the beginning and 306.2MB in the end (delta: 104.9MB). Free memory was 96.9MB in the beginning and 167.1MB in the end (delta: -70.2MB). Peak memory consumption was 36.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 99 PlacesBefore, 61 PlacesAfterwards, 94 TransitionsBefore, 55 TransitionsAfterwards, 1346 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 34 ConcurrentYvCompositions, 2 ChoiceCompositions, 76 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2309, independent: 2205, independent conditional: 2205, independent unconditional: 0, dependent: 104, dependent conditional: 104, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2309, independent: 2205, independent conditional: 0, independent unconditional: 2205, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2309, independent: 2205, independent conditional: 0, independent unconditional: 2205, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2309, independent: 2205, independent conditional: 0, independent unconditional: 2205, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1318, independent: 1279, independent conditional: 0, independent unconditional: 1279, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1318, independent: 1267, independent conditional: 0, independent unconditional: 1267, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 173, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2309, independent: 926, independent conditional: 0, independent unconditional: 926, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 1318, unknown conditional: 0, unknown unconditional: 1318] , Statistics on independence cache: Total cache size (in pairs): 2443, Positive cache size: 2404, Positive conditional cache size: 0, Positive unconditional cache size: 2404, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, 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, 34 PlacesBefore, 34 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 167, independent: 137, independent conditional: 137, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 167, independent: 137, independent conditional: 25, independent unconditional: 112, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 167, independent: 137, independent conditional: 25, independent unconditional: 112, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 167, independent: 137, independent conditional: 25, independent unconditional: 112, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 113, independent conditional: 25, independent unconditional: 88, dependent: 23, dependent conditional: 7, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 7, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 81, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 81, dependent conditional: 41, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 167, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 7, dependent conditional: 3, dependent unconditional: 4, unknown: 136, unknown conditional: 32, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 113, Positive conditional cache size: 25, Positive unconditional cache size: 88, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 131, independent: 106, independent conditional: 106, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 131, independent: 106, independent conditional: 4, independent unconditional: 102, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 131, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 131, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 131, independent: 89, independent conditional: 0, independent unconditional: 89, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 130, Positive conditional cache size: 25, Positive unconditional cache size: 105, Negative cache size: 29, Negative conditional cache size: 7, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 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: 134, independent: 108, independent conditional: 108, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 134, independent: 108, independent conditional: 4, independent unconditional: 104, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 134, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 134, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 134, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 133, Positive conditional cache size: 25, Positive unconditional cache size: 108, Negative cache size: 31, Negative conditional cache size: 7, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 158, independent: 132, independent conditional: 132, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 158, independent: 132, independent conditional: 7, independent unconditional: 125, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 158, independent: 132, independent conditional: 0, independent unconditional: 132, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 158, independent: 132, independent conditional: 0, independent unconditional: 132, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ total: 36, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 158, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 154, Positive conditional cache size: 25, Positive unconditional cache size: 129, Negative cache size: 36, Negative conditional cache size: 7, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 118, independent: 94, independent conditional: 26, independent unconditional: 68, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 118, independent: 94, independent conditional: 22, independent unconditional: 72, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 118, independent: 94, independent conditional: 22, independent unconditional: 72, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 118, independent: 93, independent conditional: 22, independent unconditional: 71, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 193, Positive cache size: 155, Positive conditional cache size: 25, Positive unconditional cache size: 130, Negative cache size: 38, Negative conditional cache size: 7, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 36 PlacesBefore, 34 PlacesAfterwards, 31 TransitionsBefore, 29 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 118, independent conditional: 118, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 164, independent: 118, independent conditional: 44, independent unconditional: 74, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 118, independent conditional: 40, independent unconditional: 78, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 118, independent conditional: 40, independent unconditional: 78, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 164, independent: 106, independent conditional: 34, independent unconditional: 72, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 14, unknown conditional: 6, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 172, Positive conditional cache size: 31, Positive unconditional cache size: 141, Negative cache size: 40, Negative conditional cache size: 7, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 39 PlacesBefore, 35 PlacesAfterwards, 32 TransitionsBefore, 28 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 341, independent: 272, independent conditional: 272, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 341, independent: 272, independent conditional: 173, independent unconditional: 99, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 341, independent: 272, independent conditional: 147, independent unconditional: 125, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 341, independent: 272, independent conditional: 147, independent unconditional: 125, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 13, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 341, independent: 257, independent conditional: 134, independent unconditional: 123, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 17, unknown conditional: 13, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 277, Positive cache size: 235, Positive conditional cache size: 44, Positive unconditional cache size: 191, Negative cache size: 42, Negative conditional cache size: 7, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 36 PlacesBefore, 33 PlacesAfterwards, 24 TransitionsBefore, 21 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 110, independent: 69, independent conditional: 27, independent unconditional: 42, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 110, independent: 69, independent conditional: 21, independent unconditional: 48, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 110, independent: 69, independent conditional: 21, independent unconditional: 48, dependent: 41, dependent conditional: 0, dependent unconditional: 41, 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: 110, independent: 69, independent conditional: 21, independent unconditional: 48, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 247, Positive conditional cache size: 44, Positive unconditional cache size: 203, Negative cache size: 42, Negative conditional cache size: 7, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L827] 0 pthread_t t833; [L828] FCALL, FORK 0 pthread_create(&t833, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t833, ((void *)0), P0, ((void *)0))=-2, t833={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L829] 0 pthread_t t834; [L830] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t834, ((void *)0), P1, ((void *)0))=-1, t833={5:0}, t834={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff0_thd1 = (_Bool)1 [L757] 1 x = 1 [L760] 1 __unbuffered_p0_EAX = x [L763] 1 __unbuffered_p0_EBX = y [L780] 1 y = 1 [L783] 1 z = 1 [L786] 1 __unbuffered_p1_EAX = z [L789] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 1 a$flush_delayed = weak$$choice2 [L792] 1 a$mem_tmp = a [L793] 1 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L794] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L795] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L796] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L797] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L798] 1 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L799] 1 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] 1 __unbuffered_p1_EBX = a [L801] 1 a = a$flush_delayed ? a$mem_tmp : a [L802] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L805] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L806] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L807] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L808] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L809] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L837] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L838] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L839] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L840] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 828]: 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: 830]: 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 5 procedures, 118 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: 11.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 437 IncrementalHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 13 mSDtfsCounter, 437 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=7, InterpolantAutomatonStates: 34, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 533 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-13 00:40:29,127 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...