/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:16:50,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:16:50,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:16:50,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:16:50,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:16:50,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:16:50,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:16:50,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:16:50,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:16:50,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:16:50,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:16:50,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:16:50,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:16:50,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:16:50,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:16:50,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:16:50,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:16:50,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:16:50,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:16:50,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:16:50,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:16:50,293 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:16:50,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:16:50,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:16:50,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:16:50,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:16:50,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:16:50,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:16:50,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:16:50,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:16:50,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:16:50,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:16:50,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:16:50,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:16:50,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:16:50,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:16:50,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:16:50,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:16:50,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:16:50,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:16:50,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:16:50,310 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 03:16:50,341 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:16:50,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:16:50,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:16:50,343 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:16:50,343 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:16:50,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:16:50,344 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:16:50,344 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:16:50,344 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:16:50,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:16:50,345 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:16:50,345 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:16:50,345 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:16:50,345 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:16:50,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:16:50,346 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:16:50,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:16:50,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:16:50,346 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:16:50,346 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:16:50,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:16:50,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:16:50,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:16:50,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:16:50,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:16:50,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:16:50,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:16:50,347 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:16:50,347 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 03:16:50,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:16:50,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:16:50,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:16:50,632 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:16:50,632 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:16:50,633 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-13 03:16:51,615 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:16:51,967 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:16:51,968 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-13 03:16:52,011 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/827db25a4/749c6d0505fc4a9096b27277d300ebe7/FLAGe38cc7b83 [2022-12-13 03:16:52,033 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/827db25a4/749c6d0505fc4a9096b27277d300ebe7 [2022-12-13 03:16:52,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:16:52,037 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:16:52,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:16:52,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:16:52,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:16:52,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:16:52" (1/1) ... [2022-12-13 03:16:52,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6c3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:52, skipping insertion in model container [2022-12-13 03:16:52,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:16:52" (1/1) ... [2022-12-13 03:16:52,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:16:52,111 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:16:52,279 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/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-12-13 03:16:52,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:16:52,439 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:16:52,446 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/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-12-13 03:16:52,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:16:52,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:16:52,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:16:52,525 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:16:52,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:52 WrapperNode [2022-12-13 03:16:52,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:16:52,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:16:52,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:16:52,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:16:52,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:52" (1/1) ... [2022-12-13 03:16:52,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:52" (1/1) ... [2022-12-13 03:16:52,579 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-13 03:16:52,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:16:52,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:16:52,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:16:52,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:16:52,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:52" (1/1) ... [2022-12-13 03:16:52,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:52" (1/1) ... [2022-12-13 03:16:52,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:52" (1/1) ... [2022-12-13 03:16:52,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:52" (1/1) ... [2022-12-13 03:16:52,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:52" (1/1) ... [2022-12-13 03:16:52,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:52" (1/1) ... [2022-12-13 03:16:52,606 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:52" (1/1) ... [2022-12-13 03:16:52,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:52" (1/1) ... [2022-12-13 03:16:52,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:16:52,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:16:52,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:16:52,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:16:52,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:52" (1/1) ... [2022-12-13 03:16:52,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:16:52,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:16:52,647 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 03:16:52,669 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 03:16:52,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:16:52,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 03:16:52,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:16:52,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:16:52,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:16:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 03:16:52,683 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 03:16:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 03:16:52,683 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 03:16:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 03:16:52,683 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 03:16:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:16:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 03:16:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:16:52,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:16:52,684 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 03:16:52,773 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:16:52,774 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:16:53,051 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:16:53,141 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:16:53,141 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:16:53,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:16:53 BoogieIcfgContainer [2022-12-13 03:16:53,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:16:53,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:16:53,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:16:53,147 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:16:53,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:16:52" (1/3) ... [2022-12-13 03:16:53,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e1b664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:16:53, skipping insertion in model container [2022-12-13 03:16:53,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:16:52" (2/3) ... [2022-12-13 03:16:53,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e1b664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:16:53, skipping insertion in model container [2022-12-13 03:16:53,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:16:53" (3/3) ... [2022-12-13 03:16:53,148 INFO L112 eAbstractionObserver]: Analyzing ICFG safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-13 03:16:53,160 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:16:53,160 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 03:16:53,160 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:16:53,210 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 03:16:53,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-13 03:16:53,281 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 03:16:53,281 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:16:53,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 03:16:53,285 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-13 03:16:53,288 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-13 03:16:53,289 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:16:53,309 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-13 03:16:53,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-13 03:16:53,341 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 03:16:53,341 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:16:53,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 03:16:53,344 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-13 03:16:53,344 INFO L226 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-13 03:16:58,055 INFO L241 LiptonReduction]: Total number of compositions: 84 [2022-12-13 03:16:58,066 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:16:58,070 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;@4bc6c1c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:16:58,070 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 03:16:58,072 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2022-12-13 03:16:58,072 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:16:58,072 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:16:58,072 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 03:16:58,073 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:16:58,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:16:58,076 INFO L85 PathProgramCache]: Analyzing trace with hash 508067, now seen corresponding path program 1 times [2022-12-13 03:16:58,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:16:58,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415170856] [2022-12-13 03:16:58,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:16:58,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:16:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:16:58,329 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 03:16:58,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:16:58,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415170856] [2022-12-13 03:16:58,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415170856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:16:58,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:16:58,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:16:58,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045435894] [2022-12-13 03:16:58,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:16:58,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:16:58,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:16:58,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:16:58,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:16:58,348 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 66 [2022-12-13 03:16:58,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 03:16:58,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:16:58,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 66 [2022-12-13 03:16:58,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:16:59,639 INFO L130 PetriNetUnfolder]: 9240/14512 cut-off events. [2022-12-13 03:16:59,640 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 03:16:59,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27750 conditions, 14512 events. 9240/14512 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 104635 event pairs, 2624 based on Foata normal form. 0/9050 useless extension candidates. Maximal degree in co-relation 27739. Up to 11165 conditions per place. [2022-12-13 03:16:59,675 INFO L137 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 59/108 dead transitions. [2022-12-13 03:16:59,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 423 flow [2022-12-13 03:16:59,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:16:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:16:59,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2022-12-13 03:16:59,684 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6919191919191919 [2022-12-13 03:16:59,689 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2022-12-13 03:16:59,689 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 108 transitions, 423 flow [2022-12-13 03:16:59,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 49 transitions, 189 flow [2022-12-13 03:16:59,761 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:16:59,762 INFO L89 Accepts]: Start accepts. Operand has 45 places, 49 transitions, 189 flow [2022-12-13 03:16:59,764 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:16:59,764 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:16:59,764 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 49 transitions, 189 flow [2022-12-13 03:16:59,770 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 49 transitions, 189 flow [2022-12-13 03:16:59,771 INFO L226 LiptonReduction]: Number of co-enabled transitions 510 [2022-12-13 03:16:59,854 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:16:59,855 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 03:16:59,855 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 49 transitions, 189 flow [2022-12-13 03:16:59,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 03:16:59,856 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:16:59,856 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:16:59,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:16:59,856 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:16:59,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:16:59,856 INFO L85 PathProgramCache]: Analyzing trace with hash 100634364, now seen corresponding path program 1 times [2022-12-13 03:16:59,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:16:59,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497458592] [2022-12-13 03:16:59,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:16:59,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:16:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:16:59,999 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 03:16:59,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:00,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497458592] [2022-12-13 03:17:00,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497458592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:00,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:00,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:17:00,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746142633] [2022-12-13 03:17:00,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:00,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:17:00,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:00,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:17:00,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:17:00,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 03:17:00,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 49 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 03:17:00,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:00,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 03:17:00,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:00,550 INFO L130 PetriNetUnfolder]: 3323/5230 cut-off events. [2022-12-13 03:17:00,550 INFO L131 PetriNetUnfolder]: For 567/567 co-relation queries the response was YES. [2022-12-13 03:17:00,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14689 conditions, 5230 events. 3323/5230 cut-off events. For 567/567 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 31682 event pairs, 733 based on Foata normal form. 122/4468 useless extension candidates. Maximal degree in co-relation 14675. Up to 4092 conditions per place. [2022-12-13 03:17:00,572 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 56 selfloop transitions, 7 changer transitions 2/74 dead transitions. [2022-12-13 03:17:00,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 74 transitions, 421 flow [2022-12-13 03:17:00,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:17:00,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:17:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-13 03:17:00,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7171717171717171 [2022-12-13 03:17:00,575 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -28 predicate places. [2022-12-13 03:17:00,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 74 transitions, 421 flow [2022-12-13 03:17:00,591 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 72 transitions, 413 flow [2022-12-13 03:17:00,614 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:00,615 INFO L89 Accepts]: Start accepts. Operand has 46 places, 72 transitions, 413 flow [2022-12-13 03:17:00,616 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:00,616 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:00,616 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 72 transitions, 413 flow [2022-12-13 03:17:00,617 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 72 transitions, 413 flow [2022-12-13 03:17:00,618 INFO L226 LiptonReduction]: Number of co-enabled transitions 620 [2022-12-13 03:17:00,624 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:00,625 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 03:17:00,625 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 72 transitions, 413 flow [2022-12-13 03:17:00,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 03:17:00,626 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:00,626 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:00,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:17:00,626 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:00,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:00,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1175302277, now seen corresponding path program 1 times [2022-12-13 03:17:00,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:00,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473422880] [2022-12-13 03:17:00,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:00,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:00,714 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 03:17:00,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:00,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473422880] [2022-12-13 03:17:00,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473422880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:00,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:00,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:17:00,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356796213] [2022-12-13 03:17:00,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:00,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:17:00,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:00,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:17:00,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:17:00,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 03:17:00,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 72 transitions, 413 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 03:17:00,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:00,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 03:17:00,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:01,056 INFO L130 PetriNetUnfolder]: 2518/4043 cut-off events. [2022-12-13 03:17:01,056 INFO L131 PetriNetUnfolder]: For 368/368 co-relation queries the response was YES. [2022-12-13 03:17:01,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15312 conditions, 4043 events. 2518/4043 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 23930 event pairs, 120 based on Foata normal form. 24/3370 useless extension candidates. Maximal degree in co-relation 15295. Up to 3341 conditions per place. [2022-12-13 03:17:01,075 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 79 selfloop transitions, 8 changer transitions 0/96 dead transitions. [2022-12-13 03:17:01,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 96 transitions, 729 flow [2022-12-13 03:17:01,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:17:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:17:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-13 03:17:01,077 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65625 [2022-12-13 03:17:01,077 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -26 predicate places. [2022-12-13 03:17:01,077 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 96 transitions, 729 flow [2022-12-13 03:17:01,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 96 transitions, 729 flow [2022-12-13 03:17:01,109 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:01,109 INFO L89 Accepts]: Start accepts. Operand has 49 places, 96 transitions, 729 flow [2022-12-13 03:17:01,110 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:01,110 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:01,110 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 96 transitions, 729 flow [2022-12-13 03:17:01,112 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 96 transitions, 729 flow [2022-12-13 03:17:01,112 INFO L226 LiptonReduction]: Number of co-enabled transitions 750 [2022-12-13 03:17:01,119 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:01,120 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 03:17:01,120 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 96 transitions, 729 flow [2022-12-13 03:17:01,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 03:17:01,120 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:01,120 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:01,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:17:01,120 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:01,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:01,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1175305098, now seen corresponding path program 1 times [2022-12-13 03:17:01,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:01,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127724666] [2022-12-13 03:17:01,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:01,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:01,194 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 03:17:01,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:01,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127724666] [2022-12-13 03:17:01,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127724666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:01,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:01,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:17:01,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498570196] [2022-12-13 03:17:01,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:01,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:17:01,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:01,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:17:01,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:17:01,196 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 03:17:01,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 96 transitions, 729 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 03:17:01,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:01,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 03:17:01,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:01,562 INFO L130 PetriNetUnfolder]: 2459/3949 cut-off events. [2022-12-13 03:17:01,562 INFO L131 PetriNetUnfolder]: For 450/450 co-relation queries the response was YES. [2022-12-13 03:17:01,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18629 conditions, 3949 events. 2459/3949 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 23120 event pairs, 112 based on Foata normal form. 10/3273 useless extension candidates. Maximal degree in co-relation 18609. Up to 3587 conditions per place. [2022-12-13 03:17:01,578 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 103 selfloop transitions, 7 changer transitions 0/119 dead transitions. [2022-12-13 03:17:01,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 119 transitions, 1137 flow [2022-12-13 03:17:01,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:17:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:17:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-13 03:17:01,580 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2022-12-13 03:17:01,580 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -24 predicate places. [2022-12-13 03:17:01,580 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 119 transitions, 1137 flow [2022-12-13 03:17:01,592 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 119 transitions, 1137 flow [2022-12-13 03:17:01,609 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:01,609 INFO L89 Accepts]: Start accepts. Operand has 51 places, 119 transitions, 1137 flow [2022-12-13 03:17:01,610 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:01,610 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:01,610 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 119 transitions, 1137 flow [2022-12-13 03:17:01,613 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 119 transitions, 1137 flow [2022-12-13 03:17:01,613 INFO L226 LiptonReduction]: Number of co-enabled transitions 830 [2022-12-13 03:17:01,618 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:01,619 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 03:17:01,619 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 119 transitions, 1137 flow [2022-12-13 03:17:01,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 03:17:01,619 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:01,619 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:01,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:17:01,619 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:01,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:01,620 INFO L85 PathProgramCache]: Analyzing trace with hash -2074635305, now seen corresponding path program 1 times [2022-12-13 03:17:01,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:01,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967986332] [2022-12-13 03:17:01,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:01,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:01,754 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 03:17:01,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:01,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967986332] [2022-12-13 03:17:01,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967986332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:01,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:01,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:17:01,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243043549] [2022-12-13 03:17:01,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:01,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:17:01,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:01,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:17:01,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:17:01,756 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 03:17:01,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 119 transitions, 1137 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 03:17:01,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:01,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 03:17:01,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:02,284 INFO L130 PetriNetUnfolder]: 4089/6499 cut-off events. [2022-12-13 03:17:02,284 INFO L131 PetriNetUnfolder]: For 5890/5910 co-relation queries the response was YES. [2022-12-13 03:17:02,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35947 conditions, 6499 events. 4089/6499 cut-off events. For 5890/5910 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 40118 event pairs, 96 based on Foata normal form. 190/5549 useless extension candidates. Maximal degree in co-relation 35924. Up to 5814 conditions per place. [2022-12-13 03:17:02,307 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 102 selfloop transitions, 5 changer transitions 82/200 dead transitions. [2022-12-13 03:17:02,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 200 transitions, 2332 flow [2022-12-13 03:17:02,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:17:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:17:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 03:17:02,309 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2022-12-13 03:17:02,309 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -21 predicate places. [2022-12-13 03:17:02,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 200 transitions, 2332 flow [2022-12-13 03:17:02,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 118 transitions, 1352 flow [2022-12-13 03:17:02,405 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:02,405 INFO L89 Accepts]: Start accepts. Operand has 54 places, 118 transitions, 1352 flow [2022-12-13 03:17:02,406 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:02,406 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:02,406 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 118 transitions, 1352 flow [2022-12-13 03:17:02,409 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 118 transitions, 1352 flow [2022-12-13 03:17:02,409 INFO L226 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-13 03:17:02,412 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:02,413 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 03:17:02,413 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 118 transitions, 1352 flow [2022-12-13 03:17:02,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 03:17:02,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:02,413 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:02,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:17:02,413 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:02,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:02,414 INFO L85 PathProgramCache]: Analyzing trace with hash 110782108, now seen corresponding path program 1 times [2022-12-13 03:17:02,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:02,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69344964] [2022-12-13 03:17:02,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:02,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:02,551 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 03:17:02,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:02,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69344964] [2022-12-13 03:17:02,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69344964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:02,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:02,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:17:02,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849735817] [2022-12-13 03:17:02,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:02,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:17:02,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:02,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:17:02,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:17:02,558 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 03:17:02,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 118 transitions, 1352 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 03:17:02,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:02,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 03:17:02,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:03,171 INFO L130 PetriNetUnfolder]: 3724/5843 cut-off events. [2022-12-13 03:17:03,171 INFO L131 PetriNetUnfolder]: For 13521/13681 co-relation queries the response was YES. [2022-12-13 03:17:03,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35876 conditions, 5843 events. 3724/5843 cut-off events. For 13521/13681 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 34458 event pairs, 184 based on Foata normal form. 479/5373 useless extension candidates. Maximal degree in co-relation 35850. Up to 4868 conditions per place. [2022-12-13 03:17:03,212 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 167 selfloop transitions, 42 changer transitions 13/231 dead transitions. [2022-12-13 03:17:03,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 231 transitions, 3110 flow [2022-12-13 03:17:03,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:17:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:17:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-13 03:17:03,213 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.71875 [2022-12-13 03:17:03,214 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -18 predicate places. [2022-12-13 03:17:03,214 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 231 transitions, 3110 flow [2022-12-13 03:17:03,240 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 218 transitions, 2928 flow [2022-12-13 03:17:03,279 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:03,279 INFO L89 Accepts]: Start accepts. Operand has 57 places, 218 transitions, 2928 flow [2022-12-13 03:17:03,280 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:03,280 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:03,281 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 218 transitions, 2928 flow [2022-12-13 03:17:03,286 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 218 transitions, 2928 flow [2022-12-13 03:17:03,286 INFO L226 LiptonReduction]: Number of co-enabled transitions 632 [2022-12-13 03:17:03,320 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:17:03,321 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 03:17:03,321 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 218 transitions, 2928 flow [2022-12-13 03:17:03,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 03:17:03,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:03,321 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:03,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:17:03,321 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:03,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:03,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1019642389, now seen corresponding path program 1 times [2022-12-13 03:17:03,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:03,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116692407] [2022-12-13 03:17:03,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:03,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:03,449 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 03:17:03,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:03,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116692407] [2022-12-13 03:17:03,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116692407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:03,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:03,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:17:03,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413670847] [2022-12-13 03:17:03,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:03,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:17:03,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:03,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:17:03,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:17:03,451 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 03:17:03,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 218 transitions, 2928 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 03:17:03,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:03,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 03:17:03,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:03,896 INFO L130 PetriNetUnfolder]: 2129/3712 cut-off events. [2022-12-13 03:17:03,896 INFO L131 PetriNetUnfolder]: For 9841/9953 co-relation queries the response was YES. [2022-12-13 03:17:03,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26485 conditions, 3712 events. 2129/3712 cut-off events. For 9841/9953 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 23274 event pairs, 18 based on Foata normal form. 417/3574 useless extension candidates. Maximal degree in co-relation 26456. Up to 3101 conditions per place. [2022-12-13 03:17:03,913 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 131 selfloop transitions, 64 changer transitions 96/300 dead transitions. [2022-12-13 03:17:03,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 300 transitions, 4574 flow [2022-12-13 03:17:03,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:17:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:17:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2022-12-13 03:17:03,915 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.703030303030303 [2022-12-13 03:17:03,916 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -14 predicate places. [2022-12-13 03:17:03,916 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 300 transitions, 4574 flow [2022-12-13 03:17:03,928 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 204 transitions, 3098 flow [2022-12-13 03:17:03,947 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:03,948 INFO L89 Accepts]: Start accepts. Operand has 61 places, 204 transitions, 3098 flow [2022-12-13 03:17:03,949 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:03,949 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:03,950 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 204 transitions, 3098 flow [2022-12-13 03:17:03,955 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 204 transitions, 3098 flow [2022-12-13 03:17:03,956 INFO L226 LiptonReduction]: Number of co-enabled transitions 588 [2022-12-13 03:17:03,958 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:03,960 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 03:17:03,960 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 204 transitions, 3098 flow [2022-12-13 03:17:03,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 03:17:03,960 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:03,960 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:03,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:17:03,960 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:03,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:03,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1044072840, now seen corresponding path program 1 times [2022-12-13 03:17:03,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:03,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641096893] [2022-12-13 03:17:03,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:03,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:04,176 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 03:17:04,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:04,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641096893] [2022-12-13 03:17:04,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641096893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:04,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:04,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:17:04,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187740243] [2022-12-13 03:17:04,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:04,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:17:04,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:04,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:17:04,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:17:04,179 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 03:17:04,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 204 transitions, 3098 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 03:17:04,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:04,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 03:17:04,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:04,413 INFO L130 PetriNetUnfolder]: 964/1908 cut-off events. [2022-12-13 03:17:04,413 INFO L131 PetriNetUnfolder]: For 7749/7871 co-relation queries the response was YES. [2022-12-13 03:17:04,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15313 conditions, 1908 events. 964/1908 cut-off events. For 7749/7871 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11786 event pairs, 0 based on Foata normal form. 285/1926 useless extension candidates. Maximal degree in co-relation 15281. Up to 1550 conditions per place. [2022-12-13 03:17:04,422 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 90 selfloop transitions, 61 changer transitions 42/202 dead transitions. [2022-12-13 03:17:04,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 202 transitions, 3452 flow [2022-12-13 03:17:04,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:17:04,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:17:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-13 03:17:04,423 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5572916666666666 [2022-12-13 03:17:04,425 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -9 predicate places. [2022-12-13 03:17:04,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 202 transitions, 3452 flow [2022-12-13 03:17:04,434 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 160 transitions, 2726 flow [2022-12-13 03:17:04,445 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:04,446 INFO L89 Accepts]: Start accepts. Operand has 66 places, 160 transitions, 2726 flow [2022-12-13 03:17:04,447 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:04,447 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:04,447 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 160 transitions, 2726 flow [2022-12-13 03:17:04,452 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 160 transitions, 2726 flow [2022-12-13 03:17:04,452 INFO L226 LiptonReduction]: Number of co-enabled transitions 522 [2022-12-13 03:17:04,987 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [342] L816-->L819: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [501] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_386 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_132 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_138 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_387 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_344 256) 0)))) (.cse2 (and .cse5 .cse4))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_139|) (= (ite .cse0 v_~z$w_buff0~0_235 (ite .cse1 v_~z$w_buff1~0_201 v_~z~0_297)) v_~z~0_296) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_139| 0)) (= (ite .cse0 0 v_~z$w_buff0_used~0_387) v_~z$w_buff0_used~0_386) (= (ite (= 0 (ite (= v_~__unbuffered_cnt~0_295 3) 1 0)) 0 1) v_~main$tmp_guard0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| (mod v_~main$tmp_guard1~0_80 256)) (= v_~z$w_buff1_used~0_343 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_344)) (= v_~z$r_buff1_thd0~0_131 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_343 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd0~0_137 256) 0)))) 0 v_~z$r_buff1_thd0~0_132)) (= v_~z$r_buff0_thd0~0_137 (ite .cse2 0 v_~z$r_buff0_thd0~0_138)) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~x~0_83 2) (= v_~__unbuffered_p2_EAX~0_83 1) (= v_~__unbuffered_p2_EBX~0_97 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| (mod v_~main$tmp_guard0~0_120 256))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_138, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_387, ~z$w_buff0~0=v_~z$w_buff0~0_235, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_344, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_297, ~x~0=v_~x~0_83} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_75|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_386, ~z$w_buff0~0=v_~z$w_buff0~0_235, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_87|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_343, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_131, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_139|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_296, ~x~0=v_~x~0_83, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 03:17:05,149 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [365] L816-->P2FINAL: Formula: (and (= v_~__unbuffered_cnt~0_29 (+ v_~__unbuffered_cnt~0_30 1)) (= |v_P2Thread1of1ForFork1_#res.base_7| 0) (= |v_P2Thread1of1ForFork1_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] and [501] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_386 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_132 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_138 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_387 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_344 256) 0)))) (.cse2 (and .cse5 .cse4))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_139|) (= (ite .cse0 v_~z$w_buff0~0_235 (ite .cse1 v_~z$w_buff1~0_201 v_~z~0_297)) v_~z~0_296) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_139| 0)) (= (ite .cse0 0 v_~z$w_buff0_used~0_387) v_~z$w_buff0_used~0_386) (= (ite (= 0 (ite (= v_~__unbuffered_cnt~0_295 3) 1 0)) 0 1) v_~main$tmp_guard0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| (mod v_~main$tmp_guard1~0_80 256)) (= v_~z$w_buff1_used~0_343 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_344)) (= v_~z$r_buff1_thd0~0_131 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_343 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd0~0_137 256) 0)))) 0 v_~z$r_buff1_thd0~0_132)) (= v_~z$r_buff0_thd0~0_137 (ite .cse2 0 v_~z$r_buff0_thd0~0_138)) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~x~0_83 2) (= v_~__unbuffered_p2_EAX~0_83 1) (= v_~__unbuffered_p2_EBX~0_97 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| (mod v_~main$tmp_guard0~0_120 256))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_138, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_387, ~z$w_buff0~0=v_~z$w_buff0~0_235, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_344, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_297, ~x~0=v_~x~0_83} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_75|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_386, ~z$w_buff0~0=v_~z$w_buff0~0_235, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_87|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_343, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_131, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_139|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_296, ~x~0=v_~x~0_83, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 03:17:05,340 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [366] L816-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res.base_9| 0) (= (+ v_~__unbuffered_cnt~0_34 1) v_~__unbuffered_cnt~0_33) (= |v_P2Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] and [501] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_386 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_132 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_138 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_387 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_344 256) 0)))) (.cse2 (and .cse5 .cse4))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_139|) (= (ite .cse0 v_~z$w_buff0~0_235 (ite .cse1 v_~z$w_buff1~0_201 v_~z~0_297)) v_~z~0_296) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_139| 0)) (= (ite .cse0 0 v_~z$w_buff0_used~0_387) v_~z$w_buff0_used~0_386) (= (ite (= 0 (ite (= v_~__unbuffered_cnt~0_295 3) 1 0)) 0 1) v_~main$tmp_guard0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| (mod v_~main$tmp_guard1~0_80 256)) (= v_~z$w_buff1_used~0_343 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_344)) (= v_~z$r_buff1_thd0~0_131 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_343 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd0~0_137 256) 0)))) 0 v_~z$r_buff1_thd0~0_132)) (= v_~z$r_buff0_thd0~0_137 (ite .cse2 0 v_~z$r_buff0_thd0~0_138)) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~x~0_83 2) (= v_~__unbuffered_p2_EAX~0_83 1) (= v_~__unbuffered_p2_EBX~0_97 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| (mod v_~main$tmp_guard0~0_120 256))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_138, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_387, ~z$w_buff0~0=v_~z$w_buff0~0_235, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_344, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_297, ~x~0=v_~x~0_83} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_75|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_386, ~z$w_buff0~0=v_~z$w_buff0~0_235, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_87|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_343, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_131, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_139|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_296, ~x~0=v_~x~0_83, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 03:17:05,519 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] L783-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_15| 0) (= v_~__unbuffered_cnt~0_121 (+ v_~__unbuffered_cnt~0_122 1)) (= |v_P1Thread1of1ForFork0_#res.base_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_15|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_15|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] and [501] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_386 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_132 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_138 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_387 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_344 256) 0)))) (.cse2 (and .cse5 .cse4))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_139|) (= (ite .cse0 v_~z$w_buff0~0_235 (ite .cse1 v_~z$w_buff1~0_201 v_~z~0_297)) v_~z~0_296) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_139| 0)) (= (ite .cse0 0 v_~z$w_buff0_used~0_387) v_~z$w_buff0_used~0_386) (= (ite (= 0 (ite (= v_~__unbuffered_cnt~0_295 3) 1 0)) 0 1) v_~main$tmp_guard0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| (mod v_~main$tmp_guard1~0_80 256)) (= v_~z$w_buff1_used~0_343 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_344)) (= v_~z$r_buff1_thd0~0_131 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_343 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd0~0_137 256) 0)))) 0 v_~z$r_buff1_thd0~0_132)) (= v_~z$r_buff0_thd0~0_137 (ite .cse2 0 v_~z$r_buff0_thd0~0_138)) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~x~0_83 2) (= v_~__unbuffered_p2_EAX~0_83 1) (= v_~__unbuffered_p2_EBX~0_97 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| (mod v_~main$tmp_guard0~0_120 256))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_138, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_387, ~z$w_buff0~0=v_~z$w_buff0~0_235, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_344, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_297, ~x~0=v_~x~0_83} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_75|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_386, ~z$w_buff0~0=v_~z$w_buff0~0_235, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_87|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_343, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_131, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_139|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_296, ~x~0=v_~x~0_83, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 03:17:05,694 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [386] L783-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= |v_P1Thread1of1ForFork0_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] and [501] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_386 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_132 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_138 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_387 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_344 256) 0)))) (.cse2 (and .cse5 .cse4))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_139|) (= (ite .cse0 v_~z$w_buff0~0_235 (ite .cse1 v_~z$w_buff1~0_201 v_~z~0_297)) v_~z~0_296) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_139| 0)) (= (ite .cse0 0 v_~z$w_buff0_used~0_387) v_~z$w_buff0_used~0_386) (= (ite (= 0 (ite (= v_~__unbuffered_cnt~0_295 3) 1 0)) 0 1) v_~main$tmp_guard0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| (mod v_~main$tmp_guard1~0_80 256)) (= v_~z$w_buff1_used~0_343 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_344)) (= v_~z$r_buff1_thd0~0_131 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_343 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd0~0_137 256) 0)))) 0 v_~z$r_buff1_thd0~0_132)) (= v_~z$r_buff0_thd0~0_137 (ite .cse2 0 v_~z$r_buff0_thd0~0_138)) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~x~0_83 2) (= v_~__unbuffered_p2_EAX~0_83 1) (= v_~__unbuffered_p2_EBX~0_97 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| (mod v_~main$tmp_guard0~0_120 256))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_138, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_387, ~z$w_buff0~0=v_~z$w_buff0~0_235, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_344, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_297, ~x~0=v_~x~0_83} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_75|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_386, ~z$w_buff0~0=v_~z$w_buff0~0_235, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_87|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_343, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_131, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_139|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_296, ~x~0=v_~x~0_83, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 03:17:05,900 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [335] L783-->L786: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [501] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_386 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_132 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_138 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_387 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_344 256) 0)))) (.cse2 (and .cse5 .cse4))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_139|) (= (ite .cse0 v_~z$w_buff0~0_235 (ite .cse1 v_~z$w_buff1~0_201 v_~z~0_297)) v_~z~0_296) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_139| 0)) (= (ite .cse0 0 v_~z$w_buff0_used~0_387) v_~z$w_buff0_used~0_386) (= (ite (= 0 (ite (= v_~__unbuffered_cnt~0_295 3) 1 0)) 0 1) v_~main$tmp_guard0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| (mod v_~main$tmp_guard1~0_80 256)) (= v_~z$w_buff1_used~0_343 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_344)) (= v_~z$r_buff1_thd0~0_131 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_343 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd0~0_137 256) 0)))) 0 v_~z$r_buff1_thd0~0_132)) (= v_~z$r_buff0_thd0~0_137 (ite .cse2 0 v_~z$r_buff0_thd0~0_138)) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~x~0_83 2) (= v_~__unbuffered_p2_EAX~0_83 1) (= v_~__unbuffered_p2_EBX~0_97 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| (mod v_~main$tmp_guard0~0_120 256))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_138, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_387, ~z$w_buff0~0=v_~z$w_buff0~0_235, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_344, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_297, ~x~0=v_~x~0_83} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_75|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_386, ~z$w_buff0~0=v_~z$w_buff0~0_235, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_87|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_343, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_131, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_139|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_296, ~x~0=v_~x~0_83, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 03:17:06,071 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] L763-->P0FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_14 1) v_~__unbuffered_cnt~0_13) (= |v_P0Thread1of1ForFork2_#res#1.offset_5| 0) (= |v_P0Thread1of1ForFork2_#res#1.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_5|, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res#1.offset, P0Thread1of1ForFork2_#res#1.base, ~__unbuffered_cnt~0] and [501] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_386 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_132 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_138 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_387 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_344 256) 0)))) (.cse2 (and .cse5 .cse4))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_139|) (= (ite .cse0 v_~z$w_buff0~0_235 (ite .cse1 v_~z$w_buff1~0_201 v_~z~0_297)) v_~z~0_296) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_139| 0)) (= (ite .cse0 0 v_~z$w_buff0_used~0_387) v_~z$w_buff0_used~0_386) (= (ite (= 0 (ite (= v_~__unbuffered_cnt~0_295 3) 1 0)) 0 1) v_~main$tmp_guard0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| (mod v_~main$tmp_guard1~0_80 256)) (= v_~z$w_buff1_used~0_343 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_344)) (= v_~z$r_buff1_thd0~0_131 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_343 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd0~0_137 256) 0)))) 0 v_~z$r_buff1_thd0~0_132)) (= v_~z$r_buff0_thd0~0_137 (ite .cse2 0 v_~z$r_buff0_thd0~0_138)) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~x~0_83 2) (= v_~__unbuffered_p2_EAX~0_83 1) (= v_~__unbuffered_p2_EBX~0_97 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| (mod v_~main$tmp_guard0~0_120 256))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_138, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_387, ~z$w_buff0~0=v_~z$w_buff0~0_235, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_344, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_297, ~x~0=v_~x~0_83} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_75|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_386, ~z$w_buff0~0=v_~z$w_buff0~0_235, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_87|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_343, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_131, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_139|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_296, ~x~0=v_~x~0_83, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 03:17:06,276 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [467] L763-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_177 (+ v_~__unbuffered_cnt~0_178 1)) (= |v_P0Thread1of1ForFork2_#res#1.offset_23| 0) (= |v_P0Thread1of1ForFork2_#res#1.base_23| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_178} OutVars{P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_23|, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res#1.offset, P0Thread1of1ForFork2_#res#1.base, ~__unbuffered_cnt~0] and [501] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_386 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_132 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_138 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_387 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_344 256) 0)))) (.cse2 (and .cse5 .cse4))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_139|) (= (ite .cse0 v_~z$w_buff0~0_235 (ite .cse1 v_~z$w_buff1~0_201 v_~z~0_297)) v_~z~0_296) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_139| 0)) (= (ite .cse0 0 v_~z$w_buff0_used~0_387) v_~z$w_buff0_used~0_386) (= (ite (= 0 (ite (= v_~__unbuffered_cnt~0_295 3) 1 0)) 0 1) v_~main$tmp_guard0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| (mod v_~main$tmp_guard1~0_80 256)) (= v_~z$w_buff1_used~0_343 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_344)) (= v_~z$r_buff1_thd0~0_131 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_343 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd0~0_137 256) 0)))) 0 v_~z$r_buff1_thd0~0_132)) (= v_~z$r_buff0_thd0~0_137 (ite .cse2 0 v_~z$r_buff0_thd0~0_138)) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~x~0_83 2) (= v_~__unbuffered_p2_EAX~0_83 1) (= v_~__unbuffered_p2_EBX~0_97 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| (mod v_~main$tmp_guard0~0_120 256))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_138, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_387, ~z$w_buff0~0=v_~z$w_buff0~0_235, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_344, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_297, ~x~0=v_~x~0_83} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_75|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_386, ~z$w_buff0~0=v_~z$w_buff0~0_235, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_87|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_343, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_131, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_139|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_296, ~x~0=v_~x~0_83, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 03:17:06,466 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [328] L763-->L766: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [501] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_386 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_132 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_138 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_387 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_344 256) 0)))) (.cse2 (and .cse5 .cse4))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_139|) (= (ite .cse0 v_~z$w_buff0~0_235 (ite .cse1 v_~z$w_buff1~0_201 v_~z~0_297)) v_~z~0_296) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_139| 0)) (= (ite .cse0 0 v_~z$w_buff0_used~0_387) v_~z$w_buff0_used~0_386) (= (ite (= 0 (ite (= v_~__unbuffered_cnt~0_295 3) 1 0)) 0 1) v_~main$tmp_guard0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| (mod v_~main$tmp_guard1~0_80 256)) (= v_~z$w_buff1_used~0_343 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_344)) (= v_~z$r_buff1_thd0~0_131 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_343 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd0~0_137 256) 0)))) 0 v_~z$r_buff1_thd0~0_132)) (= v_~z$r_buff0_thd0~0_137 (ite .cse2 0 v_~z$r_buff0_thd0~0_138)) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~x~0_83 2) (= v_~__unbuffered_p2_EAX~0_83 1) (= v_~__unbuffered_p2_EBX~0_97 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| (mod v_~main$tmp_guard0~0_120 256))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_138, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_387, ~z$w_buff0~0=v_~z$w_buff0~0_235, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_344, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_297, ~x~0=v_~x~0_83} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_75|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_386, ~z$w_buff0~0=v_~z$w_buff0~0_235, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_87|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_343, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_131, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_139|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~z~0=v_~z~0_296, ~x~0=v_~x~0_83, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 03:17:06,643 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 03:17:06,644 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2199 [2022-12-13 03:17:06,644 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 157 transitions, 2720 flow [2022-12-13 03:17:06,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 03:17:06,644 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:06,644 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:06,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:17:06,644 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:06,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:06,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1283975155, now seen corresponding path program 1 times [2022-12-13 03:17:06,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:06,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437071619] [2022-12-13 03:17:06,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:06,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:07,146 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 03:17:07,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:07,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437071619] [2022-12-13 03:17:07,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437071619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:07,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:07,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:17:07,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531380412] [2022-12-13 03:17:07,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:07,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:17:07,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:07,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:17:07,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:17:07,148 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2022-12-13 03:17:07,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 157 transitions, 2720 flow. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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 03:17:07,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:07,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2022-12-13 03:17:07,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:07,485 INFO L130 PetriNetUnfolder]: 815/1453 cut-off events. [2022-12-13 03:17:07,485 INFO L131 PetriNetUnfolder]: For 8560/8624 co-relation queries the response was YES. [2022-12-13 03:17:07,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12895 conditions, 1453 events. 815/1453 cut-off events. For 8560/8624 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7754 event pairs, 0 based on Foata normal form. 44/1215 useless extension candidates. Maximal degree in co-relation 12860. Up to 1175 conditions per place. [2022-12-13 03:17:07,492 INFO L137 encePairwiseOnDemand]: 25/38 looper letters, 87 selfloop transitions, 19 changer transitions 101/222 dead transitions. [2022-12-13 03:17:07,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 222 transitions, 4325 flow [2022-12-13 03:17:07,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:17:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:17:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2022-12-13 03:17:07,493 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5570175438596491 [2022-12-13 03:17:07,494 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2022-12-13 03:17:07,494 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 222 transitions, 4325 flow [2022-12-13 03:17:07,498 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 121 transitions, 2269 flow [2022-12-13 03:17:07,514 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:07,514 INFO L89 Accepts]: Start accepts. Operand has 67 places, 121 transitions, 2269 flow [2022-12-13 03:17:07,515 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:07,516 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:07,516 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 121 transitions, 2269 flow [2022-12-13 03:17:07,520 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 121 transitions, 2269 flow [2022-12-13 03:17:07,520 INFO L226 LiptonReduction]: Number of co-enabled transitions 336 [2022-12-13 03:17:07,521 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:07,522 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 03:17:07,522 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 121 transitions, 2269 flow [2022-12-13 03:17:07,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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 03:17:07,522 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:07,522 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:07,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:17:07,522 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:17:07,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:07,523 INFO L85 PathProgramCache]: Analyzing trace with hash 100229711, now seen corresponding path program 1 times [2022-12-13 03:17:07,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:07,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242817431] [2022-12-13 03:17:07,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:07,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 03:17:07,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 03:17:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 03:17:07,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 03:17:07,665 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 03:17:07,666 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 03:17:07,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 03:17:07,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 03:17:07,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 03:17:07,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 03:17:07,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 03:17:07,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 03:17:07,668 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:07,674 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:17:07,674 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:17:07,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:17:07 BasicIcfg [2022-12-13 03:17:07,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:17:07,769 INFO L158 Benchmark]: Toolchain (without parser) took 15731.96ms. Allocated memory was 223.3MB in the beginning and 1.1GB in the end (delta: 856.7MB). Free memory was 198.0MB in the beginning and 511.5MB in the end (delta: -313.5MB). Peak memory consumption was 544.3MB. Max. memory is 8.0GB. [2022-12-13 03:17:07,769 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 223.3MB. Free memory was 199.6MB in the beginning and 199.5MB in the end (delta: 86.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:17:07,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.06ms. Allocated memory is still 223.3MB. Free memory was 197.5MB in the beginning and 171.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 03:17:07,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.16ms. Allocated memory is still 223.3MB. Free memory was 171.3MB in the beginning and 168.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:17:07,771 INFO L158 Benchmark]: Boogie Preprocessor took 29.74ms. Allocated memory is still 223.3MB. Free memory was 168.7MB in the beginning and 167.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:17:07,771 INFO L158 Benchmark]: RCFGBuilder took 533.43ms. Allocated memory is still 223.3MB. Free memory was 167.1MB in the beginning and 132.0MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-13 03:17:07,771 INFO L158 Benchmark]: TraceAbstraction took 14623.52ms. Allocated memory was 223.3MB in the beginning and 1.1GB in the end (delta: 856.7MB). Free memory was 130.4MB in the beginning and 511.5MB in the end (delta: -381.1MB). Peak memory consumption was 476.1MB. Max. memory is 8.0GB. [2022-12-13 03:17:07,773 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 223.3MB. Free memory was 199.6MB in the beginning and 199.5MB in the end (delta: 86.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 487.06ms. Allocated memory is still 223.3MB. Free memory was 197.5MB in the beginning and 171.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.16ms. Allocated memory is still 223.3MB. Free memory was 171.3MB in the beginning and 168.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.74ms. Allocated memory is still 223.3MB. Free memory was 168.7MB in the beginning and 167.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 533.43ms. Allocated memory is still 223.3MB. Free memory was 167.1MB in the beginning and 132.0MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 14623.52ms. Allocated memory was 223.3MB in the beginning and 1.1GB in the end (delta: 856.7MB). Free memory was 130.4MB in the beginning and 511.5MB in the end (delta: -381.1MB). Peak memory consumption was 476.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 113 PlacesBefore, 75 PlacesAfterwards, 105 TransitionsBefore, 66 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 84 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4261, independent: 4137, independent conditional: 4137, independent unconditional: 0, dependent: 124, dependent conditional: 124, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4261, independent: 4137, independent conditional: 0, independent unconditional: 4137, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4261, independent: 4137, independent conditional: 0, independent unconditional: 4137, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4261, independent: 4137, independent conditional: 0, independent unconditional: 4137, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2021, independent: 1976, independent conditional: 0, independent unconditional: 1976, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2021, independent: 1937, independent conditional: 0, independent unconditional: 1937, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 84, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 208, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4261, independent: 2161, independent conditional: 0, independent unconditional: 2161, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 2021, unknown conditional: 0, unknown unconditional: 2021] , Statistics on independence cache: Total cache size (in pairs): 3923, Positive cache size: 3878, Positive conditional cache size: 0, Positive unconditional cache size: 3878, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 45 PlacesBefore, 45 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 46, independent conditional: 9, independent unconditional: 37, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 46, independent conditional: 3, independent unconditional: 43, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 46, independent conditional: 3, independent unconditional: 43, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 29, independent conditional: 2, independent unconditional: 27, 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: 32, independent: 29, independent conditional: 0, independent unconditional: 29, 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: 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] ], Cache Queries: [ total: 50, independent: 17, independent conditional: 1, independent unconditional: 16, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 32, unknown conditional: 2, unknown unconditional: 30] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 29, Positive conditional cache size: 2, Positive unconditional cache size: 27, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 620 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 135, independent: 130, independent conditional: 130, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 135, independent: 130, independent conditional: 65, independent unconditional: 65, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 135, independent: 130, independent conditional: 5, independent unconditional: 125, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 135, independent: 130, independent conditional: 5, independent unconditional: 125, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 135, independent: 116, independent conditional: 5, independent unconditional: 111, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 43, Positive conditional cache size: 2, Positive unconditional cache size: 41, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 65, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 750 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, independent: 162, independent conditional: 162, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 171, independent: 162, independent conditional: 117, independent unconditional: 45, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 180, independent: 162, independent conditional: 0, independent unconditional: 162, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 180, independent: 162, independent conditional: 0, independent unconditional: 162, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 180, independent: 160, independent conditional: 0, independent unconditional: 160, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 45, Positive conditional cache size: 2, Positive unconditional cache size: 43, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 135, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 830 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 190, independent: 180, independent conditional: 180, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 190, independent: 180, independent conditional: 130, independent unconditional: 50, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 200, independent: 180, independent conditional: 0, independent unconditional: 180, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 200, independent: 180, independent conditional: 0, independent unconditional: 180, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 200, independent: 180, independent conditional: 0, independent unconditional: 180, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 45, Positive conditional cache size: 2, Positive unconditional cache size: 43, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 150, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 118 TransitionsBefore, 118 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 45, Positive conditional cache size: 2, Positive unconditional cache size: 43, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 218 TransitionsBefore, 218 TransitionsAfterwards, 632 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 45, Positive conditional cache size: 2, Positive unconditional cache size: 43, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 204 TransitionsBefore, 204 TransitionsAfterwards, 588 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 45, Positive conditional cache size: 2, Positive unconditional cache size: 43, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 66 PlacesBefore, 63 PlacesAfterwards, 160 TransitionsBefore, 157 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 54, Positive conditional cache size: 2, Positive unconditional cache size: 52, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 121 TransitionsBefore, 121 TransitionsAfterwards, 336 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 54, Positive conditional cache size: 2, Positive unconditional cache size: 52, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2281; [L834] FCALL, FORK 0 pthread_create(&t2281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2281, ((void *)0), P0, ((void *)0))=-2, t2281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t2282; [L836] FCALL, FORK 0 pthread_create(&t2282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2282, ((void *)0), P1, ((void *)0))=-1, t2281={5:0}, t2282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t2283; [L838] FCALL, FORK 0 pthread_create(&t2283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2283, ((void *)0), P2, ((void *)0))=0, t2281={5:0}, t2282={6:0}, t2283={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0: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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 z$flush_delayed = weak$$choice2 [L798] 3 z$mem_tmp = z [L799] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L800] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L801] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L802] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L803] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L805] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 __unbuffered_p2_EBX = z [L807] 3 z = z$flush_delayed ? z$mem_tmp : z [L808] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L813] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L815] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L840] 2 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 2 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 2 !(!cond) [L842] RET 2 assume_abort_if_not(main$tmp_guard0) [L844] 2 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L845] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L846] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L847] 2 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L848] 2 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 2 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 838]: 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: 834]: 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: 836]: 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 7 procedures, 135 locations, 6 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: 14.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 439 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 439 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 742 IncrementalHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 4 mSDtfsCounter, 742 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3098occurred in iteration=7, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 477 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 03:17:07,809 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...