/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:23:58,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:23:58,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:23:58,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:23:58,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:23:58,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:23:58,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:23:58,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:23:58,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:23:58,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:23:58,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:23:58,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:23:58,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:23:58,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:23:58,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:23:58,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:23:58,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:23:58,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:23:58,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:23:58,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:23:58,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:23:58,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:23:58,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:23:58,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:23:58,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:23:58,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:23:58,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:23:58,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:23:58,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:23:58,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:23:58,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:23:58,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:23:58,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:23:58,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:23:58,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:23:58,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:23:58,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:23:58,229 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:23:58,229 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:23:58,230 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:23:58,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:23:58,231 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:23:58,257 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:23:58,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:23:58,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:23:58,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:23:58,259 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:23:58,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:23:58,260 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:23:58,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:23:58,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:23:58,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:23:58,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:23:58,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:23:58,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:23:58,261 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:23:58,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:23:58,261 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:23:58,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:23:58,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:23:58,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:23:58,261 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:23:58,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:23:58,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:23:58,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:23:58,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:23:58,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:23:58,262 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:23:58,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:23:58,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:23:58,262 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:23:58,262 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 09:23:58,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:23:58,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:23:58,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:23:58,523 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:23:58,525 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:23:58,526 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 09:23:59,625 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:23:59,844 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:23:59,844 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2022-12-13 09:23:59,864 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e919eba/6f34cba1e1264e11a9369a992a99b5cb/FLAGa1f3eb257 [2022-12-13 09:23:59,882 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e919eba/6f34cba1e1264e11a9369a992a99b5cb [2022-12-13 09:23:59,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:23:59,884 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:23:59,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:23:59,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:23:59,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:23:59,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:23:59" (1/1) ... [2022-12-13 09:23:59,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a912ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:23:59, skipping insertion in model container [2022-12-13 09:23:59,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:23:59" (1/1) ... [2022-12-13 09:23:59,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:23:59,934 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:24:00,037 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 09:24:00,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:24:00,221 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:24:00,231 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 09:24:00,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:24:00,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:24:00,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:24:00,312 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:24:00,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:00 WrapperNode [2022-12-13 09:24:00,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:24:00,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:24:00,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:24:00,315 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:24:00,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:00" (1/1) ... [2022-12-13 09:24:00,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:00" (1/1) ... [2022-12-13 09:24:00,369 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2022-12-13 09:24:00,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:24:00,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:24:00,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:24:00,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:24:00,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:00" (1/1) ... [2022-12-13 09:24:00,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:00" (1/1) ... [2022-12-13 09:24:00,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:00" (1/1) ... [2022-12-13 09:24:00,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:00" (1/1) ... [2022-12-13 09:24:00,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:00" (1/1) ... [2022-12-13 09:24:00,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:00" (1/1) ... [2022-12-13 09:24:00,397 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:00" (1/1) ... [2022-12-13 09:24:00,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:00" (1/1) ... [2022-12-13 09:24:00,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:24:00,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:24:00,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:24:00,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:24:00,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:00" (1/1) ... [2022-12-13 09:24:00,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:24:00,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:24:00,461 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 09:24:00,484 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 09:24:00,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:24:00,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:24:00,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:24:00,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:24:00,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:24:00,499 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:24:00,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:24:00,499 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:24:00,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:24:00,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:24:00,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:24:00,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:24:00,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:24:00,500 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 09:24:00,650 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:24:00,651 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:24:00,913 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:24:01,004 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:24:01,005 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:24:01,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:24:01 BoogieIcfgContainer [2022-12-13 09:24:01,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:24:01,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:24:01,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:24:01,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:24:01,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:23:59" (1/3) ... [2022-12-13 09:24:01,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d2b5e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:24:01, skipping insertion in model container [2022-12-13 09:24:01,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:24:00" (2/3) ... [2022-12-13 09:24:01,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d2b5e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:24:01, skipping insertion in model container [2022-12-13 09:24:01,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:24:01" (3/3) ... [2022-12-13 09:24:01,014 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2022-12-13 09:24:01,028 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:24:01,028 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:24:01,028 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:24:01,067 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:24:01,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 96 transitions, 202 flow [2022-12-13 09:24:01,178 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2022-12-13 09:24:01,178 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:24:01,182 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 09:24:01,183 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 96 transitions, 202 flow [2022-12-13 09:24:01,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 94 transitions, 194 flow [2022-12-13 09:24:01,188 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:24:01,210 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 94 transitions, 194 flow [2022-12-13 09:24:01,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 94 transitions, 194 flow [2022-12-13 09:24:01,244 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2022-12-13 09:24:01,244 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:24:01,245 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 09:24:01,248 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 94 transitions, 194 flow [2022-12-13 09:24:01,248 INFO L226 LiptonReduction]: Number of co-enabled transitions 1346 [2022-12-13 09:24:05,004 INFO L241 LiptonReduction]: Total number of compositions: 76 [2022-12-13 09:24:05,015 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:24:05,020 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;@54641745, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:24:05,020 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 09:24:05,023 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2022-12-13 09:24:05,023 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:24:05,023 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:24:05,023 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 09:24:05,024 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 09:24:05,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:24:05,029 INFO L85 PathProgramCache]: Analyzing trace with hash 441480, now seen corresponding path program 1 times [2022-12-13 09:24:05,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:24:05,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206329315] [2022-12-13 09:24:05,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:24:05,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:24:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:24:05,290 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 09:24:05,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:24:05,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206329315] [2022-12-13 09:24:05,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206329315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:24:05,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:24:05,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:24:05,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522852802] [2022-12-13 09:24:05,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:24:05,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:24:05,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:24:05,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:24:05,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:24:05,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2022-12-13 09:24:05,312 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 09:24:05,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:24:05,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2022-12-13 09:24:05,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:24:05,639 INFO L130 PetriNetUnfolder]: 1622/3005 cut-off events. [2022-12-13 09:24:05,639 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 09:24:05,646 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 09:24:05,652 INFO L137 encePairwiseOnDemand]: 48/55 looper letters, 26 selfloop transitions, 3 changer transitions 47/85 dead transitions. [2022-12-13 09:24:05,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 85 transitions, 329 flow [2022-12-13 09:24:05,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:24:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:24:05,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-12-13 09:24:05,661 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2022-12-13 09:24:05,662 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 116 flow. Second operand 3 states and 112 transitions. [2022-12-13 09:24:05,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 85 transitions, 329 flow [2022-12-13 09:24:05,664 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 09:24:05,666 INFO L231 Difference]: Finished difference. Result has 58 places, 27 transitions, 64 flow [2022-12-13 09:24:05,667 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 09:24:05,671 INFO L295 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2022-12-13 09:24:05,671 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:24:05,672 INFO L89 Accepts]: Start accepts. Operand has 58 places, 27 transitions, 64 flow [2022-12-13 09:24:05,674 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:24:05,674 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:24:05,674 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 27 transitions, 64 flow [2022-12-13 09:24:05,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 64 flow [2022-12-13 09:24:05,678 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-13 09:24:05,678 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:24:05,679 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 09:24:05,681 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 27 transitions, 64 flow [2022-12-13 09:24:05,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-13 09:24:05,767 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:24:05,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 09:24:05,769 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 64 flow [2022-12-13 09:24:05,769 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 09:24:05,769 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:24:05,769 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:24:05,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:24:05,770 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 09:24:05,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:24:05,770 INFO L85 PathProgramCache]: Analyzing trace with hash -244421573, now seen corresponding path program 1 times [2022-12-13 09:24:05,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:24:05,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398884486] [2022-12-13 09:24:05,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:24:05,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:24:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:24:05,950 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 09:24:05,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:24:05,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398884486] [2022-12-13 09:24:05,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398884486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:24:05,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:24:05,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:24:05,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691312779] [2022-12-13 09:24:05,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:24:05,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:24:05,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:24:05,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:24:05,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:24:05,953 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2022-12-13 09:24:05,953 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 09:24:05,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:24:05,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2022-12-13 09:24:05,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:24:06,063 INFO L130 PetriNetUnfolder]: 493/874 cut-off events. [2022-12-13 09:24:06,064 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-13 09:24:06,065 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 09:24:06,067 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 28 selfloop transitions, 3 changer transitions 2/38 dead transitions. [2022-12-13 09:24:06,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 158 flow [2022-12-13 09:24:06,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:24:06,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:24:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-13 09:24:06,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2022-12-13 09:24:06,069 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 64 flow. Second operand 3 states and 49 transitions. [2022-12-13 09:24:06,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 158 flow [2022-12-13 09:24:06,070 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 09:24:06,071 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 75 flow [2022-12-13 09:24:06,071 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 09:24:06,072 INFO L295 CegarLoopForPetriNet]: 61 programPoint places, -26 predicate places. [2022-12-13 09:24:06,072 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:24:06,072 INFO L89 Accepts]: Start accepts. Operand has 35 places, 28 transitions, 75 flow [2022-12-13 09:24:06,073 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:24:06,073 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:24:06,073 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 28 transitions, 75 flow [2022-12-13 09:24:06,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 28 transitions, 75 flow [2022-12-13 09:24:06,079 INFO L130 PetriNetUnfolder]: 3/42 cut-off events. [2022-12-13 09:24:06,079 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:24:06,080 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 09:24:06,080 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 28 transitions, 75 flow [2022-12-13 09:24:06,080 INFO L226 LiptonReduction]: Number of co-enabled transitions 348 [2022-12-13 09:24:06,112 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:24:06,113 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 09:24:06,113 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 75 flow [2022-12-13 09:24:06,114 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 09:24:06,114 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:24:06,114 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:24:06,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:24:06,115 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 09:24:06,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:24:06,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1792983848, now seen corresponding path program 1 times [2022-12-13 09:24:06,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:24:06,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268032527] [2022-12-13 09:24:06,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:24:06,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:24:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:24:06,280 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 09:24:06,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:24:06,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268032527] [2022-12-13 09:24:06,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268032527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:24:06,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:24:06,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:24:06,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712104169] [2022-12-13 09:24:06,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:24:06,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:24:06,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:24:06,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:24:06,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:24:06,283 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2022-12-13 09:24:06,284 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 09:24:06,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:24:06,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2022-12-13 09:24:06,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:24:06,376 INFO L130 PetriNetUnfolder]: 354/645 cut-off events. [2022-12-13 09:24:06,376 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2022-12-13 09:24:06,377 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 09:24:06,379 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 27 selfloop transitions, 3 changer transitions 1/36 dead transitions. [2022-12-13 09:24:06,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 153 flow [2022-12-13 09:24:06,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:24:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:24:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-13 09:24:06,381 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-13 09:24:06,381 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 75 flow. Second operand 3 states and 46 transitions. [2022-12-13 09:24:06,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 153 flow [2022-12-13 09:24:06,382 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 09:24:06,382 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 81 flow [2022-12-13 09:24:06,383 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 09:24:06,384 INFO L295 CegarLoopForPetriNet]: 61 programPoint places, -25 predicate places. [2022-12-13 09:24:06,384 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:24:06,384 INFO L89 Accepts]: Start accepts. Operand has 36 places, 27 transitions, 81 flow [2022-12-13 09:24:06,384 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:24:06,384 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:24:06,384 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 27 transitions, 81 flow [2022-12-13 09:24:06,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 81 flow [2022-12-13 09:24:06,388 INFO L130 PetriNetUnfolder]: 2/34 cut-off events. [2022-12-13 09:24:06,389 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 09:24:06,389 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 09:24:06,389 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 81 flow [2022-12-13 09:24:06,389 INFO L226 LiptonReduction]: Number of co-enabled transitions 318 [2022-12-13 09:24:06,398 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:24:06,401 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 09:24:06,402 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 81 flow [2022-12-13 09:24:06,402 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 09:24:06,402 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:24:06,402 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:24:06,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:24:06,402 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 09:24:06,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:24:06,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1337334373, now seen corresponding path program 1 times [2022-12-13 09:24:06,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:24:06,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162006060] [2022-12-13 09:24:06,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:24:06,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:24:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:24:06,510 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 09:24:06,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:24:06,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162006060] [2022-12-13 09:24:06,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162006060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:24:06,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:24:06,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:24:06,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827876856] [2022-12-13 09:24:06,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:24:06,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:24:06,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:24:06,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:24:06,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:24:06,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2022-12-13 09:24:06,512 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 09:24:06,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:24:06,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2022-12-13 09:24:06,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:24:06,567 INFO L130 PetriNetUnfolder]: 218/432 cut-off events. [2022-12-13 09:24:06,567 INFO L131 PetriNetUnfolder]: For 124/130 co-relation queries the response was YES. [2022-12-13 09:24:06,567 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 1874 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 09:24:06,569 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 24 selfloop transitions, 3 changer transitions 1/36 dead transitions. [2022-12-13 09:24:06,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 36 transitions, 157 flow [2022-12-13 09:24:06,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:24:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:24:06,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-13 09:24:06,570 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2022-12-13 09:24:06,570 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 81 flow. Second operand 3 states and 49 transitions. [2022-12-13 09:24:06,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 36 transitions, 157 flow [2022-12-13 09:24:06,570 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 09:24:06,571 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 84 flow [2022-12-13 09:24:06,571 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 09:24:06,571 INFO L295 CegarLoopForPetriNet]: 61 programPoint places, -25 predicate places. [2022-12-13 09:24:06,572 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:24:06,572 INFO L89 Accepts]: Start accepts. Operand has 36 places, 26 transitions, 84 flow [2022-12-13 09:24:06,572 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:24:06,572 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:24:06,572 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 84 flow [2022-12-13 09:24:06,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 84 flow [2022-12-13 09:24:06,575 INFO L130 PetriNetUnfolder]: 1/31 cut-off events. [2022-12-13 09:24:06,575 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 09:24:06,575 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 09:24:06,576 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 84 flow [2022-12-13 09:24:06,576 INFO L226 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-13 09:24:06,604 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:24:06,605 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 09:24:06,605 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 84 flow [2022-12-13 09:24:06,605 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 09:24:06,605 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:24:06,605 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:24:06,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:24:06,606 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 09:24:06,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:24:06,606 INFO L85 PathProgramCache]: Analyzing trace with hash -671220676, now seen corresponding path program 1 times [2022-12-13 09:24:06,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:24:06,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025495345] [2022-12-13 09:24:06,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:24:06,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:24:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:24:06,707 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 09:24:06,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:24:06,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025495345] [2022-12-13 09:24:06,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025495345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:24:06,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:24:06,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:24:06,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975057992] [2022-12-13 09:24:06,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:24:06,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:24:06,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:24:06,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:24:06,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:24:06,710 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2022-12-13 09:24:06,710 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 09:24:06,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:24:06,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2022-12-13 09:24:06,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:24:06,760 INFO L130 PetriNetUnfolder]: 134/299 cut-off events. [2022-12-13 09:24:06,760 INFO L131 PetriNetUnfolder]: For 105/108 co-relation queries the response was YES. [2022-12-13 09:24:06,760 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 1324 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 09:24:06,761 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 24 selfloop transitions, 7 changer transitions 1/39 dead transitions. [2022-12-13 09:24:06,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 174 flow [2022-12-13 09:24:06,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:24:06,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:24:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-13 09:24:06,763 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2022-12-13 09:24:06,763 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 84 flow. Second operand 3 states and 50 transitions. [2022-12-13 09:24:06,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 174 flow [2022-12-13 09:24:06,768 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 09:24:06,769 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 123 flow [2022-12-13 09:24:06,769 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 09:24:06,771 INFO L295 CegarLoopForPetriNet]: 61 programPoint places, -25 predicate places. [2022-12-13 09:24:06,771 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:24:06,771 INFO L89 Accepts]: Start accepts. Operand has 36 places, 31 transitions, 123 flow [2022-12-13 09:24:06,772 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:24:06,772 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:24:06,772 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 123 flow [2022-12-13 09:24:06,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 123 flow [2022-12-13 09:24:06,780 INFO L130 PetriNetUnfolder]: 28/114 cut-off events. [2022-12-13 09:24:06,781 INFO L131 PetriNetUnfolder]: For 48/51 co-relation queries the response was YES. [2022-12-13 09:24:06,781 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 530 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 09:24:06,782 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 31 transitions, 123 flow [2022-12-13 09:24:06,782 INFO L226 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-13 09:24:06,804 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:24:06,806 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 09:24:06,806 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 123 flow [2022-12-13 09:24:06,806 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 09:24:06,806 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:24:06,806 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:24:06,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:24:06,807 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 09:24:06,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:24:06,807 INFO L85 PathProgramCache]: Analyzing trace with hash -409863919, now seen corresponding path program 1 times [2022-12-13 09:24:06,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:24:06,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960443778] [2022-12-13 09:24:06,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:24:06,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:24:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:24:06,912 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 09:24:06,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:24:06,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960443778] [2022-12-13 09:24:06,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960443778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:24:06,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:24:06,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:24:06,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968682498] [2022-12-13 09:24:06,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:24:06,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:24:06,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:24:06,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:24:06,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:24:06,914 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2022-12-13 09:24:06,914 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 09:24:06,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:24:06,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2022-12-13 09:24:06,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:24:06,979 INFO L130 PetriNetUnfolder]: 41/142 cut-off events. [2022-12-13 09:24:06,979 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-13 09:24:06,980 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 569 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 09:24:06,980 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 18 selfloop transitions, 13 changer transitions 0/38 dead transitions. [2022-12-13 09:24:06,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 201 flow [2022-12-13 09:24:06,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:24:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:24:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-13 09:24:06,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-13 09:24:06,981 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 123 flow. Second operand 4 states and 52 transitions. [2022-12-13 09:24:06,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 201 flow [2022-12-13 09:24:06,982 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 09:24:06,982 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 144 flow [2022-12-13 09:24:06,983 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 09:24:06,983 INFO L295 CegarLoopForPetriNet]: 61 programPoint places, -25 predicate places. [2022-12-13 09:24:06,983 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:24:06,983 INFO L89 Accepts]: Start accepts. Operand has 36 places, 31 transitions, 144 flow [2022-12-13 09:24:06,984 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:24:06,984 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:24:06,984 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 144 flow [2022-12-13 09:24:06,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 144 flow [2022-12-13 09:24:06,989 INFO L130 PetriNetUnfolder]: 10/72 cut-off events. [2022-12-13 09:24:06,989 INFO L131 PetriNetUnfolder]: For 12/18 co-relation queries the response was YES. [2022-12-13 09:24:06,989 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 254 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 09:24:06,989 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 31 transitions, 144 flow [2022-12-13 09:24:06,990 INFO L226 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-13 09:24:07,367 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:24:07,368 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 385 [2022-12-13 09:24:07,368 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 140 flow [2022-12-13 09:24:07,368 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 09:24:07,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:24:07,368 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:24:07,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:24:07,368 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 09:24:07,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:24:07,369 INFO L85 PathProgramCache]: Analyzing trace with hash 183275727, now seen corresponding path program 1 times [2022-12-13 09:24:07,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:24:07,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323409680] [2022-12-13 09:24:07,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:24:07,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:24:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:24:07,690 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 09:24:07,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:24:07,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323409680] [2022-12-13 09:24:07,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323409680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:24:07,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:24:07,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:24:07,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963703672] [2022-12-13 09:24:07,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:24:07,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:24:07,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:24:07,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:24:07,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:24:07,692 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2022-12-13 09:24:07,692 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 09:24:07,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:24:07,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2022-12-13 09:24:07,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:24:07,819 INFO L130 PetriNetUnfolder]: 63/172 cut-off events. [2022-12-13 09:24:07,819 INFO L131 PetriNetUnfolder]: For 117/123 co-relation queries the response was YES. [2022-12-13 09:24:07,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 172 events. 63/172 cut-off events. For 117/123 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 666 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 09:24:07,820 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 27 selfloop transitions, 8 changer transitions 20/60 dead transitions. [2022-12-13 09:24:07,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 60 transitions, 382 flow [2022-12-13 09:24:07,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 09:24:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 09:24:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2022-12-13 09:24:07,823 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2022-12-13 09:24:07,823 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 140 flow. Second operand 9 states and 83 transitions. [2022-12-13 09:24:07,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 60 transitions, 382 flow [2022-12-13 09:24:07,825 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 09:24:07,825 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 150 flow [2022-12-13 09:24:07,825 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 09:24:07,826 INFO L295 CegarLoopForPetriNet]: 61 programPoint places, -18 predicate places. [2022-12-13 09:24:07,826 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:24:07,826 INFO L89 Accepts]: Start accepts. Operand has 43 places, 32 transitions, 150 flow [2022-12-13 09:24:07,827 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:24:07,827 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:24:07,827 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 150 flow [2022-12-13 09:24:07,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 150 flow [2022-12-13 09:24:07,833 INFO L130 PetriNetUnfolder]: 12/57 cut-off events. [2022-12-13 09:24:07,833 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-13 09:24:07,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 57 events. 12/57 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 189 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 137. Up to 28 conditions per place. [2022-12-13 09:24:07,834 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 32 transitions, 150 flow [2022-12-13 09:24:07,834 INFO L226 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-13 09:24:08,012 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 09:24:08,289 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 09:24:08,451 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [433] $Ultimate##0-->L787: Formula: (and (= v_~a$w_buff0~0_281 v_~a$w_buff1~0_224) (= v_~a$r_buff0_thd1~0_233 v_~a$r_buff1_thd1~0_154) (= (ite (not (and (not (= (mod v_~a$w_buff0_used~0_436 256) 0)) (not (= 0 (mod v_~a$w_buff1_used~0_374 256))))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_72|) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_70| |v_P0Thread1of1ForFork0_~arg#1.offset_70|) (= v_~a$w_buff0~0_280 1) (= v_~a$w_buff0_used~0_437 v_~a$w_buff1_used~0_374) (= v_~a$w_buff0_used~0_436 1) (= v_~x~0_57 1) (= v_~z~0_42 v_~__unbuffered_p1_EAX~0_92) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_72| 0)) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_72| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_72|) (= |v_P0Thread1of1ForFork0_~arg#1.base_70| |v_P0Thread1of1ForFork0_#in~arg#1.base_70|) (= v_~a$r_buff0_thd1~0_232 1) (= v_~a$r_buff0_thd2~0_218 v_~a$r_buff1_thd2~0_232) (= v_~a$r_buff0_thd0~0_159 v_~a$r_buff1_thd0~0_166)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_70|, ~a$w_buff0~0=v_~a$w_buff0~0_281, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_218, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_437, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_70|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_233, ~z~0=v_~z~0_42, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_159} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_70|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_154, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_232, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_218, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_70|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_436, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_70|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_232, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_159, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_70|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_224, ~a$w_buff0~0=v_~a$w_buff0~0_280, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_72|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_166, ~z~0=v_~z~0_42, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_374, ~x~0=v_~x~0_57, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_72|} 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 09:24:08,932 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [434] L784-->L761: Formula: (and (= v_~a$r_buff0_thd2~0_220 v_~a$r_buff1_thd2~0_234) (= v_~x~0_59 v_~__unbuffered_p0_EAX~0_93) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_74| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_74|) (= v_~a$w_buff0_used~0_441 v_~a$w_buff1_used~0_376) (= |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_~a$w_buff0_used~0_440 1) (= v_~z~0_44 v_~__unbuffered_p1_EAX~0_94) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_74| 0)) (= v_~a$r_buff0_thd0~0_161 v_~a$r_buff1_thd0~0_168) (= v_~a$w_buff0~0_285 v_~a$w_buff1~0_226) (= v_~a$r_buff0_thd1~0_236 1) (= v_~a$w_buff0~0_284 1) (= |v_P0Thread1of1ForFork0_~arg#1.base_72| |v_P0Thread1of1ForFork0_#in~arg#1.base_72|) (= v_~x~0_59 1) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_74| (ite (not (and (not (= (mod v_~a$w_buff1_used~0_376 256) 0)) (not (= (mod v_~a$w_buff0_used~0_440 256) 0)))) 1 0))) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_72|, ~a$w_buff0~0=v_~a$w_buff0~0_285, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_220, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_441, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_72|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_237, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_161, ~z~0=v_~z~0_44} 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_234, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_220, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_72|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_440, 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_p0_EAX~0=v_~__unbuffered_p0_EAX~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_226, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_94, ~a$w_buff0~0=v_~a$w_buff0~0_284, 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, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_376, ~z~0=v_~z~0_44, ~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_p0_EAX~0, ~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 09:24:09,269 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [435] $Ultimate##0-->L761: Formula: (and (= |v_P0Thread1of1ForFork0_~arg#1.base_74| |v_P0Thread1of1ForFork0_#in~arg#1.base_74|) (= v_~z~0_46 v_~__unbuffered_p1_EAX~0_96) (= v_~a$r_buff0_thd1~0_240 1) (= v_~a$w_buff0_used~0_444 1) (= v_~a$w_buff0_used~0_445 v_~a$w_buff1_used~0_378) (= v_~x~0_61 1) (= v_~a$w_buff0~0_289 v_~a$w_buff1~0_228) (= v_~a$w_buff0~0_288 1) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_76| 0)) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_76| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_76|) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_74| |v_P0Thread1of1ForFork0_~arg#1.offset_74|) (= v_~a$r_buff0_thd1~0_241 v_~a$r_buff1_thd1~0_158) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_76| (ite (not (and (not (= (mod v_~a$w_buff0_used~0_444 256) 0)) (not (= (mod v_~a$w_buff1_used~0_378 256) 0)))) 1 0)) (= v_~x~0_61 v_~__unbuffered_p0_EAX~0_95) (= v_~a$r_buff0_thd0~0_163 v_~a$r_buff1_thd0~0_170) (= 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_74|, ~a$w_buff0~0=v_~a$w_buff0~0_289, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_222, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_445, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_74|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_241, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_163, ~z~0=v_~z~0_46} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_74|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_158, ~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_74|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_444, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_74|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_240, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_163, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_74|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_95, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~a$w_buff1~0=v_~a$w_buff1~0_228, ~a$w_buff0~0=v_~a$w_buff0~0_288, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_76|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_170, ~z~0=v_~z~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_378, ~x~0=v_~x~0_61, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_76|} 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 09:24:09,517 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 09:24:09,518 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1692 [2022-12-13 09:24:09,518 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 146 flow [2022-12-13 09:24:09,518 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 09:24:09,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:24:09,518 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:24:09,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:24:09,519 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 09:24:09,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:24:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash 746873333, now seen corresponding path program 1 times [2022-12-13 09:24:09,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:24:09,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662428021] [2022-12-13 09:24:09,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:24:09,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:24:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:24:10,016 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 09:24:10,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:24:10,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662428021] [2022-12-13 09:24:10,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662428021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:24:10,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:24:10,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 09:24:10,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111400129] [2022-12-13 09:24:10,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:24:10,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 09:24:10,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:24:10,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 09:24:10,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-13 09:24:10,018 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-13 09:24:10,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 146 flow. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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 09:24:10,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:24:10,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-13 09:24:10,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:24:10,143 INFO L130 PetriNetUnfolder]: 50/142 cut-off events. [2022-12-13 09:24:10,143 INFO L131 PetriNetUnfolder]: For 158/162 co-relation queries the response was YES. [2022-12-13 09:24:10,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 142 events. 50/142 cut-off events. For 158/162 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 586 event pairs, 5 based on Foata normal form. 13/130 useless extension candidates. Maximal degree in co-relation 457. Up to 49 conditions per place. [2022-12-13 09:24:10,144 INFO L137 encePairwiseOnDemand]: 11/22 looper letters, 18 selfloop transitions, 5 changer transitions 26/54 dead transitions. [2022-12-13 09:24:10,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 368 flow [2022-12-13 09:24:10,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:24:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 09:24:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-12-13 09:24:10,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 09:24:10,147 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 146 flow. Second operand 8 states and 66 transitions. [2022-12-13 09:24:10,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 368 flow [2022-12-13 09:24:10,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 338 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 09:24:10,149 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 138 flow [2022-12-13 09:24:10,149 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=138, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2022-12-13 09:24:10,150 INFO L295 CegarLoopForPetriNet]: 61 programPoint places, -18 predicate places. [2022-12-13 09:24:10,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:24:10,150 INFO L89 Accepts]: Start accepts. Operand has 43 places, 26 transitions, 138 flow [2022-12-13 09:24:10,150 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:24:10,150 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:24:10,150 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 26 transitions, 138 flow [2022-12-13 09:24:10,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 26 transitions, 138 flow [2022-12-13 09:24:10,156 INFO L130 PetriNetUnfolder]: 19/75 cut-off events. [2022-12-13 09:24:10,156 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-13 09:24:10,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 75 events. 19/75 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 312 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 186. Up to 46 conditions per place. [2022-12-13 09:24:10,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 26 transitions, 138 flow [2022-12-13 09:24:10,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-13 09:24:10,158 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [437] L784-->L803: Formula: (let ((.cse1 (= (mod v_~a$r_buff1_thd2~0_255 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd2~0_239 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and .cse1 .cse9)) (.cse8 (and .cse9 (= (mod v_~a$w_buff1_used~0_399 256) 0))) (.cse11 (= (mod v_~a$w_buff0_used~0_471 256) 0))) (let ((.cse5 (or .cse7 .cse8 .cse11)) (.cse6 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_74 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_398 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_470 256) 0))) (and (= (ite .cse0 v_~a$r_buff1_thd2~0_255 (ite (let ((.cse2 (= (mod v_~a$r_buff0_thd2~0_238 256) 0))) (or (and .cse1 .cse2) (and .cse2 .cse3) .cse4)) v_~a$r_buff1_thd2~0_255 0)) v_~a$r_buff1_thd2~0_254) (= (ite .cse0 v_~a$w_buff0_used~0_471 (ite .cse5 v_~a$w_buff0_used~0_471 (ite .cse6 0 v_~a$w_buff0_used~0_471))) v_~a$w_buff0_used~0_470) (= v_~z~0_48 v_~__unbuffered_p1_EAX~0_98) (= v_~weak$$choice2~0_74 |v_P1Thread1of1ForFork1_#t~nondet4_66|) (= (ite .cse0 v_~a$w_buff1_used~0_399 (ite (or .cse7 .cse4 .cse8) v_~a$w_buff1_used~0_399 0)) v_~a$w_buff1_used~0_398) (= v_~a~0_317 (ite .cse0 v_~a$mem_tmp~0_66 v_~__unbuffered_p1_EBX~0_122)) (= v_~a$w_buff1~0_241 v_~a$w_buff1~0_240) (= v_~weak$$choice0~0_49 |v_P1Thread1of1ForFork1_#t~nondet3_66|) (= v_~a~0_318 v_~a$mem_tmp~0_66) (= v_~a$flush_delayed~0_79 0) (= v_~a$w_buff0~0_307 v_~a$w_buff0~0_306) (= v_~__unbuffered_p1_EBX~0_122 (ite .cse5 v_~a~0_318 (ite .cse6 v_~a$w_buff0~0_307 v_~a$w_buff1~0_241))) (= (ite .cse0 v_~a$r_buff0_thd2~0_239 (ite (or .cse7 .cse4 (and .cse9 .cse3)) v_~a$r_buff0_thd2~0_239 (ite (and (not .cse4) .cse10) 0 v_~a$r_buff0_thd2~0_239))) v_~a$r_buff0_thd2~0_238))))) InVars {~a~0=v_~a~0_318, ~a$w_buff1~0=v_~a$w_buff1~0_241, ~a$w_buff0~0=v_~a$w_buff0~0_307, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_66|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_255, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_66|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_239, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_471, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_399, ~z~0=v_~z~0_48} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_122, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_254, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_238, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_470, ~a~0=v_~a~0_317, ~a$mem_tmp~0=v_~a$mem_tmp~0_66, ~weak$$choice0~0=v_~weak$$choice0~0_49, ~a$w_buff1~0=v_~a$w_buff1~0_240, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ~a$flush_delayed~0=v_~a$flush_delayed~0_79, ~a$w_buff0~0=v_~a$w_buff0~0_306, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_398, ~z~0=v_~z~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_74} 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, ~__unbuffered_p1_EAX~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0] and [296] L761-->L764: Formula: (= v_~__unbuffered_p0_EBX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~y~0=v_~y~0_1, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0] [2022-12-13 09:24:10,578 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [441] $Ultimate##0-->L803: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd2~0_271 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd2~0_255 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and .cse7 .cse10)) (.cse11 (= (mod v_~a$w_buff0_used~0_491 256) 0)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_415 256) 0) .cse7))) (let ((.cse4 (or .cse1 .cse11 .cse3)) (.cse5 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_82 256) 0))) (.cse2 (= (mod v_~a$w_buff0_used~0_490 256) 0)) (.cse6 (= 0 (mod v_~a$w_buff1_used~0_414 256)))) (and (= (ite .cse0 v_~a$w_buff1_used~0_415 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_415 0)) v_~a$w_buff1_used~0_414) (= v_~a~0_333 (ite .cse0 v_~a$mem_tmp~0_74 v_~__unbuffered_p1_EBX~0_130)) (= v_P1Thread1of1ForFork1_~arg.base_23 |v_P1Thread1of1ForFork1_#in~arg.base_23|) (= v_~a$w_buff0~0_327 v_~a$w_buff0~0_326) (= v_~a$w_buff0_used~0_490 (ite .cse0 v_~a$w_buff0_used~0_491 (ite .cse4 v_~a$w_buff0_used~0_491 (ite .cse5 0 v_~a$w_buff0_used~0_491)))) (= v_~a$w_buff1~0_257 v_~a$w_buff1~0_256) (= v_~z~0_56 v_~__unbuffered_p1_EAX~0_106) (= v_~a$flush_delayed~0_87 0) (= v_~weak$$choice2~0_82 |v_P1Thread1of1ForFork1_#t~nondet4_82|) (= (ite .cse0 v_~a$r_buff0_thd2~0_255 (ite (or .cse1 .cse2 (and .cse6 .cse7)) v_~a$r_buff0_thd2~0_255 (ite (and .cse8 (not .cse2)) 0 v_~a$r_buff0_thd2~0_255))) v_~a$r_buff0_thd2~0_254) (= v_~y~0_45 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_23| v_P1Thread1of1ForFork1_~arg.offset_23) (= v_~weak$$choice0~0_57 |v_P1Thread1of1ForFork1_#t~nondet3_82|) (= v_~z~0_56 1) (= v_~a~0_334 v_~a$mem_tmp~0_74) (= v_~__unbuffered_p1_EBX~0_130 (ite .cse4 v_~a~0_334 (ite .cse5 v_~a$w_buff0~0_327 v_~a$w_buff1~0_257))) (= (ite .cse0 v_~a$r_buff1_thd2~0_271 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd2~0_254 256) 0))) (or (and .cse9 .cse10) .cse2 (and .cse9 .cse6))) v_~a$r_buff1_thd2~0_271 0)) v_~a$r_buff1_thd2~0_270))))) InVars {~a~0=v_~a~0_334, ~a$w_buff1~0=v_~a$w_buff1~0_257, ~a$w_buff0~0=v_~a$w_buff0~0_327, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_82|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_271, 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_255, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_491, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_23|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_415} 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_270, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_254, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_490, ~a~0=v_~a~0_333, ~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_256, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, ~a$flush_delayed~0=v_~a$flush_delayed~0_87, ~a$w_buff0~0=v_~a$w_buff0~0_326, 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_414, ~z~0=v_~z~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_82, ~y~0=v_~y~0_45} 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] and [296] L761-->L764: Formula: (= v_~__unbuffered_p0_EBX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~y~0=v_~y~0_1, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0] [2022-12-13 09:24:10,741 ERROR L806 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-13 09:24:10,742 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [432] $Ultimate##0-->L761: Formula: (and (= v_~a$r_buff0_thd2~0_216 v_~a$r_buff1_thd2~0_230) (= v_~a$w_buff0_used~0_433 v_~a$w_buff1_used~0_372) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_70| (ite (not (and (not (= (mod v_~a$w_buff1_used~0_372 256) 0)) (not (= (mod v_~a$w_buff0_used~0_432 256) 0)))) 1 0)) (= |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_~x~0_55 v_~__unbuffered_p0_EAX~0_91) (= v_~a$r_buff0_thd0~0_157 v_~a$r_buff1_thd0~0_164) (= v_~a$w_buff0~0_276 1) (= v_~a$w_buff0_used~0_432 1) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_70| 0)) (= v_~a$w_buff0~0_277 v_~a$w_buff1~0_222) (= |v_P0Thread1of1ForFork0_~arg#1.base_68| |v_P0Thread1of1ForFork0_#in~arg#1.base_68|) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_68| |v_P0Thread1of1ForFork0_~arg#1.offset_68|) (= v_~x~0_55 1) (= v_~a$r_buff0_thd1~0_228 1)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_68|, ~a$w_buff0~0=v_~a$w_buff0~0_277, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_216, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_433, 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} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_68|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_152, ~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_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_68|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_432, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_68|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_228, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_157, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~a$w_buff1~0=v_~a$w_buff1~0_222, ~a$w_buff0~0=v_~a$w_buff0~0_276, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_70|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_164, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372, ~x~0=v_~x~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_70|} 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, ~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 [443] $Ultimate##0-->L764: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd2~0_285 256) 0)) (.cse7 (= 0 (mod v_~a$r_buff0_thd2~0_269 256)))) (let ((.cse8 (not .cse7)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_433 256) 0) .cse7)) (.cse3 (and .cse9 .cse7)) (.cse11 (= (mod v_~a$w_buff0_used~0_511 256) 0))) (let ((.cse4 (or .cse2 .cse3 .cse11)) (.cse5 (and (not .cse11) .cse8)) (.cse0 (not (= (mod v_~weak$$choice2~0_84 256) 0))) (.cse1 (= (mod v_~a$w_buff0_used~0_510 256) 0)) (.cse6 (= (mod v_~a$w_buff1_used~0_432 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_104 v_~y~0_49) (= |v_P1Thread1of1ForFork1_#in~arg.offset_25| v_P1Thread1of1ForFork1_~arg.offset_25) (= (ite .cse0 v_~a$w_buff1_used~0_433 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_433 0)) v_~a$w_buff1_used~0_432) (= v_~weak$$choice0~0_59 |v_P1Thread1of1ForFork1_#t~nondet3_86|) (= v_~weak$$choice2~0_84 |v_P1Thread1of1ForFork1_#t~nondet4_86|) (= v_~a$flush_delayed~0_89 0) (= v_~a~0_350 v_~a$mem_tmp~0_76) (= (ite .cse0 v_~a$w_buff0_used~0_511 (ite .cse4 v_~a$w_buff0_used~0_511 (ite .cse5 0 v_~a$w_buff0_used~0_511))) v_~a$w_buff0_used~0_510) (= (ite .cse4 v_~a~0_350 (ite .cse5 v_~a$w_buff0~0_339 v_~a$w_buff1~0_267)) v_~__unbuffered_p1_EBX~0_132) (= v_~z~0_58 v_~__unbuffered_p1_EAX~0_108) (= v_~y~0_49 1) (= v_~a$w_buff0~0_339 v_~a$w_buff0~0_338) (= v_~a~0_349 (ite .cse0 v_~a$mem_tmp~0_76 v_~__unbuffered_p1_EBX~0_132)) (= v_~z~0_58 1) (= (ite .cse0 v_~a$r_buff0_thd2~0_269 (ite (or .cse1 (and .cse6 .cse7) .cse3) v_~a$r_buff0_thd2~0_269 (ite (and (not .cse1) .cse8) 0 v_~a$r_buff0_thd2~0_269))) v_~a$r_buff0_thd2~0_268) (= v_P1Thread1of1ForFork1_~arg.base_25 |v_P1Thread1of1ForFork1_#in~arg.base_25|) (= v_~a$r_buff1_thd2~0_284 (ite .cse0 v_~a$r_buff1_thd2~0_285 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd2~0_268 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse6 .cse10))) v_~a$r_buff1_thd2~0_285 0))) (= v_~a$w_buff1~0_267 v_~a$w_buff1~0_266))))) InVars {~a~0=v_~a~0_350, ~a$w_buff1~0=v_~a$w_buff1~0_267, ~a$w_buff0~0=v_~a$w_buff0~0_339, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_86|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_285, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_25|, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_86|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_269, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_511, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_25|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_433} OutVars{~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_132, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_25, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_284, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_268, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_510, ~a~0=v_~a~0_349, ~a$mem_tmp~0=v_~a$mem_tmp~0_76, ~weak$$choice0~0=v_~weak$$choice0~0_59, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_25, ~a$w_buff1~0=v_~a$w_buff1~0_266, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_108, ~a$flush_delayed~0=v_~a$flush_delayed~0_89, ~a$w_buff0~0=v_~a$w_buff0~0_338, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_25|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_25|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_432, ~z~0=v_~z~0_58, ~y~0=v_~y~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_84} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0, ~__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, ~y~0, ~weak$$choice2~0] [2022-12-13 09:24:11,130 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 09:24:11,131 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 981 [2022-12-13 09:24:11,131 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 141 flow [2022-12-13 09:24:11,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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 09:24:11,131 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:24:11,131 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:24:11,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:24:11,132 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 09:24:11,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:24:11,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1755412563, now seen corresponding path program 1 times [2022-12-13 09:24:11,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:24:11,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051106931] [2022-12-13 09:24:11,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:24:11,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:24:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:24:11,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:24:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:24:11,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:24:11,206 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:24:11,207 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 09:24:11,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 09:24:11,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 09:24:11,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 09:24:11,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 09:24:11,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:24:11,208 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:24:11,212 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:24:11,212 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:24:11,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:24:11 BasicIcfg [2022-12-13 09:24:11,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:24:11,241 INFO L158 Benchmark]: Toolchain (without parser) took 11356.54ms. Allocated memory was 189.8MB in the beginning and 449.8MB in the end (delta: 260.0MB). Free memory was 164.5MB in the beginning and 395.1MB in the end (delta: -230.6MB). Peak memory consumption was 30.1MB. Max. memory is 8.0GB. [2022-12-13 09:24:11,241 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 189.8MB. Free memory is still 166.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:24:11,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.41ms. Allocated memory is still 189.8MB. Free memory was 164.1MB in the beginning and 138.4MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 09:24:11,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.77ms. Allocated memory is still 189.8MB. Free memory was 138.4MB in the beginning and 136.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:24:11,241 INFO L158 Benchmark]: Boogie Preprocessor took 29.83ms. Allocated memory is still 189.8MB. Free memory was 136.0MB in the beginning and 134.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:24:11,242 INFO L158 Benchmark]: RCFGBuilder took 605.62ms. Allocated memory is still 189.8MB. Free memory was 134.3MB in the beginning and 103.5MB in the end (delta: 30.8MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-13 09:24:11,242 INFO L158 Benchmark]: TraceAbstraction took 10232.39ms. Allocated memory was 189.8MB in the beginning and 449.8MB in the end (delta: 260.0MB). Free memory was 102.2MB in the beginning and 395.1MB in the end (delta: -292.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:24:11,243 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 189.8MB. Free memory is still 166.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 427.41ms. Allocated memory is still 189.8MB. Free memory was 164.1MB in the beginning and 138.4MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.77ms. Allocated memory is still 189.8MB. Free memory was 138.4MB in the beginning and 136.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.83ms. Allocated memory is still 189.8MB. Free memory was 136.0MB in the beginning and 134.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 605.62ms. Allocated memory is still 189.8MB. Free memory was 134.3MB in the beginning and 103.5MB in the end (delta: 30.8MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 10232.39ms. Allocated memory was 189.8MB in the beginning and 449.8MB in the end (delta: 260.0MB). Free memory was 102.2MB in the beginning and 395.1MB in the end (delta: -292.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 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: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1448, independent: 1409, independent conditional: 0, independent unconditional: 1409, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1448, independent: 1409, independent conditional: 0, independent unconditional: 1409, 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: 1448, independent: 1390, independent conditional: 0, independent unconditional: 1390, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 164, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2309, independent: 796, independent conditional: 796, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 1448, unknown conditional: 1448, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1448, Positive cache size: 1409, Positive conditional cache size: 1409, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 82, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 82, dependent conditional: 36, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 167, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 136, unknown conditional: 136, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 113, Positive conditional cache size: 113, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 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: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 25, independent conditional: 3, independent unconditional: 22, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 25, independent conditional: 3, independent unconditional: 22, 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: 31, independent: 25, independent conditional: 0, independent unconditional: 25, 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: 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: 131, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 138, Positive conditional cache size: 138, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 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: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 1, 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: 6, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 134, independent: 104, independent conditional: 104, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 142, Positive conditional cache size: 142, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 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: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 26, independent conditional: 5, independent unconditional: 21, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 26, independent conditional: 5, 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: 31, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 26, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 158, independent: 106, independent conditional: 106, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 168, Positive conditional cache size: 168, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 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: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 13, independent conditional: 11, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 13, independent conditional: 11, 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: 15, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 118, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 181, Positive conditional cache size: 181, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 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: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 11, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 11, 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: 19, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 164, independent: 101, independent conditional: 101, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 198, Positive conditional cache size: 198, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 39 PlacesBefore, 35 PlacesAfterwards, 32 TransitionsBefore, 28 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 210, independent: 166, independent conditional: 166, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 35, independent conditional: 28, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, independent: 35, independent conditional: 28, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 38, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 210, independent: 131, independent conditional: 131, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 38, unknown conditional: 38, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 233, Positive conditional cache size: 233, Positive unconditional cache size: 0, Negative cache size: 43, Negative conditional cache size: 43, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 41 PlacesBefore, 41 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 200, independent: 158, independent conditional: 158, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 22, independent conditional: 19, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 22, independent conditional: 19, 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: 24, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 200, independent: 136, independent conditional: 136, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 255, Positive conditional cache size: 255, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 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 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 y = 1 [L783] 2 z = 1 [L786] 2 __unbuffered_p1_EAX = z [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 a$flush_delayed = weak$$choice2 [L792] 2 a$mem_tmp = a [L793] 2 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] 2 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] 2 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] 2 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] 2 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] 2 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] 2 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] 2 __unbuffered_p1_EBX = a [L801] 2 a = a$flush_delayed ? a$mem_tmp : a [L802] 2 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=0, 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=0, 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=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=0, 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=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, 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=0, 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)=0, \old(expression)=1, __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=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, 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: 10.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 154 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 458 IncrementalHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 13 mSDtfsCounter, 458 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=7, InterpolantAutomatonStates: 36, 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.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 590 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 09:24:11,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...