/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:57:10,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:57:10,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:57:10,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:57:11,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:57:11,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:57:11,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:57:11,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:57:11,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:57:11,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:57:11,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:57:11,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:57:11,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:57:11,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:57:11,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:57:11,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:57:11,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:57:11,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:57:11,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:57:11,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:57:11,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:57:11,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:57:11,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:57:11,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:57:11,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:57:11,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:57:11,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:57:11,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:57:11,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:57:11,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:57:11,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:57:11,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:57:11,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:57:11,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:57:11,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:57:11,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:57:11,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:57:11,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:57:11,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:57:11,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:57:11,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:57:11,073 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-05 22:57:11,091 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:57:11,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:57:11,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:57:11,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:57:11,093 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:57:11,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:57:11,093 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:57:11,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:57:11,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:57:11,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:57:11,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:57:11,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:57:11,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:57:11,094 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:57:11,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:57:11,094 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:57:11,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:57:11,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:57:11,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:57:11,095 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:57:11,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:57:11,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:57:11,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:57:11,095 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:57:11,095 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:57:11,095 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:57:11,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:57:11,096 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:57:11,096 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 22:57:11,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:57:11,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:57:11,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:57:11,441 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:57:11,442 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:57:11,443 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-12-05 22:57:12,503 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:57:12,779 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:57:12,780 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-12-05 22:57:12,791 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10d6d90c3/1cb2f30cbab842dbb73496a1dcdafc8c/FLAGcee662c61 [2022-12-05 22:57:12,806 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10d6d90c3/1cb2f30cbab842dbb73496a1dcdafc8c [2022-12-05 22:57:12,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:57:12,809 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:57:12,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:57:12,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:57:12,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:57:12,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:57:12" (1/1) ... [2022-12-05 22:57:12,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b9f8365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:12, skipping insertion in model container [2022-12-05 22:57:12,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:57:12" (1/1) ... [2022-12-05 22:57:12,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:57:12,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:57:13,022 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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009] [2022-12-05 22:57:13,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:57:13,270 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:57:13,282 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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009] [2022-12-05 22:57:13,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:13,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:13,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:57:13,397 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:57:13,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:13 WrapperNode [2022-12-05 22:57:13,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:57:13,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:57:13,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:57:13,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:57:13,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:13" (1/1) ... [2022-12-05 22:57:13,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:13" (1/1) ... [2022-12-05 22:57:13,464 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-05 22:57:13,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:57:13,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:57:13,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:57:13,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:57:13,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:13" (1/1) ... [2022-12-05 22:57:13,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:13" (1/1) ... [2022-12-05 22:57:13,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:13" (1/1) ... [2022-12-05 22:57:13,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:13" (1/1) ... [2022-12-05 22:57:13,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:13" (1/1) ... [2022-12-05 22:57:13,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:13" (1/1) ... [2022-12-05 22:57:13,507 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:13" (1/1) ... [2022-12-05 22:57:13,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:13" (1/1) ... [2022-12-05 22:57:13,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:57:13,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:57:13,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:57:13,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:57:13,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:13" (1/1) ... [2022-12-05 22:57:13,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:57:13,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:57:13,556 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-05 22:57:13,582 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-05 22:57:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:57:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:57:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:57:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:57:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:57:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 22:57:13,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 22:57:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 22:57:13,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 22:57:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 22:57:13,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 22:57:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:57:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:57:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:57:13,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:57:13,603 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 22:57:13,803 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:57:13,805 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:57:14,157 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:57:14,272 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:57:14,272 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 22:57:14,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:57:14 BoogieIcfgContainer [2022-12-05 22:57:14,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:57:14,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:57:14,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:57:14,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:57:14,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:57:12" (1/3) ... [2022-12-05 22:57:14,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509376df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:57:14, skipping insertion in model container [2022-12-05 22:57:14,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:13" (2/3) ... [2022-12-05 22:57:14,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509376df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:57:14, skipping insertion in model container [2022-12-05 22:57:14,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:57:14" (3/3) ... [2022-12-05 22:57:14,283 INFO L112 eAbstractionObserver]: Analyzing ICFG mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-12-05 22:57:14,298 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:57:14,298 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 22:57:14,298 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:57:14,353 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:57:14,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-05 22:57:14,441 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-05 22:57:14,442 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:57:14,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-05 22:57:14,449 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-05 22:57:14,454 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-05 22:57:14,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:57:14,478 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-05 22:57:14,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2022-12-05 22:57:14,524 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-05 22:57:14,524 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:57:14,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-05 22:57:14,529 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-05 22:57:14,529 INFO L188 LiptonReduction]: Number of co-enabled transitions 2008 [2022-12-05 22:57:18,928 INFO L203 LiptonReduction]: Total number of compositions: 83 [2022-12-05 22:57:18,941 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:57:18,946 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;@772e1ce4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:57:18,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 22:57:18,948 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 22:57:18,948 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:57:18,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:57:18,949 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 22:57:18,949 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-05 22:57:18,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:57:18,953 INFO L85 PathProgramCache]: Analyzing trace with hash 471579, now seen corresponding path program 1 times [2022-12-05 22:57:18,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:57:18,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021398137] [2022-12-05 22:57:18,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:57:18,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:57:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:57:19,298 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-05 22:57:19,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:57:19,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021398137] [2022-12-05 22:57:19,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021398137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:57:19,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:57:19,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:57:19,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435077779] [2022-12-05 22:57:19,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:57:19,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:57:19,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:57:19,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:57:19,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:57:19,325 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-05 22:57:19,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:57:19,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:57:19,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-05 22:57:19,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:57:19,646 INFO L130 PetriNetUnfolder]: 1106/1788 cut-off events. [2022-12-05 22:57:19,647 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-05 22:57:19,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3482 conditions, 1788 events. 1106/1788 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9891 event pairs, 176 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 3471. Up to 1336 conditions per place. [2022-12-05 22:57:19,662 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 31 selfloop transitions, 2 changer transitions 8/44 dead transitions. [2022-12-05 22:57:19,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 185 flow [2022-12-05 22:57:19,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:57:19,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:57:19,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-05 22:57:19,672 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2022-12-05 22:57:19,674 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 55 transitions. [2022-12-05 22:57:19,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 185 flow [2022-12-05 22:57:19,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 22:57:19,677 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 54 flow [2022-12-05 22:57:19,679 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-05 22:57:19,682 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-05 22:57:19,682 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:57:19,683 INFO L89 Accepts]: Start accepts. Operand has 35 places, 22 transitions, 54 flow [2022-12-05 22:57:19,685 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:57:19,685 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:57:19,686 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 54 flow [2022-12-05 22:57:19,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 54 flow [2022-12-05 22:57:19,691 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-05 22:57:19,691 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:57:19,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 22:57:19,692 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 54 flow [2022-12-05 22:57:19,692 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-05 22:57:19,812 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:57:19,814 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-05 22:57:19,814 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2022-12-05 22:57:19,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:57:19,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:57:19,814 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:57:19,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:57:19,815 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-05 22:57:19,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:57:19,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1553387902, now seen corresponding path program 1 times [2022-12-05 22:57:19,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:57:19,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184064825] [2022-12-05 22:57:19,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:57:19,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:57:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:57:20,019 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-05 22:57:20,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:57:20,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184064825] [2022-12-05 22:57:20,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184064825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:57:20,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:57:20,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:57:20,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292344490] [2022-12-05 22:57:20,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:57:20,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:57:20,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:57:20,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:57:20,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:57:20,022 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-05 22:57:20,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-05 22:57:20,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:57:20,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-05 22:57:20,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:57:20,423 INFO L130 PetriNetUnfolder]: 1991/2996 cut-off events. [2022-12-05 22:57:20,423 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-05 22:57:20,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6263 conditions, 2996 events. 1991/2996 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14282 event pairs, 629 based on Foata normal form. 94/3090 useless extension candidates. Maximal degree in co-relation 6253. Up to 2008 conditions per place. [2022-12-05 22:57:20,436 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 35 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2022-12-05 22:57:20,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 41 transitions, 180 flow [2022-12-05 22:57:20,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:57:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:57:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-05 22:57:20,438 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-05 22:57:20,438 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 42 transitions. [2022-12-05 22:57:20,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 41 transitions, 180 flow [2022-12-05 22:57:20,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:57:20,439 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 96 flow [2022-12-05 22:57:20,440 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2022-12-05 22:57:20,440 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2022-12-05 22:57:20,440 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:57:20,441 INFO L89 Accepts]: Start accepts. Operand has 33 places, 27 transitions, 96 flow [2022-12-05 22:57:20,441 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:57:20,441 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:57:20,441 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 27 transitions, 96 flow [2022-12-05 22:57:20,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 96 flow [2022-12-05 22:57:20,458 INFO L130 PetriNetUnfolder]: 38/145 cut-off events. [2022-12-05 22:57:20,458 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-05 22:57:20,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 145 events. 38/145 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 725 event pairs, 16 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 262. Up to 67 conditions per place. [2022-12-05 22:57:20,460 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 96 flow [2022-12-05 22:57:20,460 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-05 22:57:20,523 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:57:20,524 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-05 22:57:20,525 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 96 flow [2022-12-05 22:57:20,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-05 22:57:20,526 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:57:20,526 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:57:20,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 22:57:20,526 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-05 22:57:20,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:57:20,527 INFO L85 PathProgramCache]: Analyzing trace with hash 910384443, now seen corresponding path program 1 times [2022-12-05 22:57:20,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:57:20,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115393669] [2022-12-05 22:57:20,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:57:20,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:57:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:57:20,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:57:20,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:57:20,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115393669] [2022-12-05 22:57:20,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115393669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:57:20,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:57:20,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:57:20,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609764583] [2022-12-05 22:57:20,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:57:20,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:57:20,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:57:20,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:57:20,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:57:20,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-05 22:57:20,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:57:20,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:57:20,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-05 22:57:20,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:57:20,970 INFO L130 PetriNetUnfolder]: 1543/2401 cut-off events. [2022-12-05 22:57:20,970 INFO L131 PetriNetUnfolder]: For 602/614 co-relation queries the response was YES. [2022-12-05 22:57:20,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5580 conditions, 2401 events. 1543/2401 cut-off events. For 602/614 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11764 event pairs, 496 based on Foata normal form. 39/2420 useless extension candidates. Maximal degree in co-relation 5568. Up to 1677 conditions per place. [2022-12-05 22:57:20,984 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 28 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-05 22:57:20,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 174 flow [2022-12-05 22:57:20,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:57:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:57:20,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-05 22:57:20,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2022-12-05 22:57:20,987 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 96 flow. Second operand 3 states and 35 transitions. [2022-12-05 22:57:20,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 174 flow [2022-12-05 22:57:20,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:57:20,994 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2022-12-05 22:57:20,995 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-05 22:57:20,996 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2022-12-05 22:57:20,996 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:57:20,996 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 95 flow [2022-12-05 22:57:20,997 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:57:20,997 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:57:20,997 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 95 flow [2022-12-05 22:57:20,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 95 flow [2022-12-05 22:57:21,009 INFO L130 PetriNetUnfolder]: 26/106 cut-off events. [2022-12-05 22:57:21,009 INFO L131 PetriNetUnfolder]: For 7/10 co-relation queries the response was YES. [2022-12-05 22:57:21,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 106 events. 26/106 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 437 event pairs, 4 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 188. Up to 49 conditions per place. [2022-12-05 22:57:21,010 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 27 transitions, 95 flow [2022-12-05 22:57:21,010 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-05 22:57:21,023 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:57:21,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-05 22:57:21,024 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2022-12-05 22:57:21,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:57:21,025 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:57:21,025 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:57:21,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 22:57:21,025 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-05 22:57:21,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:57:21,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1842106595, now seen corresponding path program 1 times [2022-12-05 22:57:21,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:57:21,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117464422] [2022-12-05 22:57:21,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:57:21,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:57:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:57:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:57:21,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:57:21,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117464422] [2022-12-05 22:57:21,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117464422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:57:21,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:57:21,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:57:21,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827264407] [2022-12-05 22:57:21,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:57:21,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:57:21,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:57:21,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:57:21,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:57:21,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-05 22:57:21,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:57:21,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:57:21,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-05 22:57:21,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:57:21,444 INFO L130 PetriNetUnfolder]: 990/1705 cut-off events. [2022-12-05 22:57:21,444 INFO L131 PetriNetUnfolder]: For 242/292 co-relation queries the response was YES. [2022-12-05 22:57:21,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3839 conditions, 1705 events. 990/1705 cut-off events. For 242/292 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9458 event pairs, 172 based on Foata normal form. 176/1865 useless extension candidates. Maximal degree in co-relation 3826. Up to 957 conditions per place. [2022-12-05 22:57:21,454 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 54 selfloop transitions, 8 changer transitions 0/68 dead transitions. [2022-12-05 22:57:21,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 68 transitions, 329 flow [2022-12-05 22:57:21,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:57:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:57:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-05 22:57:21,456 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6454545454545455 [2022-12-05 22:57:21,457 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 5 states and 71 transitions. [2022-12-05 22:57:21,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 68 transitions, 329 flow [2022-12-05 22:57:21,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 68 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:57:21,461 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 149 flow [2022-12-05 22:57:21,461 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2022-12-05 22:57:21,463 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2022-12-05 22:57:21,463 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:57:21,463 INFO L89 Accepts]: Start accepts. Operand has 39 places, 34 transitions, 149 flow [2022-12-05 22:57:21,465 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:57:21,465 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:57:21,465 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 149 flow [2022-12-05 22:57:21,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 149 flow [2022-12-05 22:57:21,497 INFO L130 PetriNetUnfolder]: 118/309 cut-off events. [2022-12-05 22:57:21,497 INFO L131 PetriNetUnfolder]: For 169/249 co-relation queries the response was YES. [2022-12-05 22:57:21,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 309 events. 118/309 cut-off events. For 169/249 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 1897 event pairs, 45 based on Foata normal form. 4/285 useless extension candidates. Maximal degree in co-relation 794. Up to 167 conditions per place. [2022-12-05 22:57:21,500 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 34 transitions, 149 flow [2022-12-05 22:57:21,500 INFO L188 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-05 22:57:21,603 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:57:21,611 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-05 22:57:21,611 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 143 flow [2022-12-05 22:57:21,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:57:21,611 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:57:21,611 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:57:21,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 22:57:21,612 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-05 22:57:21,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:57:21,612 INFO L85 PathProgramCache]: Analyzing trace with hash 643902162, now seen corresponding path program 1 times [2022-12-05 22:57:21,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:57:21,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965868615] [2022-12-05 22:57:21,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:57:21,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:57:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:57:21,836 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-05 22:57:21,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:57:21,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965868615] [2022-12-05 22:57:21,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965868615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:57:21,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:57:21,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:57:21,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143637135] [2022-12-05 22:57:21,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:57:21,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:57:21,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:57:21,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:57:21,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:57:21,839 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-05 22:57:21,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-05 22:57:21,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:57:21,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-05 22:57:21,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:57:22,078 INFO L130 PetriNetUnfolder]: 482/913 cut-off events. [2022-12-05 22:57:22,078 INFO L131 PetriNetUnfolder]: For 382/406 co-relation queries the response was YES. [2022-12-05 22:57:22,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2637 conditions, 913 events. 482/913 cut-off events. For 382/406 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4705 event pairs, 106 based on Foata normal form. 100/1007 useless extension candidates. Maximal degree in co-relation 2621. Up to 319 conditions per place. [2022-12-05 22:57:22,083 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 54 selfloop transitions, 11 changer transitions 11/82 dead transitions. [2022-12-05 22:57:22,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 82 transitions, 457 flow [2022-12-05 22:57:22,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:57:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:57:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-12-05 22:57:22,094 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2022-12-05 22:57:22,094 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 143 flow. Second operand 6 states and 86 transitions. [2022-12-05 22:57:22,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 82 transitions, 457 flow [2022-12-05 22:57:22,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 82 transitions, 451 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 22:57:22,100 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 207 flow [2022-12-05 22:57:22,100 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2022-12-05 22:57:22,103 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-05 22:57:22,103 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:57:22,103 INFO L89 Accepts]: Start accepts. Operand has 43 places, 37 transitions, 207 flow [2022-12-05 22:57:22,104 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:57:22,104 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:57:22,104 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 37 transitions, 207 flow [2022-12-05 22:57:22,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 207 flow [2022-12-05 22:57:22,123 INFO L130 PetriNetUnfolder]: 55/188 cut-off events. [2022-12-05 22:57:22,123 INFO L131 PetriNetUnfolder]: For 286/340 co-relation queries the response was YES. [2022-12-05 22:57:22,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 188 events. 55/188 cut-off events. For 286/340 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 974 event pairs, 6 based on Foata normal form. 1/185 useless extension candidates. Maximal degree in co-relation 620. Up to 106 conditions per place. [2022-12-05 22:57:22,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 37 transitions, 207 flow [2022-12-05 22:57:22,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 406 [2022-12-05 22:57:22,130 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] L843-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_24 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_53) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_24 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_11|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [406] L821-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P2Thread1of1ForFork2_#res.base_9| 0) (= |v_P2Thread1of1ForFork2_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] [2022-12-05 22:57:22,162 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] L843-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_24 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_53) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_24 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_11|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [402] L785-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-05 22:57:22,193 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] L843-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_24 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_53) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_24 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_11|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [444] L765-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res#1.base_7| 0) (= |v_P0Thread1of1ForFork0_#res#1.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} OutVars{P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_7|, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, P0Thread1of1ForFork0_#res#1.base, ~__unbuffered_cnt~0] [2022-12-05 22:57:22,227 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:57:22,228 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-05 22:57:22,228 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 211 flow [2022-12-05 22:57:22,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-05 22:57:22,228 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:57:22,228 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:57:22,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 22:57:22,229 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-05 22:57:22,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:57:22,229 INFO L85 PathProgramCache]: Analyzing trace with hash -265504679, now seen corresponding path program 1 times [2022-12-05 22:57:22,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:57:22,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334925355] [2022-12-05 22:57:22,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:57:22,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:57:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:57:22,872 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-05 22:57:22,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:57:22,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334925355] [2022-12-05 22:57:22,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334925355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:57:22,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:57:22,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:57:22,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628808874] [2022-12-05 22:57:22,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:57:22,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:57:22,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:57:22,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:57:22,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:57:22,875 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 22:57:22,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 211 flow. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:57:22,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:57:22,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 22:57:22,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:57:23,357 INFO L130 PetriNetUnfolder]: 736/1318 cut-off events. [2022-12-05 22:57:23,357 INFO L131 PetriNetUnfolder]: For 2817/2817 co-relation queries the response was YES. [2022-12-05 22:57:23,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4831 conditions, 1318 events. 736/1318 cut-off events. For 2817/2817 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6734 event pairs, 13 based on Foata normal form. 8/1326 useless extension candidates. Maximal degree in co-relation 4812. Up to 461 conditions per place. [2022-12-05 22:57:23,364 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 113 selfloop transitions, 29 changer transitions 39/181 dead transitions. [2022-12-05 22:57:23,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 181 transitions, 1481 flow [2022-12-05 22:57:23,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 22:57:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 22:57:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2022-12-05 22:57:23,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-05 22:57:23,367 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 211 flow. Second operand 9 states and 150 transitions. [2022-12-05 22:57:23,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 181 transitions, 1481 flow [2022-12-05 22:57:23,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 181 transitions, 1244 flow, removed 108 selfloop flow, removed 2 redundant places. [2022-12-05 22:57:23,394 INFO L231 Difference]: Finished difference. Result has 53 places, 55 transitions, 353 flow [2022-12-05 22:57:23,394 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=353, PETRI_PLACES=53, PETRI_TRANSITIONS=55} [2022-12-05 22:57:23,396 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-12-05 22:57:23,396 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:57:23,396 INFO L89 Accepts]: Start accepts. Operand has 53 places, 55 transitions, 353 flow [2022-12-05 22:57:23,397 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:57:23,398 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:57:23,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 55 transitions, 353 flow [2022-12-05 22:57:23,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 55 transitions, 353 flow [2022-12-05 22:57:23,437 INFO L130 PetriNetUnfolder]: 129/358 cut-off events. [2022-12-05 22:57:23,437 INFO L131 PetriNetUnfolder]: For 688/706 co-relation queries the response was YES. [2022-12-05 22:57:23,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 358 events. 129/358 cut-off events. For 688/706 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1953 event pairs, 9 based on Foata normal form. 2/351 useless extension candidates. Maximal degree in co-relation 1214. Up to 96 conditions per place. [2022-12-05 22:57:23,440 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 55 transitions, 353 flow [2022-12-05 22:57:23,441 INFO L188 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-05 22:57:23,569 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:57:23,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-05 22:57:23,570 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 54 transitions, 347 flow [2022-12-05 22:57:23,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:57:23,570 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:57:23,570 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:57:23,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 22:57:23,570 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-05 22:57:23,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:57:23,571 INFO L85 PathProgramCache]: Analyzing trace with hash -39815311, now seen corresponding path program 2 times [2022-12-05 22:57:23,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:57:23,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964387051] [2022-12-05 22:57:23,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:57:23,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:57:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:57:23,760 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-05 22:57:23,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:57:23,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964387051] [2022-12-05 22:57:23,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964387051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:57:23,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:57:23,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 22:57:23,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937790371] [2022-12-05 22:57:23,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:57:23,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:57:23,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:57:23,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:57:23,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:57:23,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-05 22:57:23,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 54 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-05 22:57:23,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:57:23,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-05 22:57:23,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:57:23,979 INFO L130 PetriNetUnfolder]: 408/798 cut-off events. [2022-12-05 22:57:23,979 INFO L131 PetriNetUnfolder]: For 1601/1663 co-relation queries the response was YES. [2022-12-05 22:57:23,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2938 conditions, 798 events. 408/798 cut-off events. For 1601/1663 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4129 event pairs, 74 based on Foata normal form. 79/868 useless extension candidates. Maximal degree in co-relation 2914. Up to 290 conditions per place. [2022-12-05 22:57:23,984 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 68 selfloop transitions, 11 changer transitions 16/107 dead transitions. [2022-12-05 22:57:23,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 107 transitions, 811 flow [2022-12-05 22:57:23,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 22:57:23,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 22:57:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-12-05 22:57:23,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4968944099378882 [2022-12-05 22:57:23,986 INFO L175 Difference]: Start difference. First operand has 52 places, 54 transitions, 347 flow. Second operand 7 states and 80 transitions. [2022-12-05 22:57:23,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 107 transitions, 811 flow [2022-12-05 22:57:23,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 107 transitions, 751 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-05 22:57:23,992 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 339 flow [2022-12-05 22:57:23,992 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=339, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2022-12-05 22:57:23,993 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2022-12-05 22:57:23,993 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:57:23,993 INFO L89 Accepts]: Start accepts. Operand has 57 places, 53 transitions, 339 flow [2022-12-05 22:57:23,994 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:57:23,994 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:57:23,994 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 53 transitions, 339 flow [2022-12-05 22:57:23,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 53 transitions, 339 flow [2022-12-05 22:57:24,022 INFO L130 PetriNetUnfolder]: 91/285 cut-off events. [2022-12-05 22:57:24,022 INFO L131 PetriNetUnfolder]: For 463/470 co-relation queries the response was YES. [2022-12-05 22:57:24,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 285 events. 91/285 cut-off events. For 463/470 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1574 event pairs, 2 based on Foata normal form. 3/283 useless extension candidates. Maximal degree in co-relation 976. Up to 77 conditions per place. [2022-12-05 22:57:24,025 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 53 transitions, 339 flow [2022-12-05 22:57:24,025 INFO L188 LiptonReduction]: Number of co-enabled transitions 396 [2022-12-05 22:57:24,334 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:57:24,334 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 341 [2022-12-05 22:57:24,335 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 339 flow [2022-12-05 22:57:24,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-05 22:57:24,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:57:24,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:57:24,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 22:57:24,335 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-05 22:57:24,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:57:24,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2027658107, now seen corresponding path program 1 times [2022-12-05 22:57:24,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:57:24,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376793840] [2022-12-05 22:57:24,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:57:24,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:57:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:57:24,568 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-05 22:57:24,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:57:24,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376793840] [2022-12-05 22:57:24,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376793840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:57:24,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:57:24,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:57:24,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767310130] [2022-12-05 22:57:24,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:57:24,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:57:24,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:57:24,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:57:24,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:57:24,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-05 22:57:24,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 339 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:57:24,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:57:24,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-05 22:57:24,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:57:24,771 INFO L130 PetriNetUnfolder]: 609/1178 cut-off events. [2022-12-05 22:57:24,771 INFO L131 PetriNetUnfolder]: For 2610/2639 co-relation queries the response was YES. [2022-12-05 22:57:24,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4629 conditions, 1178 events. 609/1178 cut-off events. For 2610/2639 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6437 event pairs, 147 based on Foata normal form. 22/1199 useless extension candidates. Maximal degree in co-relation 4604. Up to 523 conditions per place. [2022-12-05 22:57:24,778 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 44 selfloop transitions, 1 changer transitions 45/96 dead transitions. [2022-12-05 22:57:24,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 96 transitions, 784 flow [2022-12-05 22:57:24,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:57:24,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:57:24,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-05 22:57:24,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5795454545454546 [2022-12-05 22:57:24,779 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 339 flow. Second operand 4 states and 51 transitions. [2022-12-05 22:57:24,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 96 transitions, 784 flow [2022-12-05 22:57:24,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 96 transitions, 703 flow, removed 20 selfloop flow, removed 6 redundant places. [2022-12-05 22:57:24,791 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 261 flow [2022-12-05 22:57:24,791 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2022-12-05 22:57:24,792 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2022-12-05 22:57:24,793 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:57:24,793 INFO L89 Accepts]: Start accepts. Operand has 54 places, 45 transitions, 261 flow [2022-12-05 22:57:24,795 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:57:24,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:57:24,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 261 flow [2022-12-05 22:57:24,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 261 flow [2022-12-05 22:57:24,813 INFO L130 PetriNetUnfolder]: 47/171 cut-off events. [2022-12-05 22:57:24,813 INFO L131 PetriNetUnfolder]: For 161/164 co-relation queries the response was YES. [2022-12-05 22:57:24,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 171 events. 47/171 cut-off events. For 161/164 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 838 event pairs, 1 based on Foata normal form. 1/169 useless extension candidates. Maximal degree in co-relation 488. Up to 37 conditions per place. [2022-12-05 22:57:24,815 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 261 flow [2022-12-05 22:57:24,815 INFO L188 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-05 22:57:25,174 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:57:25,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 382 [2022-12-05 22:57:25,175 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 254 flow [2022-12-05 22:57:25,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:57:25,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:57:25,175 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:57:25,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 22:57:25,176 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-05 22:57:25,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:57:25,176 INFO L85 PathProgramCache]: Analyzing trace with hash -959539143, now seen corresponding path program 1 times [2022-12-05 22:57:25,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:57:25,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142623929] [2022-12-05 22:57:25,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:57:25,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:57:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:57:25,371 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-05 22:57:25,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:57:25,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142623929] [2022-12-05 22:57:25,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142623929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:57:25,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:57:25,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:57:25,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396697241] [2022-12-05 22:57:25,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:57:25,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:57:25,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:57:25,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:57:25,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:57:25,373 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 22:57:25,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 254 flow. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:57:25,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:57:25,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 22:57:25,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:57:25,491 INFO L130 PetriNetUnfolder]: 246/478 cut-off events. [2022-12-05 22:57:25,491 INFO L131 PetriNetUnfolder]: For 967/967 co-relation queries the response was YES. [2022-12-05 22:57:25,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1810 conditions, 478 events. 246/478 cut-off events. For 967/967 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2071 event pairs, 49 based on Foata normal form. 1/479 useless extension candidates. Maximal degree in co-relation 1787. Up to 289 conditions per place. [2022-12-05 22:57:25,494 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 37 selfloop transitions, 7 changer transitions 20/64 dead transitions. [2022-12-05 22:57:25,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 484 flow [2022-12-05 22:57:25,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:57:25,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:57:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-05 22:57:25,495 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4875 [2022-12-05 22:57:25,495 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 254 flow. Second operand 4 states and 39 transitions. [2022-12-05 22:57:25,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 484 flow [2022-12-05 22:57:25,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 457 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-05 22:57:25,500 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 201 flow [2022-12-05 22:57:25,500 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2022-12-05 22:57:25,501 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2022-12-05 22:57:25,501 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:57:25,501 INFO L89 Accepts]: Start accepts. Operand has 49 places, 33 transitions, 201 flow [2022-12-05 22:57:25,504 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:57:25,504 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:57:25,504 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 33 transitions, 201 flow [2022-12-05 22:57:25,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 33 transitions, 201 flow [2022-12-05 22:57:25,512 INFO L130 PetriNetUnfolder]: 14/56 cut-off events. [2022-12-05 22:57:25,512 INFO L131 PetriNetUnfolder]: For 106/116 co-relation queries the response was YES. [2022-12-05 22:57:25,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 56 events. 14/56 cut-off events. For 106/116 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 148 event pairs, 1 based on Foata normal form. 6/62 useless extension candidates. Maximal degree in co-relation 164. Up to 14 conditions per place. [2022-12-05 22:57:25,513 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 33 transitions, 201 flow [2022-12-05 22:57:25,513 INFO L188 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-05 22:57:26,016 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [460] $Ultimate##0-->L778: Formula: (and (= v_~y~0_118 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_15| v_P1Thread1of1ForFork1_~arg.offset_15) (= v_~x~0_49 1) (= v_P1Thread1of1ForFork1_~arg.base_15 |v_P1Thread1of1ForFork1_#in~arg.base_15|)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_15|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_15|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_15, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_15|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_15|, ~y~0=v_~y~0_118, ~x~0=v_~x~0_49} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~y~0, ~x~0] and [331] L758-->L765: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_131 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_29 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff1_used~0_117 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_132 256) 0)))) (.cse1 (and .cse5 .cse4))) (and (= v_~z$w_buff1_used~0_116 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_117)) (= (ite .cse2 v_~z$w_buff0~0_49 (ite .cse0 v_~z$w_buff1~0_50 v_~z~0_71)) v_~z~0_70) (= v_~z$r_buff1_thd1~0_19 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_116 256) 0))) (and (not (= (mod v_~z$r_buff0_thd1~0_28 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_20)) (= (ite .cse2 0 v_~z$w_buff0_used~0_132) v_~z$w_buff0_used~0_131) (= v_~z$r_buff0_thd1~0_28 (ite .cse1 0 v_~z$r_buff0_thd1~0_29))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_117, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_71, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_116, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_70, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0] [2022-12-05 22:57:26,227 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [460] $Ultimate##0-->L778: Formula: (and (= v_~y~0_118 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_15| v_P1Thread1of1ForFork1_~arg.offset_15) (= v_~x~0_49 1) (= v_P1Thread1of1ForFork1_~arg.base_15 |v_P1Thread1of1ForFork1_#in~arg.base_15|)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_15|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_15|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_15, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_15|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_15|, ~y~0=v_~y~0_118, ~x~0=v_~x~0_49} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~y~0, ~x~0] and [427] $Ultimate##0-->L795: Formula: (and (= v_P2Thread1of1ForFork2_~arg.base_5 |v_P2Thread1of1ForFork2_#in~arg.base_5|) (= |v_P2Thread1of1ForFork2_#in~arg.offset_5| v_P2Thread1of1ForFork2_~arg.offset_5) (= v_~y~0_57 2)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_5, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_5, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_57} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~y~0] [2022-12-05 22:57:26,273 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [462] $Ultimate##0-->L758: Formula: (and (= v_~x~0_51 v_~__unbuffered_p0_EAX~0_88) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_74| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_74|) (= v_~z$w_buff0~0_307 v_~z$w_buff1~0_253) (= v_~z$w_buff0~0_306 1) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_74| 0)) (= v_~z$w_buff0_used~0_533 1) (= v_~z$r_buff0_thd1~0_198 1) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_473 256) 0)) (not (= (mod v_~z$w_buff0_used~0_533 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_74|) (= v_~z$w_buff0_used~0_534 v_~z$w_buff1_used~0_473) (= v_~z$r_buff0_thd3~0_248 v_~z$r_buff1_thd3~0_249) (= v_~z$r_buff0_thd2~0_150 v_~z$r_buff1_thd2~0_161) (= |v_P0Thread1of1ForFork0_~arg#1.base_68| |v_P0Thread1of1ForFork0_#in~arg#1.base_68|) (= v_~z$r_buff0_thd0~0_189 v_~z$r_buff1_thd0~0_185) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_68| |v_P0Thread1of1ForFork0_~arg#1.offset_68|) (= v_~z$r_buff0_thd1~0_199 v_~z$r_buff1_thd1~0_134)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_189, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_68|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_534, ~z$w_buff0~0=v_~z$w_buff0~0_307, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_68|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_248, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_199, ~x~0=v_~x~0_51, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_150} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_68|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_533, ~z$w_buff0~0=v_~z$w_buff0~0_306, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_249, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_161, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_68|, ~z$w_buff1~0=v_~z$w_buff1~0_253, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_68|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_189, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_185, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_74|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_134, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_248, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_198, ~x~0=v_~x~0_51, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_74|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_150} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0_~arg#1.base, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~z$r_buff1_thd0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] and [466] $Ultimate##0-->L765: Formula: (let ((.cse3 (not (= 0 (mod v_~z$r_buff1_thd1~0_145 256)))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_553 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_211 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_554 256) 0)))) (.cse4 (and .cse2 .cse5)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_492 256) 0))))) (and (= v_P1Thread1of1ForFork1_~arg.base_17 |v_P1Thread1of1ForFork1_#in~arg.base_17|) (= v_~z~0_408 (ite .cse0 v_~z$w_buff0~0_320 (ite .cse1 v_~z$w_buff1~0_265 v_~z~0_409))) (= v_~x~0_53 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_17| v_P1Thread1of1ForFork1_~arg.offset_17) (= v_~z$r_buff1_thd1~0_144 (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd1~0_210 256) 0))) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_491 256) 0)))) 0 v_~z$r_buff1_thd1~0_145)) (= (ite .cse4 0 v_~z$r_buff0_thd1~0_211) v_~z$r_buff0_thd1~0_210) (= v_~y~0_130 1) (= v_~z$w_buff0_used~0_553 (ite .cse0 0 v_~z$w_buff0_used~0_554)) (= v_~z$w_buff1_used~0_491 (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_492))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_554, ~z$w_buff0~0=v_~z$w_buff0~0_320, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_145, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_492, ~z$w_buff1~0=v_~z$w_buff1~0_265, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~z~0=v_~z~0_409, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_211} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_553, ~z$w_buff0~0=v_~z$w_buff0~0_320, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_491, ~z$w_buff1~0=v_~z$w_buff1~0_265, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_144, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~z~0=v_~z~0_408, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_210, ~y~0=v_~y~0_130, ~x~0=v_~x~0_53} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, ~z$w_buff0_used~0, P1Thread1of1ForFork1_~arg.base, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0, ~y~0, ~x~0] [2022-12-05 22:57:26,478 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 22:57:26,479 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 978 [2022-12-05 22:57:26,479 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 211 flow [2022-12-05 22:57:26,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:57:26,479 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:57:26,479 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:57:26,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 22:57:26,479 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-05 22:57:26,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:57:26,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1773708803, now seen corresponding path program 1 times [2022-12-05 22:57:26,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:57:26,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530516623] [2022-12-05 22:57:26,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:57:26,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:57:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:57:27,165 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-05 22:57:27,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:57:27,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530516623] [2022-12-05 22:57:27,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530516623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:57:27,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:57:27,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 22:57:27,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351182355] [2022-12-05 22:57:27,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:57:27,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:57:27,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:57:27,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:57:27,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:57:27,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-05 22:57:27,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 211 flow. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:57:27,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:57:27,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-05 22:57:27,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:57:27,419 INFO L130 PetriNetUnfolder]: 108/210 cut-off events. [2022-12-05 22:57:27,419 INFO L131 PetriNetUnfolder]: For 500/500 co-relation queries the response was YES. [2022-12-05 22:57:27,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 210 events. 108/210 cut-off events. For 500/500 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 701 event pairs, 10 based on Foata normal form. 1/211 useless extension candidates. Maximal degree in co-relation 817. Up to 85 conditions per place. [2022-12-05 22:57:27,420 INFO L137 encePairwiseOnDemand]: 11/22 looper letters, 32 selfloop transitions, 7 changer transitions 24/63 dead transitions. [2022-12-05 22:57:27,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 63 transitions, 480 flow [2022-12-05 22:57:27,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 22:57:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 22:57:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-12-05 22:57:27,422 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2022-12-05 22:57:27,422 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 211 flow. Second operand 7 states and 49 transitions. [2022-12-05 22:57:27,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 63 transitions, 480 flow [2022-12-05 22:57:27,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 423 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-12-05 22:57:27,424 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 159 flow [2022-12-05 22:57:27,425 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2022-12-05 22:57:27,425 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2022-12-05 22:57:27,425 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:57:27,425 INFO L89 Accepts]: Start accepts. Operand has 47 places, 27 transitions, 159 flow [2022-12-05 22:57:27,426 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:57:27,426 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:57:27,426 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 27 transitions, 159 flow [2022-12-05 22:57:27,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 27 transitions, 159 flow [2022-12-05 22:57:27,433 INFO L130 PetriNetUnfolder]: 13/52 cut-off events. [2022-12-05 22:57:27,433 INFO L131 PetriNetUnfolder]: For 101/107 co-relation queries the response was YES. [2022-12-05 22:57:27,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 52 events. 13/52 cut-off events. For 101/107 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 147 event pairs, 0 based on Foata normal form. 4/55 useless extension candidates. Maximal degree in co-relation 150. Up to 16 conditions per place. [2022-12-05 22:57:27,434 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 27 transitions, 159 flow [2022-12-05 22:57:27,434 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-05 22:57:27,809 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [331] L758-->L765: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_131 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_29 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff1_used~0_117 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_132 256) 0)))) (.cse1 (and .cse5 .cse4))) (and (= v_~z$w_buff1_used~0_116 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_117)) (= (ite .cse2 v_~z$w_buff0~0_49 (ite .cse0 v_~z$w_buff1~0_50 v_~z~0_71)) v_~z~0_70) (= v_~z$r_buff1_thd1~0_19 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_116 256) 0))) (and (not (= (mod v_~z$r_buff0_thd1~0_28 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_20)) (= (ite .cse2 0 v_~z$w_buff0_used~0_132) v_~z$w_buff0_used~0_131) (= v_~z$r_buff0_thd1~0_28 (ite .cse1 0 v_~z$r_buff0_thd1~0_29))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_117, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_71, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_116, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_70, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0] and [461] L843-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_511 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_186 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_182 256) 0)))) (let ((.cse1 (and (not (= 0 (mod v_~z$w_buff1_used~0_454 256))) .cse3)) (.cse2 (and (not (= (mod v_~z$w_buff0_used~0_512 256) 0)) .cse5)) (.cse0 (and .cse4 .cse5))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_87|) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_84 0) (= v_~__unbuffered_p2_EBX~0_95 0) (= v_~y~0_120 2) (= 2 v_~__unbuffered_p2_EAX~0_85))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_74) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= v_~main$tmp_guard0~0_62 (ite (= (ite (= v_~__unbuffered_cnt~0_175 3) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_62 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_87|) (= v_~z$w_buff1_used~0_453 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_454)) (= v_~z~0_372 (ite .cse2 v_~z$w_buff0~0_296 (ite .cse1 v_~z$w_buff1~0_243 v_~z~0_373))) (= v_~z$r_buff1_thd0~0_181 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_453 256) 0)) .cse3) (and (not (= (mod v_~z$r_buff0_thd0~0_185 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_182)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| (mod v_~main$tmp_guard1~0_74 256)) (= v_~z$w_buff0_used~0_511 (ite .cse2 0 v_~z$w_buff0_used~0_512)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_61| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_61|) (= v_~z$r_buff0_thd0~0_185 (ite .cse0 0 v_~z$r_buff0_thd0~0_186))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_512, ~z$w_buff0~0=v_~z$w_buff0~0_296, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_454, ~z$w_buff1~0=v_~z$w_buff1~0_243, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_84, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_186, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~z~0=v_~z~0_373, ~y~0=v_~y~0_120} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_61|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_95, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_47|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_511, ~z$w_buff0~0=v_~z$w_buff0~0_296, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_57|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_453, ~z$w_buff1~0=v_~z$w_buff1~0_243, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_74, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_62, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_84, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_185, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_181, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~z~0=v_~z~0_372, ~y~0=v_~y~0_120, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_87|} 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-05 22:57:28,500 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:57:28,501 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1076 [2022-12-05 22:57:28,501 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 25 transitions, 168 flow [2022-12-05 22:57:28,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:57:28,501 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:57:28,501 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:57:28,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 22:57:28,501 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:57:28,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:57:28,502 INFO L85 PathProgramCache]: Analyzing trace with hash -260882925, now seen corresponding path program 1 times [2022-12-05 22:57:28,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:57:28,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072106651] [2022-12-05 22:57:28,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:57:28,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:57:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:57:28,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 22:57:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:57:28,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 22:57:28,626 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 22:57:28,627 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 22:57:28,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 22:57:28,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 22:57:28,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 22:57:28,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 22:57:28,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 22:57:28,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 22:57:28,630 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:57:28,636 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:57:28,636 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:57:28,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:57:28 BasicIcfg [2022-12-05 22:57:28,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:57:28,706 INFO L158 Benchmark]: Toolchain (without parser) took 15896.82ms. Allocated memory was 173.0MB in the beginning and 319.8MB in the end (delta: 146.8MB). Free memory was 147.0MB in the beginning and 234.7MB in the end (delta: -87.7MB). Peak memory consumption was 60.0MB. Max. memory is 8.0GB. [2022-12-05 22:57:28,706 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:57:28,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 587.85ms. Allocated memory is still 173.0MB. Free memory was 147.0MB in the beginning and 120.6MB in the end (delta: 26.4MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 22:57:28,706 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.93ms. Allocated memory is still 173.0MB. Free memory was 120.6MB in the beginning and 118.1MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 22:57:28,707 INFO L158 Benchmark]: Boogie Preprocessor took 45.43ms. Allocated memory is still 173.0MB. Free memory was 118.1MB in the beginning and 116.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:57:28,707 INFO L158 Benchmark]: RCFGBuilder took 764.37ms. Allocated memory is still 173.0MB. Free memory was 116.0MB in the beginning and 129.2MB in the end (delta: -13.3MB). Peak memory consumption was 18.6MB. Max. memory is 8.0GB. [2022-12-05 22:57:28,710 INFO L158 Benchmark]: TraceAbstraction took 14427.42ms. Allocated memory was 173.0MB in the beginning and 319.8MB in the end (delta: 146.8MB). Free memory was 128.2MB in the beginning and 234.7MB in the end (delta: -106.5MB). Peak memory consumption was 40.3MB. Max. memory is 8.0GB. [2022-12-05 22:57:28,712 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.12ms. Allocated memory is still 127.9MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 587.85ms. Allocated memory is still 173.0MB. Free memory was 147.0MB in the beginning and 120.6MB in the end (delta: 26.4MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.93ms. Allocated memory is still 173.0MB. Free memory was 120.6MB in the beginning and 118.1MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.43ms. Allocated memory is still 173.0MB. Free memory was 118.1MB in the beginning and 116.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 764.37ms. Allocated memory is still 173.0MB. Free memory was 116.0MB in the beginning and 129.2MB in the end (delta: -13.3MB). Peak memory consumption was 18.6MB. Max. memory is 8.0GB. * TraceAbstraction took 14427.42ms. Allocated memory was 173.0MB in the beginning and 319.8MB in the end (delta: 146.8MB). Free memory was 128.2MB in the beginning and 234.7MB in the end (delta: -106.5MB). Peak memory consumption was 40.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 115 PlacesBefore, 38 PlacesAfterwards, 107 TransitionsBefore, 29 TransitionsAfterwards, 2008 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1576, independent: 1515, independent conditional: 1515, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1576, independent: 1515, independent conditional: 0, independent unconditional: 1515, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1576, independent: 1515, independent conditional: 0, independent unconditional: 1515, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1576, independent: 1515, independent conditional: 0, independent unconditional: 1515, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1280, independent: 1238, independent conditional: 0, independent unconditional: 1238, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1280, independent: 1224, independent conditional: 0, independent unconditional: 1224, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 207, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1576, independent: 277, independent conditional: 0, independent unconditional: 277, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 1280, unknown conditional: 0, unknown unconditional: 1280] , Statistics on independence cache: Total cache size (in pairs): 1882, Positive cache size: 1840, Positive conditional cache size: 0, Positive unconditional cache size: 1840, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, 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, 31 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 109, independent: 85, independent conditional: 85, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 109, independent: 85, independent conditional: 18, independent unconditional: 67, dependent: 24, dependent conditional: 5, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 109, independent: 85, independent conditional: 18, independent unconditional: 67, dependent: 24, dependent conditional: 5, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 109, independent: 85, independent conditional: 18, independent unconditional: 67, dependent: 24, dependent conditional: 5, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 100, independent: 79, independent conditional: 17, independent unconditional: 62, dependent: 21, dependent conditional: 4, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 100, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 21, dependent conditional: 4, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 116, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 109, dependent conditional: 20, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 109, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 100, unknown conditional: 21, unknown unconditional: 79] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 79, Positive conditional cache size: 17, Positive unconditional cache size: 62, Negative cache size: 21, Negative conditional cache size: 4, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 33 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79, independent: 62, independent conditional: 8, independent unconditional: 54, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 92, Positive conditional cache size: 17, Positive unconditional cache size: 75, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 72, independent conditional: 0, independent unconditional: 72, 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: 90, independent: 72, independent conditional: 0, independent unconditional: 72, 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: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 93, Positive conditional cache size: 17, Positive unconditional cache size: 76, Negative cache size: 29, Negative conditional cache size: 4, Negative unconditional cache size: 25, 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, 39 PlacesBefore, 39 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 63, independent: 27, independent conditional: 15, independent unconditional: 12, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 27, independent conditional: 15, independent unconditional: 12, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 27, independent conditional: 15, independent unconditional: 12, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, independent: 20, independent conditional: 10, independent unconditional: 10, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 11, unknown conditional: 5, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 100, Positive conditional cache size: 22, Positive unconditional cache size: 78, Negative cache size: 33, Negative conditional cache size: 4, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 42 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 406 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 192, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 192, independent: 144, independent conditional: 70, independent unconditional: 74, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 192, independent: 144, independent conditional: 70, independent unconditional: 74, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 192, independent: 144, independent conditional: 70, independent unconditional: 74, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 192, independent: 135, independent conditional: 61, independent unconditional: 74, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 115, Positive conditional cache size: 33, Positive unconditional cache size: 82, Negative cache size: 33, Negative conditional cache size: 4, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 52 PlacesBefore, 52 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 27, independent conditional: 13, independent unconditional: 14, dependent: 22, dependent conditional: 12, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, independent: 27, independent conditional: 8, independent unconditional: 19, dependent: 22, dependent conditional: 12, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, independent: 27, independent conditional: 8, independent unconditional: 19, dependent: 22, dependent conditional: 12, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 5, independent unconditional: 10, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, independent: 12, independent conditional: 3, independent unconditional: 9, dependent: 20, dependent conditional: 10, dependent unconditional: 10, unknown: 17, unknown conditional: 7, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 131, Positive conditional cache size: 38, Positive unconditional cache size: 93, Negative cache size: 35, Negative conditional cache size: 6, Negative unconditional cache size: 29, 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.3s, 56 PlacesBefore, 55 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 16, independent conditional: 8, independent unconditional: 8, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 16, independent conditional: 8, independent unconditional: 8, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 16, independent conditional: 8, independent unconditional: 8, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 15, independent conditional: 8, independent unconditional: 7, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 138, Positive conditional cache size: 38, Positive unconditional cache size: 100, Negative cache size: 35, Negative conditional cache size: 6, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 53 PlacesBefore, 50 PlacesAfterwards, 45 TransitionsBefore, 42 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 113, independent: 103, independent conditional: 103, 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: 113, independent: 103, independent conditional: 90, independent unconditional: 13, 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: 113, independent: 103, independent conditional: 86, independent unconditional: 17, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113, independent: 103, independent conditional: 86, independent unconditional: 17, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 23, independent conditional: 19, independent unconditional: 4, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, independent: 65, independent conditional: 65, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 113, independent: 80, independent conditional: 67, independent unconditional: 13, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 25, unknown conditional: 21, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 182, Positive conditional cache size: 61, Positive unconditional cache size: 121, Negative cache size: 37, Negative conditional cache size: 8, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 48 PlacesBefore, 46 PlacesAfterwards, 33 TransitionsBefore, 31 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 78, independent: 58, independent conditional: 55, independent unconditional: 3, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, independent: 58, independent conditional: 45, independent unconditional: 13, 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: 78, independent: 58, independent conditional: 45, independent unconditional: 13, 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: 14, independent: 11, independent conditional: 9, independent unconditional: 2, 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: 14, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 37, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, independent: 47, independent conditional: 36, independent unconditional: 11, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 14, unknown conditional: 9, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 280, Positive cache size: 240, Positive conditional cache size: 85, Positive unconditional cache size: 155, Negative cache size: 40, Negative conditional cache size: 8, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 45 PlacesBefore, 43 PlacesAfterwards, 27 TransitionsBefore, 25 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 29, independent conditional: 29, 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: 33, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 29, independent conditional: 28, independent unconditional: 1, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 29, independent conditional: 28, independent unconditional: 1, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, independent: 61, independent conditional: 61, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 24, independent conditional: 23, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 298, Positive cache size: 256, Positive conditional cache size: 92, Positive unconditional cache size: 164, Negative cache size: 42, Negative conditional cache size: 10, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t657; [L839] FCALL, FORK 0 pthread_create(&t657, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t657, ((void *)0), P0, ((void *)0))=-1, t657={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] [L840] 0 pthread_t t658; [L841] FCALL, FORK 0 pthread_create(&t658, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t658, ((void *)0), P1, ((void *)0))=0, t657={5:0}, t658={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] [L842] 0 pthread_t t659; [L843] FCALL, FORK 0 pthread_create(&t659, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t659, ((void *)0), P2, ((void *)0))=1, t657={5:0}, t658={6:0}, t659={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] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L774] 2 x = 1 [L777] 2 y = 1 [L794] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, 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] [L797] 3 __unbuffered_p2_EAX = y [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 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) [L805] 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)) [L806] 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)) [L807] 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)) [L808] 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)) [L809] 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)) [L810] 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)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=66, weak$$choice2=255, x=1, y=2, 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] [L760] 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) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 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 [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 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_p0_EAX=0, __unbuffered_p2_EAX=2, __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=66, weak$$choice2=255, x=1, y=2, 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] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L780] 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) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 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 [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=66, weak$$choice2=255, x=1, y=2, 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] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L816] 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) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 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 [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 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 [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 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 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 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 [L856] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=66, weak$$choice2=255, x=1, y=2, 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: 839]: 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: 843]: 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: 841]: 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, 138 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.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 315 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 315 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1054 IncrementalHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 15 mSDtfsCounter, 1054 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=353occurred in iteration=6, InterpolantAutomatonStates: 51, 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.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-05 22:57:28,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...