/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:16:29,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:16:29,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:16:29,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:16:29,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:16:29,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:16:29,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:16:29,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:16:29,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:16:29,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:16:29,243 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:16:29,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:16:29,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:16:29,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:16:29,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:16:29,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:16:29,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:16:29,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:16:29,248 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:16:29,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:16:29,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:16:29,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:16:29,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:16:29,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:16:29,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:16:29,263 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:16:29,263 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:16:29,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:16:29,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:16:29,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:16:29,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:16:29,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:16:29,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:16:29,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:16:29,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:16:29,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:16:29,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:16:29,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:16:29,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:16:29,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:16:29,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:16:29,276 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:16:29,300 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:16:29,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:16:29,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:16:29,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:16:29,302 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:16:29,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:16:29,302 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:16:29,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:16:29,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:16:29,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:16:29,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:16:29,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:16:29,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:16:29,303 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:16:29,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:16:29,303 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:16:29,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:16:29,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:16:29,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:16:29,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:16:29,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:16:29,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:16:29,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:16:29,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:16:29,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:16:29,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:16:29,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:16:29,304 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:16:29,304 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:16:29,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:16:29,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:16:29,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:16:29,583 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:16:29,583 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:16:29,584 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 04:16:30,536 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:16:30,771 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:16:30,771 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 04:16:30,785 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bf0c3a21/ef8be8489f7547d6bcd77b8f05e60f11/FLAG0b5eb00db [2022-12-06 04:16:30,796 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bf0c3a21/ef8be8489f7547d6bcd77b8f05e60f11 [2022-12-06 04:16:30,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:16:30,799 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:16:30,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:16:30,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:16:30,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:16:30,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:16:30" (1/1) ... [2022-12-06 04:16:30,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22bd366a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:30, skipping insertion in model container [2022-12-06 04:16:30,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:16:30" (1/1) ... [2022-12-06 04:16:30,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:16:30,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:16:30,955 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/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-06 04:16:31,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:16:31,164 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:16:31,174 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/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-06 04:16:31,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:31,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:31,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:16:31,263 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:16:31,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:31 WrapperNode [2022-12-06 04:16:31,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:16:31,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:16:31,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:16:31,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:16:31,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:31" (1/1) ... [2022-12-06 04:16:31,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:31" (1/1) ... [2022-12-06 04:16:31,327 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2022-12-06 04:16:31,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:16:31,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:16:31,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:16:31,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:16:31,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:31" (1/1) ... [2022-12-06 04:16:31,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:31" (1/1) ... [2022-12-06 04:16:31,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:31" (1/1) ... [2022-12-06 04:16:31,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:31" (1/1) ... [2022-12-06 04:16:31,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:31" (1/1) ... [2022-12-06 04:16:31,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:31" (1/1) ... [2022-12-06 04:16:31,357 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:31" (1/1) ... [2022-12-06 04:16:31,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:31" (1/1) ... [2022-12-06 04:16:31,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:16:31,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:16:31,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:16:31,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:16:31,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:31" (1/1) ... [2022-12-06 04:16:31,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:16:31,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:16:31,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:16:31,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:16:31,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:16:31,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:16:31,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:16:31,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:16:31,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:16:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:16:31,444 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:16:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:16:31,445 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:16:31,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:16:31,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:16:31,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:16:31,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:16:31,446 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:16:31,605 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:16:31,606 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:16:31,822 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:16:31,934 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:16:31,935 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:16:31,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:16:31 BoogieIcfgContainer [2022-12-06 04:16:31,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:16:31,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:16:31,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:16:31,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:16:31,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:16:30" (1/3) ... [2022-12-06 04:16:31,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4ce250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:16:31, skipping insertion in model container [2022-12-06 04:16:31,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:31" (2/3) ... [2022-12-06 04:16:31,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4ce250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:16:31, skipping insertion in model container [2022-12-06 04:16:31,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:16:31" (3/3) ... [2022-12-06 04:16:31,942 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 04:16:31,956 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:16:31,957 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:16:31,957 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:16:32,007 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:16:32,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2022-12-06 04:16:32,091 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-06 04:16:32,091 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:16:32,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-06 04:16:32,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2022-12-06 04:16:32,102 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2022-12-06 04:16:32,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:32,130 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-06 04:16:32,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2022-12-06 04:16:32,159 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-06 04:16:32,159 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:16:32,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-06 04:16:32,162 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-06 04:16:32,162 INFO L188 LiptonReduction]: Number of co-enabled transitions 1156 [2022-12-06 04:16:36,071 INFO L203 LiptonReduction]: Total number of compositions: 71 [2022-12-06 04:16:36,083 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:16:36,088 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;@37856b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:16:36,088 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 04:16:36,091 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 04:16:36,091 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:16:36,091 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:36,091 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 04:16:36,092 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:16:36,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:36,095 INFO L85 PathProgramCache]: Analyzing trace with hash 396236703, now seen corresponding path program 1 times [2022-12-06 04:16:36,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:36,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006788794] [2022-12-06 04:16:36,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:36,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:36,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:36,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006788794] [2022-12-06 04:16:36,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006788794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:36,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:36,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:16:36,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344847839] [2022-12-06 04:16:36,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:36,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:16:36,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:36,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:16:36,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:16:36,467 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:16:36,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:36,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:36,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:16:36,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:36,616 INFO L130 PetriNetUnfolder]: 173/328 cut-off events. [2022-12-06 04:16:36,616 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:16:36,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 328 events. 173/328 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1403 event pairs, 21 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 634. Up to 249 conditions per place. [2022-12-06 04:16:36,621 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 18 selfloop transitions, 2 changer transitions 4/26 dead transitions. [2022-12-06 04:16:36,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 106 flow [2022-12-06 04:16:36,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:16:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:16:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 04:16:36,631 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 04:16:36,633 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 35 transitions. [2022-12-06 04:16:36,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 106 flow [2022-12-06 04:16:36,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:16:36,636 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2022-12-06 04:16:36,637 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2022-12-06 04:16:36,640 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-06 04:16:36,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:36,640 INFO L89 Accepts]: Start accepts. Operand has 25 places, 16 transitions, 40 flow [2022-12-06 04:16:36,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:36,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:36,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 16 transitions, 40 flow [2022-12-06 04:16:36,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 40 flow [2022-12-06 04:16:36,647 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 04:16:36,647 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:16:36,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:16:36,648 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 40 flow [2022-12-06 04:16:36,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 04:16:36,814 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:16:36,816 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 04:16:36,817 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 38 flow [2022-12-06 04:16:36,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:36,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:36,817 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:36,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:16:36,820 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:16:36,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:36,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1468576715, now seen corresponding path program 1 times [2022-12-06 04:16:36,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:36,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796953914] [2022-12-06 04:16:36,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:36,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:37,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:37,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:37,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796953914] [2022-12-06 04:16:37,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796953914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:37,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:37,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:16:37,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284362999] [2022-12-06 04:16:37,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:37,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:16:37,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:37,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:16:37,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:16:37,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 04:16:37,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 38 flow. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:37,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:37,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 04:16:37,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:37,337 INFO L130 PetriNetUnfolder]: 135/241 cut-off events. [2022-12-06 04:16:37,337 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 04:16:37,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 241 events. 135/241 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 795 event pairs, 31 based on Foata normal form. 5/246 useless extension candidates. Maximal degree in co-relation 503. Up to 200 conditions per place. [2022-12-06 04:16:37,338 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 19 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2022-12-06 04:16:37,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 21 transitions, 92 flow [2022-12-06 04:16:37,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:16:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:16:37,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-12-06 04:16:37,345 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2022-12-06 04:16:37,345 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 38 flow. Second operand 3 states and 22 transitions. [2022-12-06 04:16:37,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 21 transitions, 92 flow [2022-12-06 04:16:37,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 21 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:16:37,347 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 42 flow [2022-12-06 04:16:37,347 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2022-12-06 04:16:37,348 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -4 predicate places. [2022-12-06 04:16:37,348 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:37,348 INFO L89 Accepts]: Start accepts. Operand has 23 places, 15 transitions, 42 flow [2022-12-06 04:16:37,348 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:37,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:37,349 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 15 transitions, 42 flow [2022-12-06 04:16:37,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 15 transitions, 42 flow [2022-12-06 04:16:37,353 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 04:16:37,353 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:16:37,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:16:37,354 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 15 transitions, 42 flow [2022-12-06 04:16:37,354 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 04:16:37,365 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:37,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 04:16:37,367 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2022-12-06 04:16:37,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:37,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:37,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:37,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:16:37,368 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:16:37,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:37,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1718763023, now seen corresponding path program 1 times [2022-12-06 04:16:37,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:37,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956281216] [2022-12-06 04:16:37,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:37,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:37,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:37,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956281216] [2022-12-06 04:16:37,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956281216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:37,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:37,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:16:37,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98379522] [2022-12-06 04:16:37,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:37,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:16:37,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:37,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:16:37,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:16:37,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 04:16:37,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:37,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:37,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 04:16:37,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:37,854 INFO L130 PetriNetUnfolder]: 100/199 cut-off events. [2022-12-06 04:16:37,855 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 04:16:37,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 199 events. 100/199 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 686 event pairs, 36 based on Foata normal form. 2/201 useless extension candidates. Maximal degree in co-relation 432. Up to 157 conditions per place. [2022-12-06 04:16:37,856 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 21 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2022-12-06 04:16:37,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 123 flow [2022-12-06 04:16:37,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:16:37,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:16:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-06 04:16:37,858 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-06 04:16:37,858 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states and 31 transitions. [2022-12-06 04:16:37,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 123 flow [2022-12-06 04:16:37,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 27 transitions, 117 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:16:37,859 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 71 flow [2022-12-06 04:16:37,860 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2022-12-06 04:16:37,860 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2022-12-06 04:16:37,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:37,860 INFO L89 Accepts]: Start accepts. Operand has 26 places, 19 transitions, 71 flow [2022-12-06 04:16:37,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:37,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:37,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 19 transitions, 71 flow [2022-12-06 04:16:37,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 71 flow [2022-12-06 04:16:37,865 INFO L130 PetriNetUnfolder]: 3/24 cut-off events. [2022-12-06 04:16:37,865 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-06 04:16:37,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 24 events. 3/24 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 1 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 44. Up to 8 conditions per place. [2022-12-06 04:16:37,865 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 71 flow [2022-12-06 04:16:37,865 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-06 04:16:37,928 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:37,929 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 04:16:37,929 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 71 flow [2022-12-06 04:16:37,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:37,929 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:37,929 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:37,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:16:37,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:16:37,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:37,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1358421524, now seen corresponding path program 1 times [2022-12-06 04:16:37,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:37,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899967980] [2022-12-06 04:16:37,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:37,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:38,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:38,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:38,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899967980] [2022-12-06 04:16:38,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899967980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:38,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:38,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:16:38,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052414825] [2022-12-06 04:16:38,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:38,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:16:38,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:38,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:16:38,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:16:38,173 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 04:16:38,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:38,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:38,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 04:16:38,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:38,260 INFO L130 PetriNetUnfolder]: 106/209 cut-off events. [2022-12-06 04:16:38,260 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-06 04:16:38,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 209 events. 106/209 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 732 event pairs, 19 based on Foata normal form. 1/210 useless extension candidates. Maximal degree in co-relation 524. Up to 148 conditions per place. [2022-12-06 04:16:38,263 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 23 selfloop transitions, 10 changer transitions 0/34 dead transitions. [2022-12-06 04:16:38,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 34 transitions, 174 flow [2022-12-06 04:16:38,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:16:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:16:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 04:16:38,266 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-06 04:16:38,266 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 71 flow. Second operand 5 states and 36 transitions. [2022-12-06 04:16:38,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 34 transitions, 174 flow [2022-12-06 04:16:38,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:16:38,268 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 128 flow [2022-12-06 04:16:38,269 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2022-12-06 04:16:38,270 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2022-12-06 04:16:38,271 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:38,271 INFO L89 Accepts]: Start accepts. Operand has 32 places, 25 transitions, 128 flow [2022-12-06 04:16:38,272 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:38,272 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:38,272 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 128 flow [2022-12-06 04:16:38,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 128 flow [2022-12-06 04:16:38,279 INFO L130 PetriNetUnfolder]: 22/63 cut-off events. [2022-12-06 04:16:38,279 INFO L131 PetriNetUnfolder]: For 46/52 co-relation queries the response was YES. [2022-12-06 04:16:38,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 63 events. 22/63 cut-off events. For 46/52 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 211 event pairs, 5 based on Foata normal form. 2/63 useless extension candidates. Maximal degree in co-relation 171. Up to 32 conditions per place. [2022-12-06 04:16:38,281 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 128 flow [2022-12-06 04:16:38,283 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-06 04:16:38,347 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [283] L741-->L744: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [392] $Ultimate##0-->L775: Formula: (and (= v_~x$r_buff1_thd2~0_87 v_~x$r_buff0_thd2~0_111) (= v_~x$w_buff0_used~0_357 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_35| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_35|) (= v_~x$r_buff0_thd0~0_230 v_~x$r_buff1_thd0~0_239) (= v_~x$w_buff0_used~0_358 v_~x$w_buff1_used~0_318) (= v_~y~0_28 v_~__unbuffered_p1_EAX~0_71) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_35| 0)) (= v_~x$w_buff0~0_243 v_~x$w_buff1~0_209) (= v_~x$r_buff0_thd2~0_110 1) (= v_~x$r_buff1_thd1~0_84 v_~x$r_buff0_thd1~0_77) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_318 256) 0)) (not (= (mod v_~x$w_buff0_used~0_357 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_35|) (= 2 v_~x$w_buff0~0_242) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_27| |v_P1Thread1of1ForFork1_~arg#1.offset_27|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_27| |v_P1Thread1of1ForFork1_~arg#1.base_27|) (= v_~y~0_28 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_243, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_27|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_230, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_111, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_358, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_27|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_242, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_230, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_27|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_27|, ~x$w_buff1~0=v_~x$w_buff1~0_209, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_87, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_318, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_84, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_239, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_357, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_27|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_71, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_35|, ~y~0=v_~y~0_28} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] [2022-12-06 04:16:38,491 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [283] L741-->L744: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [196] L810-->L816: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_73 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd0~0_36 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_36 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_74 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_67 256) 0)) .cse0)) (.cse4 (and .cse5 .cse1))) (and (= v_~x$r_buff1_thd0~0_35 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_66 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$r_buff0_thd0~0_35 256) 0)))) 0 v_~x$r_buff1_thd0~0_36)) (= v_~x~0_35 (ite .cse2 v_~x$w_buff0~0_20 (ite .cse3 v_~x$w_buff1~0_15 v_~x~0_36))) (= (ite .cse2 0 v_~x$w_buff0_used~0_74) v_~x$w_buff0_used~0_73) (= v_~x$r_buff0_thd0~0_35 (ite .cse4 0 v_~x$r_buff0_thd0~0_36)) (= v_~x$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_67))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_36, ~x~0=v_~x~0_36, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_74} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_66, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_35, ~x~0=v_~x~0_35, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_73} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:16:38,551 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [393] L741-->L775: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_48| |v_P1Thread1of1ForFork1_~arg#1.offset_48|) (= v_~x$w_buff0_used~0_455 v_~x$w_buff1_used~0_398) (= v_~x$r_buff0_thd0~0_276 v_~x$r_buff1_thd0~0_286) (= v_~x$w_buff0_used~0_454 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_48| |v_P1Thread1of1ForFork1_~arg#1.base_48|) (= v_~x$w_buff0~0_305 v_~x$w_buff1~0_259) (= v_~x$r_buff0_thd2~0_173 v_~x$r_buff1_thd2~0_128) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_56| 0)) (= v_~y~0_49 1) (= v_~x$r_buff0_thd1~0_116 v_~x$r_buff1_thd1~0_126) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_56| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_56|) (= v_~y~0_49 v_~__unbuffered_p1_EAX~0_97) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_56| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_454 256) 0)) (not (= (mod v_~x$w_buff1_used~0_398 256) 0)))) 1 0)) (= 2 v_~x$w_buff0~0_304) (= v_~x~0_342 1) (= v_~x$r_buff0_thd2~0_172 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_305, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_48|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_276, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_116, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_173, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_455, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_48|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_304, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_276, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_116, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_48|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_48|, ~x$w_buff1~0=v_~x$w_buff1~0_259, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_128, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_398, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_126, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_172, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_286, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_56|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_454, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_48|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_48|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_97, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_56|, ~y~0=v_~y~0_49, ~x~0=v_~x~0_342} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0, ~x~0] and [284] L744-->L751: Formula: (let ((.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_77 256)))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse1 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_78) v_~x$w_buff0_used~0_77) (= v_~x$r_buff0_thd1~0_21 (ite .cse1 0 v_~x$r_buff0_thd1~0_22)) (= v_~x~0_39 (ite .cse0 v_~x$w_buff0~0_22 (ite .cse2 v_~x$w_buff1~0_17 v_~x~0_40))) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_71) v_~x$w_buff1_used~0_70) (= v_~x$r_buff1_thd1~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)))) 0 v_~x$r_buff1_thd1~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_77} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:16:38,736 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:16:38,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 466 [2022-12-06 04:16:38,737 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 143 flow [2022-12-06 04:16:38,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:38,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:38,737 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:38,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:16:38,737 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:16:38,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:38,738 INFO L85 PathProgramCache]: Analyzing trace with hash -874917452, now seen corresponding path program 1 times [2022-12-06 04:16:38,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:38,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931876472] [2022-12-06 04:16:38,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:38,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:39,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:39,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931876472] [2022-12-06 04:16:39,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931876472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:39,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:39,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:16:39,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112650241] [2022-12-06 04:16:39,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:39,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:16:39,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:39,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:16:39,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:16:39,194 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:16:39,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:39,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:39,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:16:39,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:39,330 INFO L130 PetriNetUnfolder]: 112/224 cut-off events. [2022-12-06 04:16:39,330 INFO L131 PetriNetUnfolder]: For 303/303 co-relation queries the response was YES. [2022-12-06 04:16:39,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 224 events. 112/224 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 899 event pairs, 28 based on Foata normal form. 6/227 useless extension candidates. Maximal degree in co-relation 729. Up to 131 conditions per place. [2022-12-06 04:16:39,332 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 26 selfloop transitions, 14 changer transitions 0/41 dead transitions. [2022-12-06 04:16:39,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 291 flow [2022-12-06 04:16:39,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:16:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:16:39,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-06 04:16:39,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4421052631578947 [2022-12-06 04:16:39,334 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 143 flow. Second operand 5 states and 42 transitions. [2022-12-06 04:16:39,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 291 flow [2022-12-06 04:16:39,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 279 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 04:16:39,336 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 220 flow [2022-12-06 04:16:39,336 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2022-12-06 04:16:39,337 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2022-12-06 04:16:39,337 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:39,337 INFO L89 Accepts]: Start accepts. Operand has 36 places, 30 transitions, 220 flow [2022-12-06 04:16:39,338 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:39,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:39,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 30 transitions, 220 flow [2022-12-06 04:16:39,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 30 transitions, 220 flow [2022-12-06 04:16:39,348 INFO L130 PetriNetUnfolder]: 25/77 cut-off events. [2022-12-06 04:16:39,349 INFO L131 PetriNetUnfolder]: For 195/197 co-relation queries the response was YES. [2022-12-06 04:16:39,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 77 events. 25/77 cut-off events. For 195/197 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 299 event pairs, 5 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 274. Up to 36 conditions per place. [2022-12-06 04:16:39,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 30 transitions, 220 flow [2022-12-06 04:16:39,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-06 04:16:39,352 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:39,352 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 04:16:39,353 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 220 flow [2022-12-06 04:16:39,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:39,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:39,353 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:39,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:16:39,353 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:16:39,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:39,354 INFO L85 PathProgramCache]: Analyzing trace with hash -875100569, now seen corresponding path program 1 times [2022-12-06 04:16:39,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:39,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870826105] [2022-12-06 04:16:39,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:39,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:39,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:39,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870826105] [2022-12-06 04:16:39,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870826105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:39,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:39,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:16:39,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121013192] [2022-12-06 04:16:39,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:39,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:16:39,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:39,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:16:39,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:16:39,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:16:39,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:39,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:39,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:16:39,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:39,648 INFO L130 PetriNetUnfolder]: 119/237 cut-off events. [2022-12-06 04:16:39,649 INFO L131 PetriNetUnfolder]: For 677/677 co-relation queries the response was YES. [2022-12-06 04:16:39,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 237 events. 119/237 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 950 event pairs, 17 based on Foata normal form. 2/239 useless extension candidates. Maximal degree in co-relation 901. Up to 172 conditions per place. [2022-12-06 04:16:39,650 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 29 selfloop transitions, 9 changer transitions 0/39 dead transitions. [2022-12-06 04:16:39,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 340 flow [2022-12-06 04:16:39,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:16:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:16:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 04:16:39,651 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2022-12-06 04:16:39,652 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 220 flow. Second operand 4 states and 32 transitions. [2022-12-06 04:16:39,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 340 flow [2022-12-06 04:16:39,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 320 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 04:16:39,654 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 246 flow [2022-12-06 04:16:39,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2022-12-06 04:16:39,655 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2022-12-06 04:16:39,655 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:39,655 INFO L89 Accepts]: Start accepts. Operand has 38 places, 32 transitions, 246 flow [2022-12-06 04:16:39,655 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:39,655 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:39,656 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 32 transitions, 246 flow [2022-12-06 04:16:39,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 246 flow [2022-12-06 04:16:39,664 INFO L130 PetriNetUnfolder]: 26/81 cut-off events. [2022-12-06 04:16:39,664 INFO L131 PetriNetUnfolder]: For 187/188 co-relation queries the response was YES. [2022-12-06 04:16:39,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 81 events. 26/81 cut-off events. For 187/188 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 328 event pairs, 4 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 310. Up to 34 conditions per place. [2022-12-06 04:16:39,665 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 32 transitions, 246 flow [2022-12-06 04:16:39,665 INFO L188 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-06 04:16:39,667 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:39,667 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 04:16:39,667 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 246 flow [2022-12-06 04:16:39,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:39,668 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:39,668 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:39,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:16:39,668 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:16:39,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:39,668 INFO L85 PathProgramCache]: Analyzing trace with hash -874914569, now seen corresponding path program 2 times [2022-12-06 04:16:39,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:39,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246781347] [2022-12-06 04:16:39,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:39,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:40,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:40,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246781347] [2022-12-06 04:16:40,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246781347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:40,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:40,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:16:40,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285998045] [2022-12-06 04:16:40,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:40,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:16:40,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:40,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:16:40,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:16:40,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:16:40,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 246 flow. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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-06 04:16:40,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:40,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:16:40,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:40,433 INFO L130 PetriNetUnfolder]: 168/310 cut-off events. [2022-12-06 04:16:40,433 INFO L131 PetriNetUnfolder]: For 829/829 co-relation queries the response was YES. [2022-12-06 04:16:40,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 310 events. 168/310 cut-off events. For 829/829 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1214 event pairs, 35 based on Foata normal form. 4/314 useless extension candidates. Maximal degree in co-relation 1216. Up to 238 conditions per place. [2022-12-06 04:16:40,435 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 36 selfloop transitions, 16 changer transitions 0/52 dead transitions. [2022-12-06 04:16:40,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 475 flow [2022-12-06 04:16:40,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:16:40,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:16:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 04:16:40,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2022-12-06 04:16:40,437 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 246 flow. Second operand 5 states and 40 transitions. [2022-12-06 04:16:40,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 475 flow [2022-12-06 04:16:40,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 455 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:16:40,440 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 369 flow [2022-12-06 04:16:40,440 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2022-12-06 04:16:40,441 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 15 predicate places. [2022-12-06 04:16:40,441 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:40,441 INFO L89 Accepts]: Start accepts. Operand has 42 places, 40 transitions, 369 flow [2022-12-06 04:16:40,441 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:40,441 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:40,441 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 40 transitions, 369 flow [2022-12-06 04:16:40,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 369 flow [2022-12-06 04:16:40,451 INFO L130 PetriNetUnfolder]: 25/78 cut-off events. [2022-12-06 04:16:40,451 INFO L131 PetriNetUnfolder]: For 268/273 co-relation queries the response was YES. [2022-12-06 04:16:40,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 78 events. 25/78 cut-off events. For 268/273 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 318 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 344. Up to 35 conditions per place. [2022-12-06 04:16:40,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 40 transitions, 369 flow [2022-12-06 04:16:40,452 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 04:16:40,454 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:40,454 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 04:16:40,455 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 369 flow [2022-12-06 04:16:40,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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-06 04:16:40,455 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:40,455 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:40,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:16:40,455 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:16:40,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:40,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1352639652, now seen corresponding path program 1 times [2022-12-06 04:16:40,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:40,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574257198] [2022-12-06 04:16:40,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:40,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:40,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:40,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574257198] [2022-12-06 04:16:40,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574257198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:40,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:40,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:16:40,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939162301] [2022-12-06 04:16:40,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:40,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:16:40,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:40,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:16:40,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:16:40,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:16:40,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 369 flow. Second operand has 6 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-06 04:16:40,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:40,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:16:40,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:41,068 INFO L130 PetriNetUnfolder]: 122/245 cut-off events. [2022-12-06 04:16:41,069 INFO L131 PetriNetUnfolder]: For 1020/1020 co-relation queries the response was YES. [2022-12-06 04:16:41,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 245 events. 122/245 cut-off events. For 1020/1020 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 985 event pairs, 19 based on Foata normal form. 2/247 useless extension candidates. Maximal degree in co-relation 1079. Up to 174 conditions per place. [2022-12-06 04:16:41,071 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 34 selfloop transitions, 13 changer transitions 0/48 dead transitions. [2022-12-06 04:16:41,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 507 flow [2022-12-06 04:16:41,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:16:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:16:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 04:16:41,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4342105263157895 [2022-12-06 04:16:41,074 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 369 flow. Second operand 4 states and 33 transitions. [2022-12-06 04:16:41,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 507 flow [2022-12-06 04:16:41,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 476 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-06 04:16:41,077 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 389 flow [2022-12-06 04:16:41,077 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2022-12-06 04:16:41,079 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 18 predicate places. [2022-12-06 04:16:41,079 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:41,079 INFO L89 Accepts]: Start accepts. Operand has 45 places, 41 transitions, 389 flow [2022-12-06 04:16:41,080 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:41,080 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:41,080 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 41 transitions, 389 flow [2022-12-06 04:16:41,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 389 flow [2022-12-06 04:16:41,092 INFO L130 PetriNetUnfolder]: 26/82 cut-off events. [2022-12-06 04:16:41,092 INFO L131 PetriNetUnfolder]: For 403/404 co-relation queries the response was YES. [2022-12-06 04:16:41,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 82 events. 26/82 cut-off events. For 403/404 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 331 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 361. Up to 34 conditions per place. [2022-12-06 04:16:41,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 41 transitions, 389 flow [2022-12-06 04:16:41,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 04:16:41,096 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:41,098 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 04:16:41,098 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 389 flow [2022-12-06 04:16:41,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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-06 04:16:41,098 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:41,098 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:41,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:16:41,099 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:16:41,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:41,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1352391714, now seen corresponding path program 1 times [2022-12-06 04:16:41,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:41,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794271366] [2022-12-06 04:16:41,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:41,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:41,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:41,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794271366] [2022-12-06 04:16:41,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794271366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:41,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:41,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:16:41,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091639318] [2022-12-06 04:16:41,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:41,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:16:41,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:41,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:16:41,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:16:41,549 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:16:41,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 389 flow. Second operand has 6 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-06 04:16:41,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:41,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:16:41,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:41,710 INFO L130 PetriNetUnfolder]: 124/250 cut-off events. [2022-12-06 04:16:41,711 INFO L131 PetriNetUnfolder]: For 1340/1340 co-relation queries the response was YES. [2022-12-06 04:16:41,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 250 events. 124/250 cut-off events. For 1340/1340 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1021 event pairs, 12 based on Foata normal form. 2/252 useless extension candidates. Maximal degree in co-relation 1127. Up to 142 conditions per place. [2022-12-06 04:16:41,712 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 31 selfloop transitions, 26 changer transitions 0/58 dead transitions. [2022-12-06 04:16:41,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 594 flow [2022-12-06 04:16:41,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:16:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:16:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-06 04:16:41,714 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40350877192982454 [2022-12-06 04:16:41,714 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 389 flow. Second operand 6 states and 46 transitions. [2022-12-06 04:16:41,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 594 flow [2022-12-06 04:16:41,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 567 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 04:16:41,717 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 482 flow [2022-12-06 04:16:41,717 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=482, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2022-12-06 04:16:41,717 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 23 predicate places. [2022-12-06 04:16:41,718 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:41,718 INFO L89 Accepts]: Start accepts. Operand has 50 places, 45 transitions, 482 flow [2022-12-06 04:16:41,718 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:41,718 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:41,718 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 45 transitions, 482 flow [2022-12-06 04:16:41,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 45 transitions, 482 flow [2022-12-06 04:16:41,728 INFO L130 PetriNetUnfolder]: 27/86 cut-off events. [2022-12-06 04:16:41,728 INFO L131 PetriNetUnfolder]: For 535/537 co-relation queries the response was YES. [2022-12-06 04:16:41,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 86 events. 27/86 cut-off events. For 535/537 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 353 event pairs, 0 based on Foata normal form. 1/87 useless extension candidates. Maximal degree in co-relation 427. Up to 36 conditions per place. [2022-12-06 04:16:41,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 45 transitions, 482 flow [2022-12-06 04:16:41,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-06 04:16:41,735 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L741-->L751: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_458 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_129 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_119 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_459 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_401 256) 0)) .cse1)) (.cse4 (and .cse5 .cse0))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~x$r_buff0_thd1~0_118 256)))) (and (not (= (mod v_~x$w_buff1_used~0_400 256) 0)) .cse1)) 0 v_~x$r_buff1_thd1~0_129) v_~x$r_buff1_thd1~0_128) (= v_~x$w_buff0_used~0_458 (ite .cse2 0 v_~x$w_buff0_used~0_459)) (= (ite .cse2 v_~x$w_buff0~0_308 (ite .cse3 v_~x$w_buff1~0_261 1)) v_~x~0_344) (= (ite .cse4 0 v_~x$r_buff0_thd1~0_119) v_~x$r_buff0_thd1~0_118) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_401) v_~x$w_buff1_used~0_400)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_308, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_119, ~x$w_buff1~0=v_~x$w_buff1~0_261, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_401, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_129, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_459} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_308, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_118, ~x$w_buff1~0=v_~x$w_buff1~0_261, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_400, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128, ~x~0=v_~x~0_344, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_458} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] and [392] $Ultimate##0-->L775: Formula: (and (= v_~x$r_buff1_thd2~0_87 v_~x$r_buff0_thd2~0_111) (= v_~x$w_buff0_used~0_357 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_35| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_35|) (= v_~x$r_buff0_thd0~0_230 v_~x$r_buff1_thd0~0_239) (= v_~x$w_buff0_used~0_358 v_~x$w_buff1_used~0_318) (= v_~y~0_28 v_~__unbuffered_p1_EAX~0_71) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_35| 0)) (= v_~x$w_buff0~0_243 v_~x$w_buff1~0_209) (= v_~x$r_buff0_thd2~0_110 1) (= v_~x$r_buff1_thd1~0_84 v_~x$r_buff0_thd1~0_77) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_318 256) 0)) (not (= (mod v_~x$w_buff0_used~0_357 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_35|) (= 2 v_~x$w_buff0~0_242) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_27| |v_P1Thread1of1ForFork1_~arg#1.offset_27|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_27| |v_P1Thread1of1ForFork1_~arg#1.base_27|) (= v_~y~0_28 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_243, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_27|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_230, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_111, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_358, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_27|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_242, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_230, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_27|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_27|, ~x$w_buff1~0=v_~x$w_buff1~0_209, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_87, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_318, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_84, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_239, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_357, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_27|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_71, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_35|, ~y~0=v_~y~0_28} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] [2022-12-06 04:16:41,932 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:16:41,933 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 04:16:41,933 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 489 flow [2022-12-06 04:16:41,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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-06 04:16:41,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:41,933 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:41,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:16:41,934 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:16:41,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:41,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1656041130, now seen corresponding path program 1 times [2022-12-06 04:16:41,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:41,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110928011] [2022-12-06 04:16:41,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:41,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:42,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:42,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110928011] [2022-12-06 04:16:42,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110928011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:42,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:42,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:16:42,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405722065] [2022-12-06 04:16:42,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:42,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:16:42,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:42,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:16:42,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:16:42,025 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:16:42,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 489 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:42,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:42,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:16:42,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:42,069 INFO L130 PetriNetUnfolder]: 41/108 cut-off events. [2022-12-06 04:16:42,069 INFO L131 PetriNetUnfolder]: For 658/658 co-relation queries the response was YES. [2022-12-06 04:16:42,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 108 events. 41/108 cut-off events. For 658/658 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 362 event pairs, 9 based on Foata normal form. 13/121 useless extension candidates. Maximal degree in co-relation 534. Up to 71 conditions per place. [2022-12-06 04:16:42,070 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 34 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2022-12-06 04:16:42,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 40 transitions, 449 flow [2022-12-06 04:16:42,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:16:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:16:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-06 04:16:42,071 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-06 04:16:42,071 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 489 flow. Second operand 3 states and 31 transitions. [2022-12-06 04:16:42,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 40 transitions, 449 flow [2022-12-06 04:16:42,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 360 flow, removed 17 selfloop flow, removed 11 redundant places. [2022-12-06 04:16:42,075 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 243 flow [2022-12-06 04:16:42,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=243, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-06 04:16:42,076 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 15 predicate places. [2022-12-06 04:16:42,076 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:42,076 INFO L89 Accepts]: Start accepts. Operand has 42 places, 32 transitions, 243 flow [2022-12-06 04:16:42,077 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:42,077 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:42,077 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 243 flow [2022-12-06 04:16:42,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 243 flow [2022-12-06 04:16:42,085 INFO L130 PetriNetUnfolder]: 15/65 cut-off events. [2022-12-06 04:16:42,086 INFO L131 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2022-12-06 04:16:42,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 65 events. 15/65 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 220 event pairs, 1 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 248. Up to 27 conditions per place. [2022-12-06 04:16:42,086 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 243 flow [2022-12-06 04:16:42,086 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 04:16:42,311 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [283] L741-->L744: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [294] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_91 256) 0)))) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse0 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x~0_59 (ite .cse2 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_60))) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_90 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse2 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:16:42,435 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [399] L805-3-->L816: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd0~0_320 256) 0))) (.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_500 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_312 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_501 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_442 256) 0)) .cse2))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_55| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= v_~main$tmp_guard0~0_68 (ite (= (ite (= v_~__unbuffered_cnt~0_121 2) 1 0) 0) 0 1)) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_442) v_~x$w_buff1_used~0_441) (= v_~x$r_buff0_thd0~0_311 (ite .cse0 0 v_~x$r_buff0_thd0~0_312)) (= v_~x$r_buff1_thd0~0_319 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_441 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_311 256) 0)))) 0 v_~x$r_buff1_thd0~0_320)) (= (ite .cse4 0 v_~x$w_buff0_used~0_501) v_~x$w_buff0_used~0_500) (= (ite .cse4 v_~x$w_buff0~0_333 (ite .cse1 v_~x$w_buff1~0_285 v_~x~0_387)) v_~x~0_386) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_55| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53| (mod v_~main$tmp_guard0~0_68 256))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_333, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_312, ~x$w_buff1~0=v_~x$w_buff1~0_285, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_442, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_320, ~x~0=v_~x~0_387, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_501} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_333, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_311, ~x$w_buff1~0=v_~x$w_buff1~0_285, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_35|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_441, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_68, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_319, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_500, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_45|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_55|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, ~x~0=v_~x~0_386, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet6#1, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [294] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_91 256) 0)))) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse0 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x~0_59 (ite .cse2 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_60))) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_90 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse2 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:16:42,633 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] $Ultimate##0-->L775: Formula: (and (= v_~x$r_buff1_thd2~0_87 v_~x$r_buff0_thd2~0_111) (= v_~x$w_buff0_used~0_357 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_35| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_35|) (= v_~x$r_buff0_thd0~0_230 v_~x$r_buff1_thd0~0_239) (= v_~x$w_buff0_used~0_358 v_~x$w_buff1_used~0_318) (= v_~y~0_28 v_~__unbuffered_p1_EAX~0_71) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_35| 0)) (= v_~x$w_buff0~0_243 v_~x$w_buff1~0_209) (= v_~x$r_buff0_thd2~0_110 1) (= v_~x$r_buff1_thd1~0_84 v_~x$r_buff0_thd1~0_77) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_318 256) 0)) (not (= (mod v_~x$w_buff0_used~0_357 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_35|) (= 2 v_~x$w_buff0~0_242) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_27| |v_P1Thread1of1ForFork1_~arg#1.offset_27|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_27| |v_P1Thread1of1ForFork1_~arg#1.base_27|) (= v_~y~0_28 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_243, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_27|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_230, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_111, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_358, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_27|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_242, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_230, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_27|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_27|, ~x$w_buff1~0=v_~x$w_buff1~0_209, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_87, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_318, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_84, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_239, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_357, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_27|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_71, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_35|, ~y~0=v_~y~0_28} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] and [400] L741-->L785: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_504 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_135 256) 0))) (.cse5 (not (= 0 (mod v_~x$r_buff0_thd2~0_185 256))))) (let ((.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_505 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_446 256) 0)) .cse2)) (.cse0 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$r_buff0_thd2~0_185) v_~x$r_buff0_thd2~0_184) (= (ite .cse1 0 v_~x$w_buff0_used~0_505) v_~x$w_buff0_used~0_504) (= v_~x$r_buff1_thd2~0_134 (ite (or (and (not (= 0 (mod v_~x$w_buff1_used~0_445 256))) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_184 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_135)) (= (ite .cse1 v_~x$w_buff0~0_335 (ite .cse4 v_~x$w_buff1~0_287 1)) v_~x~0_390) (= v_~x$w_buff1_used~0_445 (ite (or .cse4 .cse0) 0 v_~x$w_buff1_used~0_446))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$w_buff1~0=v_~x$w_buff1~0_287, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_135, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_446, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_185, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_505} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$w_buff1~0=v_~x$w_buff1~0_287, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_134, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_445, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_184, ~x~0=v_~x~0_390, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_504} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:16:42,795 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] $Ultimate##0-->L785: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff0_thd2~0_194 256) 0))) (.cse2 (not (= 0 (mod v_~x$w_buff0_used~0_518 256)))) (.cse1 (= (mod v_~x$w_buff0_used~0_520 256) 0))) (and (= v_~x$r_buff0_thd1~0_136 v_~x$r_buff1_thd1~0_148) (= v_~y~0_55 1) (= (ite (or (and .cse0 (not .cse1)) .cse2) 0 v_~x$w_buff0_used~0_520) v_~x$w_buff1_used~0_459) (= 2 v_~x$w_buff0~0_341) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_54| |v_P1Thread1of1ForFork1_~arg#1.base_54|) (= v_~y~0_55 v_~__unbuffered_p1_EAX~0_103) (= v_~x$r_buff1_thd2~0_142 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_459 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_192 256) 0)) .cse2)) 0 v_~x$r_buff0_thd2~0_194)) (= v_~x$w_buff0~0_341 v_~x~0_404) (= (ite .cse2 0 1) v_~x$r_buff0_thd2~0_192) (= v_~x$w_buff0~0_342 v_~x$w_buff1~0_293) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_54| |v_P1Thread1of1ForFork1_~arg#1.offset_54|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_62| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_62|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_62| 0)) (= (ite .cse1 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_62|) (= v_~x$w_buff0_used~0_518 0) (= v_~x$r_buff0_thd0~0_319 v_~x$r_buff1_thd0~0_327))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_342, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_54|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_319, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_136, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_194, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_520, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_54|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_341, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_319, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_136, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_54|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_54|, ~x$w_buff1~0=v_~x$w_buff1~0_293, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_142, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_459, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_148, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_192, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_327, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_62|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_518, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_54|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_54|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_103, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_62|, ~y~0=v_~y~0_55, ~x~0=v_~x~0_404} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0, ~x~0] and [284] L744-->L751: Formula: (let ((.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_77 256)))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse1 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_78) v_~x$w_buff0_used~0_77) (= v_~x$r_buff0_thd1~0_21 (ite .cse1 0 v_~x$r_buff0_thd1~0_22)) (= v_~x~0_39 (ite .cse0 v_~x$w_buff0~0_22 (ite .cse2 v_~x$w_buff1~0_17 v_~x~0_40))) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_71) v_~x$w_buff1_used~0_70) (= v_~x$r_buff1_thd1~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)))) 0 v_~x$r_buff1_thd1~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_77} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:16:42,995 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:16:42,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 920 [2022-12-06 04:16:42,996 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 255 flow [2022-12-06 04:16:42,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:42,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:42,996 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:42,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:16:42,997 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:16:42,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:42,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1366768010, now seen corresponding path program 1 times [2022-12-06 04:16:42,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:42,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180114620] [2022-12-06 04:16:42,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:42,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:43,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:43,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180114620] [2022-12-06 04:16:43,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180114620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:43,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:43,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:16:43,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215075927] [2022-12-06 04:16:43,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:43,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:16:43,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:43,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:16:43,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:16:43,236 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 04:16:43,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-06 04:16:43,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:43,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 04:16:43,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:43,280 INFO L130 PetriNetUnfolder]: 19/59 cut-off events. [2022-12-06 04:16:43,280 INFO L131 PetriNetUnfolder]: For 184/185 co-relation queries the response was YES. [2022-12-06 04:16:43,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 59 events. 19/59 cut-off events. For 184/185 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 159 event pairs, 6 based on Foata normal form. 12/71 useless extension candidates. Maximal degree in co-relation 241. Up to 29 conditions per place. [2022-12-06 04:16:43,281 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 27 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2022-12-06 04:16:43,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 321 flow [2022-12-06 04:16:43,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:16:43,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:16:43,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 04:16:43,281 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-06 04:16:43,282 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 255 flow. Second operand 4 states and 36 transitions. [2022-12-06 04:16:43,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 321 flow [2022-12-06 04:16:43,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 267 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-06 04:16:43,284 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 170 flow [2022-12-06 04:16:43,284 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-12-06 04:16:43,284 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2022-12-06 04:16:43,284 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:43,284 INFO L89 Accepts]: Start accepts. Operand has 39 places, 26 transitions, 170 flow [2022-12-06 04:16:43,285 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:43,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:43,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 26 transitions, 170 flow [2022-12-06 04:16:43,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 170 flow [2022-12-06 04:16:43,289 INFO L130 PetriNetUnfolder]: 5/33 cut-off events. [2022-12-06 04:16:43,289 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-12-06 04:16:43,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 33 events. 5/33 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 79 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 98. Up to 10 conditions per place. [2022-12-06 04:16:43,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 26 transitions, 170 flow [2022-12-06 04:16:43,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-06 04:16:44,023 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:16:44,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 739 [2022-12-06 04:16:44,024 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 170 flow [2022-12-06 04:16:44,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-06 04:16:44,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:44,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:44,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:16:44,024 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:16:44,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:44,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1357893571, now seen corresponding path program 1 times [2022-12-06 04:16:44,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:44,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459053634] [2022-12-06 04:16:44,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:44,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:44,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:44,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459053634] [2022-12-06 04:16:44,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459053634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:44,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:44,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:16:44,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104798182] [2022-12-06 04:16:44,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:44,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:16:44,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:44,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:16:44,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:16:44,122 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 04:16:44,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 170 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:44,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:44,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 04:16:44,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:44,177 INFO L130 PetriNetUnfolder]: 28/79 cut-off events. [2022-12-06 04:16:44,177 INFO L131 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2022-12-06 04:16:44,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 79 events. 28/79 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 256 event pairs, 2 based on Foata normal form. 1/80 useless extension candidates. Maximal degree in co-relation 318. Up to 41 conditions per place. [2022-12-06 04:16:44,177 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 17 selfloop transitions, 1 changer transitions 20/38 dead transitions. [2022-12-06 04:16:44,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 342 flow [2022-12-06 04:16:44,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:16:44,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:16:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-06 04:16:44,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4264705882352941 [2022-12-06 04:16:44,179 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 170 flow. Second operand 4 states and 29 transitions. [2022-12-06 04:16:44,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 342 flow [2022-12-06 04:16:44,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 311 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 04:16:44,180 INFO L231 Difference]: Finished difference. Result has 39 places, 16 transitions, 94 flow [2022-12-06 04:16:44,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=39, PETRI_TRANSITIONS=16} [2022-12-06 04:16:44,180 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2022-12-06 04:16:44,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:44,181 INFO L89 Accepts]: Start accepts. Operand has 39 places, 16 transitions, 94 flow [2022-12-06 04:16:44,181 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:44,181 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:44,181 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 16 transitions, 94 flow [2022-12-06 04:16:44,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 16 transitions, 94 flow [2022-12-06 04:16:44,185 INFO L130 PetriNetUnfolder]: 2/20 cut-off events. [2022-12-06 04:16:44,185 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 04:16:44,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 20 events. 2/20 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 22 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 60. Up to 6 conditions per place. [2022-12-06 04:16:44,185 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 16 transitions, 94 flow [2022-12-06 04:16:44,185 INFO L188 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-06 04:16:44,600 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [408] $Ultimate##0-->L778: Formula: (and (= v_~x$w_buff0_used~0_544 1) (= v_~x$r_buff0_thd1~0_146 v_~x$r_buff1_thd1~0_158) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_66| 0)) (= v_~y~0_59 v_~__unbuffered_p1_EAX~0_109) (= v_~x$w_buff0_used~0_545 v_~x$w_buff1_used~0_481) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_58| |v_P1Thread1of1ForFork1_~arg#1.base_58|) (= v_~x$r_buff0_thd2~0_203 v_~x$r_buff1_thd2~0_148) (= v_~x$r_buff0_thd0~0_333 v_~x$r_buff1_thd0~0_341) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_66| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_66|) (= 2 v_~x$w_buff0~0_357) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_66| (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_544 256))) (not (= (mod v_~x$w_buff1_used~0_481 256) 0)))) 1 0)) (= v_~y~0_59 1) (= v_~__unbuffered_p1_EBX~0_86 v_~z~0_37) (= v_~x$w_buff0~0_358 v_~x$w_buff1~0_305) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_58| |v_P1Thread1of1ForFork1_~arg#1.offset_58|) (= v_~x$r_buff0_thd2~0_202 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_358, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_58|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_333, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_146, ~z~0=v_~z~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_203, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_545, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_58|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_357, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_333, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_146, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_86, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_58|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_58|, ~x$w_buff1~0=v_~x$w_buff1~0_305, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_148, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_481, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_158, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_202, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_341, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_66|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_544, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_58|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_58|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_109, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_66|, ~z~0=v_~z~0_37, ~y~0=v_~y~0_59} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] and [410] $Ultimate##0-->L751: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_554 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_163 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_151 256) 0)))) (let ((.cse2 (and (not (= 0 (mod v_~x$w_buff0_used~0_555 256))) .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_488 256) 0)) .cse1)) (.cse3 (and .cse0 .cse5))) (and (= v_~x$r_buff1_thd1~0_162 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_150 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_487 256) 0)))) 0 v_~x$r_buff1_thd1~0_163)) (= v_~z~0_41 1) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= (ite .cse2 0 v_~x$w_buff0_used~0_555) v_~x$w_buff0_used~0_554) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_~x$r_buff0_thd1~0_150 (ite .cse3 0 v_~x$r_buff0_thd1~0_151)) (= (ite .cse2 v_~x$w_buff0~0_365 (ite .cse4 v_~x$w_buff1~0_309 1)) v_~x~0_428) (= (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_488) v_~x$w_buff1_used~0_487)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_365, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_151, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~x$w_buff1~0=v_~x$w_buff1~0_309, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_488, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_163, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_555} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_365, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_150, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~x$w_buff1~0=v_~x$w_buff1~0_309, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_487, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_162, ~z~0=v_~z~0_41, ~x~0=v_~x~0_428, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_554} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~z~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset, ~x$w_buff0_used~0] [2022-12-06 04:16:44,822 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] $Ultimate##0-->L751: Formula: (let ((.cse4 (= (mod v_~x$w_buff0_used~0_564 256) 0)) (.cse3 (not (= (mod v_~x$w_buff0_used~0_562 256) 0))) (.cse1 (not (= (mod v_~x$r_buff0_thd1~0_159 256) 0)))) (let ((.cse0 (and .cse3 .cse1)) (.cse2 (and (not .cse4) .cse1))) (and (= v_~x$w_buff0~0_370 v_~x$w_buff1~0_313) (= (ite .cse0 0 v_~x$r_buff0_thd1~0_159) v_~x$r_buff0_thd1~0_158) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_70| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_70|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_70| 0)) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_62| |v_P1Thread1of1ForFork1_~arg#1.base_62|) (= (ite .cse1 0 1) v_~x$w_buff0_used~0_562) (= (ite .cse1 v_~x$w_buff0~0_369 (ite .cse2 v_~x$w_buff1~0_313 1)) v_~x~0_432) (= v_P0Thread1of1ForFork0_~arg.base_19 |v_P0Thread1of1ForFork0_#in~arg.base_19|) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_495 256) 0)) .cse1) (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_158 256) 0)))) 0 v_~x$r_buff0_thd1~0_159) v_~x$r_buff1_thd1~0_170) (= v_~x$r_buff0_thd0~0_337 v_~x$r_buff1_thd0~0_345) (= 2 v_~x$w_buff0~0_369) (= v_P0Thread1of1ForFork0_~arg.offset_19 |v_P0Thread1of1ForFork0_#in~arg.offset_19|) (= v_~z~0_45 1) (= v_~y~0_63 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_62| |v_P1Thread1of1ForFork1_~arg#1.offset_62|) (= v_~y~0_63 v_~__unbuffered_p1_EAX~0_113) (= v_~x$w_buff1_used~0_495 (ite (or .cse0 .cse2) 0 v_~x$w_buff0_used~0_564)) (= v_~x$r_buff0_thd2~0_213 v_~x$r_buff1_thd2~0_154) (= v_~__unbuffered_p1_EBX~0_90 v_~z~0_46) (= v_~x$r_buff0_thd2~0_212 1) (= (ite .cse4 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_70|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_370, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_62|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_159, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, ~z~0=v_~z~0_46, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_213, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_564, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_62|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_369, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_158, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_62|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_170, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_19, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_62|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_62|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_113, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_70|, ~y~0=v_~y~0_63, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_19, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_337, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_90, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_62|, ~x$w_buff1~0=v_~x$w_buff1~0_313, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_495, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_154, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_212, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_345, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_70|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_562, ~z~0=v_~z~0_45, ~x~0=v_~x~0_432} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork1_~arg#1.base, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~z~0, ~y~0, ~x~0, P0Thread1of1ForFork0_~arg.offset] and [294] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_91 256) 0)))) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse0 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x~0_59 (ite .cse2 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_60))) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_90 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse2 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:16:45,128 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:16:45,129 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 948 [2022-12-06 04:16:45,129 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 12 transitions, 85 flow [2022-12-06 04:16:45,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:45,129 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:45,129 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:45,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:16:45,129 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:16:45,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:45,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1719845111, now seen corresponding path program 1 times [2022-12-06 04:16:45,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:45,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903105990] [2022-12-06 04:16:45,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:45,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:16:45,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:16:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:16:45,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:16:45,182 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:16:45,183 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 04:16:45,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 04:16:45,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 04:16:45,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 04:16:45,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 04:16:45,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:16:45,185 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:45,189 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:16:45,189 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:16:45,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:16:45 BasicIcfg [2022-12-06 04:16:45,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:16:45,215 INFO L158 Benchmark]: Toolchain (without parser) took 14416.45ms. Allocated memory was 188.7MB in the beginning and 532.7MB in the end (delta: 343.9MB). Free memory was 163.0MB in the beginning and 394.7MB in the end (delta: -231.7MB). Peak memory consumption was 113.1MB. Max. memory is 8.0GB. [2022-12-06 04:16:45,215 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 188.7MB. Free memory is still 166.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:16:45,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.65ms. Allocated memory is still 188.7MB. Free memory was 162.8MB in the beginning and 137.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 04:16:45,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.55ms. Allocated memory is still 188.7MB. Free memory was 137.7MB in the beginning and 135.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:16:45,216 INFO L158 Benchmark]: Boogie Preprocessor took 43.69ms. Allocated memory is still 188.7MB. Free memory was 135.1MB in the beginning and 133.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:16:45,216 INFO L158 Benchmark]: RCFGBuilder took 563.90ms. Allocated memory is still 188.7MB. Free memory was 133.0MB in the beginning and 101.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 04:16:45,216 INFO L158 Benchmark]: TraceAbstraction took 13276.79ms. Allocated memory was 188.7MB in the beginning and 532.7MB in the end (delta: 343.9MB). Free memory was 100.5MB in the beginning and 394.7MB in the end (delta: -294.3MB). Peak memory consumption was 50.2MB. Max. memory is 8.0GB. [2022-12-06 04:16:45,217 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 188.7MB. Free memory is still 166.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 464.65ms. Allocated memory is still 188.7MB. Free memory was 162.8MB in the beginning and 137.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.55ms. Allocated memory is still 188.7MB. Free memory was 137.7MB in the beginning and 135.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.69ms. Allocated memory is still 188.7MB. Free memory was 135.1MB in the beginning and 133.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 563.90ms. Allocated memory is still 188.7MB. Free memory was 133.0MB in the beginning and 101.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 13276.79ms. Allocated memory was 188.7MB in the beginning and 532.7MB in the end (delta: 343.9MB). Free memory was 100.5MB in the beginning and 394.7MB in the end (delta: -294.3MB). Peak memory consumption was 50.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 94 PlacesBefore, 27 PlacesAfterwards, 89 TransitionsBefore, 21 TransitionsAfterwards, 1156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 33 ConcurrentYvCompositions, 1 ChoiceCompositions, 71 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 948, independent: 898, independent conditional: 898, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 948, independent: 898, independent conditional: 0, independent unconditional: 898, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 948, independent: 898, independent conditional: 0, independent unconditional: 898, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 948, independent: 898, independent conditional: 0, independent unconditional: 898, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 754, independent: 720, independent conditional: 0, independent unconditional: 720, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 754, independent: 712, independent conditional: 0, independent unconditional: 712, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 209, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 948, independent: 178, independent conditional: 0, independent unconditional: 178, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 754, unknown conditional: 0, unknown unconditional: 754] , Statistics on independence cache: Total cache size (in pairs): 1160, Positive cache size: 1126, Positive conditional cache size: 0, Positive unconditional cache size: 1126, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, 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.2s, 23 PlacesBefore, 22 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 111, independent: 78, independent conditional: 16, independent unconditional: 62, dependent: 33, dependent conditional: 9, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, independent: 78, independent conditional: 16, independent unconditional: 62, dependent: 33, dependent conditional: 9, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, independent: 78, independent conditional: 16, independent unconditional: 62, dependent: 33, dependent conditional: 9, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 68, independent: 51, independent conditional: 14, independent unconditional: 37, dependent: 17, dependent conditional: 7, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 68, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 17, dependent conditional: 7, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 69, dependent conditional: 43, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, independent: 27, independent conditional: 2, independent unconditional: 25, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 68, unknown conditional: 21, unknown unconditional: 47] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 51, Positive conditional cache size: 14, Positive unconditional cache size: 37, Negative cache size: 17, Negative conditional cache size: 7, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 23 PlacesBefore, 23 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 32, independent conditional: 5, independent unconditional: 27, dependent: 14, dependent conditional: 2, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 10, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 59, Positive conditional cache size: 14, Positive unconditional cache size: 45, Negative cache size: 19, Negative conditional cache size: 7, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 43, independent: 28, independent conditional: 3, independent unconditional: 25, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, independent: 28, independent conditional: 3, independent unconditional: 25, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, independent: 28, independent conditional: 3, independent unconditional: 25, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 11, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, independent: 23, independent conditional: 3, independent unconditional: 20, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 64, Positive conditional cache size: 14, Positive unconditional cache size: 50, Negative cache size: 25, Negative conditional cache size: 7, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 32 PlacesBefore, 31 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 184, independent: 151, independent conditional: 151, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 184, independent: 151, independent conditional: 65, independent unconditional: 86, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 184, independent: 151, independent conditional: 40, independent unconditional: 111, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 184, independent: 151, independent conditional: 40, independent unconditional: 111, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 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: 184, independent: 150, independent conditional: 39, independent unconditional: 111, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 76, Positive conditional cache size: 15, Positive unconditional cache size: 61, Negative cache size: 25, Negative conditional cache size: 7, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, independent: 67, independent conditional: 67, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88, independent: 67, independent conditional: 29, independent unconditional: 38, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, independent: 67, independent conditional: 29, independent unconditional: 38, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 67, independent conditional: 29, independent unconditional: 38, dependent: 21, dependent conditional: 0, dependent unconditional: 21, 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: 88, independent: 66, independent conditional: 29, independent unconditional: 37, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 77, Positive conditional cache size: 15, Positive unconditional cache size: 62, Negative cache size: 25, Negative conditional cache size: 7, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 112, independent: 83, independent conditional: 83, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 112, independent: 83, independent conditional: 44, independent unconditional: 39, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 112, independent: 83, independent conditional: 44, independent unconditional: 39, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 112, independent: 83, independent conditional: 44, independent unconditional: 39, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 112, independent: 81, independent conditional: 42, independent unconditional: 39, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 79, Positive conditional cache size: 17, Positive unconditional cache size: 62, Negative cache size: 25, Negative conditional cache size: 7, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 239, independent: 195, independent conditional: 195, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 239, independent: 195, independent conditional: 83, independent unconditional: 112, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 239, independent: 195, independent conditional: 83, independent unconditional: 112, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 239, independent: 195, independent conditional: 83, independent unconditional: 112, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 239, independent: 190, independent conditional: 81, independent unconditional: 109, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 84, Positive conditional cache size: 19, Positive unconditional cache size: 65, Negative cache size: 25, Negative conditional cache size: 7, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 203, independent: 157, independent conditional: 157, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 203, independent: 157, independent conditional: 58, independent unconditional: 99, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 203, independent: 157, independent conditional: 58, independent unconditional: 99, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203, independent: 157, independent conditional: 58, independent unconditional: 99, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 203, independent: 157, independent conditional: 58, independent unconditional: 99, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 84, Positive conditional cache size: 19, Positive unconditional cache size: 65, Negative cache size: 25, Negative conditional cache size: 7, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 50 PlacesBefore, 50 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 389, independent: 272, independent conditional: 272, independent unconditional: 0, dependent: 117, dependent conditional: 117, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 389, independent: 272, independent conditional: 70, independent unconditional: 202, dependent: 117, dependent conditional: 8, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 405, independent: 272, independent conditional: 70, independent unconditional: 202, dependent: 133, dependent conditional: 24, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 405, independent: 272, independent conditional: 70, independent unconditional: 202, dependent: 133, dependent conditional: 24, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 405, independent: 271, independent conditional: 69, independent unconditional: 202, dependent: 130, dependent conditional: 21, dependent unconditional: 109, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 86, Positive conditional cache size: 20, Positive unconditional cache size: 66, Negative cache size: 28, Negative conditional cache size: 10, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 42 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 30 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, independent: 153, independent conditional: 153, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 210, independent: 153, independent conditional: 84, independent unconditional: 69, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 210, independent: 153, independent conditional: 82, independent unconditional: 71, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 210, independent: 153, independent conditional: 82, independent unconditional: 71, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 210, independent: 148, independent conditional: 78, independent unconditional: 70, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 114, Positive conditional cache size: 24, Positive unconditional cache size: 90, Negative cache size: 28, Negative conditional cache size: 10, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 39 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 24 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 69, independent: 41, independent conditional: 21, independent unconditional: 20, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 69, independent: 41, independent conditional: 21, independent unconditional: 20, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 69, independent: 41, independent conditional: 21, independent unconditional: 20, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, independent: 41, independent conditional: 21, independent unconditional: 20, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 129, Positive conditional cache size: 24, Positive unconditional cache size: 105, Negative cache size: 28, Negative conditional cache size: 10, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 34 PlacesBefore, 29 PlacesAfterwards, 16 TransitionsBefore, 12 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 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: 9, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 148, Positive conditional cache size: 25, Positive unconditional cache size: 123, Negative cache size: 28, Negative conditional cache size: 10, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1091; [L803] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1091, ((void *)0), P0, ((void *)0))=0, t1091={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 0 pthread_t t1092; [L805] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1092, ((void *)0), P1, ((void *)0))=1, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z [L740] 2 z = 1 [L743] 2 x = 1 [L746] 2 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 2 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 2 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 [L833] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 805]: 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: 803]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 111 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 615 IncrementalHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 12 mSDtfsCounter, 615 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=489occurred in iteration=9, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 1293 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:16:45,252 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...