/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:44:27,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:44:27,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:44:27,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:44:27,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:44:27,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:44:27,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:44:27,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:44:27,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:44:27,292 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:44:27,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:44:27,294 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:44:27,294 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:44:27,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:44:27,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:44:27,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:44:27,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:44:27,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:44:27,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:44:27,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:44:27,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:44:27,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:44:27,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:44:27,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:44:27,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:44:27,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:44:27,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:44:27,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:44:27,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:44:27,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:44:27,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:44:27,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:44:27,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:44:27,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:44:27,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:44:27,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:44:27,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:44:27,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:44:27,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:44:27,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:44:27,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:44:27,319 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:44:27,345 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:44:27,346 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:44:27,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:44:27,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:44:27,347 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:44:27,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:44:27,348 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:44:27,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:44:27,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:44:27,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:44:27,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:44:27,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:44:27,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:44:27,349 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:44:27,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:44:27,349 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:44:27,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:44:27,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:44:27,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:44:27,350 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:44:27,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:44:27,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:44:27,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:44:27,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:44:27,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:44:27,351 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:44:27,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:44:27,351 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:44:27,351 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 06:44:27,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:44:27,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:44:27,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:44:27,694 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:44:27,694 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:44:27,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-12-06 06:44:28,784 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:44:29,033 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:44:29,034 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-12-06 06:44:29,043 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22170a520/b5748a268737420ba19a48e99b96a8ab/FLAG476049055 [2022-12-06 06:44:29,052 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22170a520/b5748a268737420ba19a48e99b96a8ab [2022-12-06 06:44:29,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:44:29,055 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:44:29,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:44:29,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:44:29,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:44:29,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:44:29" (1/1) ... [2022-12-06 06:44:29,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47bc1137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:29, skipping insertion in model container [2022-12-06 06:44:29,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:44:29" (1/1) ... [2022-12-06 06:44:29,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:44:29,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:44:29,223 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-06 06:44:29,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:44:29,419 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:44:29,428 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-06 06:44:29,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:29,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:29,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:44:29,511 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:44:29,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:29 WrapperNode [2022-12-06 06:44:29,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:44:29,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:44:29,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:44:29,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:44:29,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:29" (1/1) ... [2022-12-06 06:44:29,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:29" (1/1) ... [2022-12-06 06:44:29,575 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2022-12-06 06:44:29,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:44:29,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:44:29,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:44:29,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:44:29,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:29" (1/1) ... [2022-12-06 06:44:29,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:29" (1/1) ... [2022-12-06 06:44:29,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:29" (1/1) ... [2022-12-06 06:44:29,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:29" (1/1) ... [2022-12-06 06:44:29,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:29" (1/1) ... [2022-12-06 06:44:29,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:29" (1/1) ... [2022-12-06 06:44:29,605 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:29" (1/1) ... [2022-12-06 06:44:29,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:29" (1/1) ... [2022-12-06 06:44:29,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:44:29,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:44:29,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:44:29,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:44:29,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:29" (1/1) ... [2022-12-06 06:44:29,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:44:29,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:44:29,672 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 06:44:29,700 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 06:44:29,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:44:29,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:44:29,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:44:29,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:44:29,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:44:29,722 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:44:29,722 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:44:29,723 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:44:29,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:44:29,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:44:29,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:44:29,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:44:29,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:44:29,725 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 06:44:29,849 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:44:29,850 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:44:30,105 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:44:30,218 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:44:30,218 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:44:30,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:44:30 BoogieIcfgContainer [2022-12-06 06:44:30,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:44:30,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:44:30,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:44:30,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:44:30,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:44:29" (1/3) ... [2022-12-06 06:44:30,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6530481a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:44:30, skipping insertion in model container [2022-12-06 06:44:30,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:29" (2/3) ... [2022-12-06 06:44:30,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6530481a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:44:30, skipping insertion in model container [2022-12-06 06:44:30,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:44:30" (3/3) ... [2022-12-06 06:44:30,226 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2022-12-06 06:44:30,241 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:44:30,242 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:44:30,242 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:44:30,292 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:44:30,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow [2022-12-06 06:44:30,359 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2022-12-06 06:44:30,360 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:44:30,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-06 06:44:30,364 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 86 transitions, 182 flow [2022-12-06 06:44:30,368 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 174 flow [2022-12-06 06:44:30,370 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:30,385 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 84 transitions, 174 flow [2022-12-06 06:44:30,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 174 flow [2022-12-06 06:44:30,402 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2022-12-06 06:44:30,402 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:44:30,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-06 06:44:30,404 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 84 transitions, 174 flow [2022-12-06 06:44:30,404 INFO L188 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-06 06:44:34,123 INFO L203 LiptonReduction]: Total number of compositions: 67 [2022-12-06 06:44:34,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:44:34,138 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;@66468beb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:44:34,139 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 06:44:34,141 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-06 06:44:34,141 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:44:34,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:34,141 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:44:34,142 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 06:44:34,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:34,145 INFO L85 PathProgramCache]: Analyzing trace with hash 379307268, now seen corresponding path program 1 times [2022-12-06 06:44:34,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:34,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096682984] [2022-12-06 06:44:34,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:34,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:34,441 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 06:44:34,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:34,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096682984] [2022-12-06 06:44:34,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096682984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:34,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:34,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:44:34,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380814784] [2022-12-06 06:44:34,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:34,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:44:34,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:34,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:44:34,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:44:34,461 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:44:34,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 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 06:44:34,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:34,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:44:34,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:34,541 INFO L130 PetriNetUnfolder]: 135/265 cut-off events. [2022-12-06 06:44:34,541 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:44:34,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 265 events. 135/265 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1095 event pairs, 21 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 509. Up to 187 conditions per place. [2022-12-06 06:44:34,544 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 17 selfloop transitions, 2 changer transitions 4/25 dead transitions. [2022-12-06 06:44:34,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 102 flow [2022-12-06 06:44:34,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:44:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:44:34,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 06:44:34,553 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 06:44:34,554 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 34 transitions. [2022-12-06 06:44:34,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 102 flow [2022-12-06 06:44:34,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:44:34,557 INFO L231 Difference]: Finished difference. Result has 24 places, 15 transitions, 38 flow [2022-12-06 06:44:34,558 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2022-12-06 06:44:34,560 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -2 predicate places. [2022-12-06 06:44:34,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:34,561 INFO L89 Accepts]: Start accepts. Operand has 24 places, 15 transitions, 38 flow [2022-12-06 06:44:34,563 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:34,563 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:34,563 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 15 transitions, 38 flow [2022-12-06 06:44:34,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 15 transitions, 38 flow [2022-12-06 06:44:34,568 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 06:44:34,568 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:44:34,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 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 15 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:44:34,568 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 15 transitions, 38 flow [2022-12-06 06:44:34,568 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 06:44:34,595 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:34,596 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 06:44:34,596 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 38 flow [2022-12-06 06:44:34,596 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 06:44:34,597 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:34,597 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:34,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:44:34,597 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 06:44:34,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:34,598 INFO L85 PathProgramCache]: Analyzing trace with hash -557900278, now seen corresponding path program 1 times [2022-12-06 06:44:34,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:34,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702532351] [2022-12-06 06:44:34,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:34,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:34,730 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 06:44:34,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:34,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702532351] [2022-12-06 06:44:34,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702532351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:34,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:34,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:44:34,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314248207] [2022-12-06 06:44:34,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:34,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:44:34,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:34,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:44:34,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:44:34,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 06:44:34,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 06:44:34,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:34,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 06:44:34,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:34,794 INFO L130 PetriNetUnfolder]: 107/202 cut-off events. [2022-12-06 06:44:34,794 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 06:44:34,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 202 events. 107/202 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 700 event pairs, 41 based on Foata normal form. 2/204 useless extension candidates. Maximal degree in co-relation 415. Up to 184 conditions per place. [2022-12-06 06:44:34,798 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 18 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2022-12-06 06:44:34,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 98 flow [2022-12-06 06:44:34,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:44:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:44:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-06 06:44:34,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 06:44:34,800 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 38 flow. Second operand 3 states and 25 transitions. [2022-12-06 06:44:34,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 98 flow [2022-12-06 06:44:34,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:44:34,801 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 53 flow [2022-12-06 06:44:34,801 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2022-12-06 06:44:34,801 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -3 predicate places. [2022-12-06 06:44:34,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:34,802 INFO L89 Accepts]: Start accepts. Operand has 23 places, 17 transitions, 53 flow [2022-12-06 06:44:34,802 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:34,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:34,802 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 17 transitions, 53 flow [2022-12-06 06:44:34,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 17 transitions, 53 flow [2022-12-06 06:44:34,807 INFO L130 PetriNetUnfolder]: 3/25 cut-off events. [2022-12-06 06:44:34,807 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:44:34,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 25 events. 3/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 42 event pairs, 1 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 36. Up to 10 conditions per place. [2022-12-06 06:44:34,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 17 transitions, 53 flow [2022-12-06 06:44:34,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-06 06:44:34,823 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:34,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 06:44:34,825 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 53 flow [2022-12-06 06:44:34,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 06:44:34,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:34,826 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:34,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:44:34,826 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 06:44:34,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:34,827 INFO L85 PathProgramCache]: Analyzing trace with hash -115040153, now seen corresponding path program 1 times [2022-12-06 06:44:34,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:34,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684461937] [2022-12-06 06:44:34,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:34,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:35,304 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 06:44:35,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:35,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684461937] [2022-12-06 06:44:35,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684461937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:35,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:35,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:44:35,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078792531] [2022-12-06 06:44:35,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:35,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:44:35,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:35,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:44:35,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:44:35,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 06:44:35,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:35,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:35,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 06:44:35,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:35,367 INFO L130 PetriNetUnfolder]: 123/230 cut-off events. [2022-12-06 06:44:35,367 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-06 06:44:35,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 230 events. 123/230 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 792 event pairs, 61 based on Foata normal form. 1/227 useless extension candidates. Maximal degree in co-relation 522. Up to 202 conditions per place. [2022-12-06 06:44:35,368 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 19 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2022-12-06 06:44:35,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 131 flow [2022-12-06 06:44:35,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:44:35,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:44:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-06 06:44:35,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-06 06:44:35,371 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 53 flow. Second operand 4 states and 29 transitions. [2022-12-06 06:44:35,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 131 flow [2022-12-06 06:44:35,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:44:35,373 INFO L231 Difference]: Finished difference. Result has 27 places, 22 transitions, 87 flow [2022-12-06 06:44:35,373 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=27, PETRI_TRANSITIONS=22} [2022-12-06 06:44:35,374 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2022-12-06 06:44:35,374 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:35,375 INFO L89 Accepts]: Start accepts. Operand has 27 places, 22 transitions, 87 flow [2022-12-06 06:44:35,376 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:35,376 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:35,377 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 22 transitions, 87 flow [2022-12-06 06:44:35,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 22 transitions, 87 flow [2022-12-06 06:44:35,383 INFO L130 PetriNetUnfolder]: 9/49 cut-off events. [2022-12-06 06:44:35,383 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 06:44:35,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 49 events. 9/49 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 166 event pairs, 2 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 87. Up to 18 conditions per place. [2022-12-06 06:44:35,384 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 22 transitions, 87 flow [2022-12-06 06:44:35,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-06 06:44:35,391 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [322] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_104 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_195 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_102 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_196 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_166 256) 0)) .cse3))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| 0)) (= (ite .cse0 v_~x$w_buff0~0_116 (ite .cse1 v_~x$w_buff1~0_92 v_~x~0_119)) v_~x~0_118) (= v_~x$w_buff0_used~0_195 (ite .cse0 0 v_~x$w_buff0_used~0_196)) (= v_~x$r_buff0_thd0~0_101 (ite .cse2 0 v_~x$r_buff0_thd0~0_102)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_165 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd0~0_101 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_104) v_~x$r_buff1_thd0~0_103) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_166) v_~x$w_buff1_used~0_165) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_116, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_92, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_166, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_104, ~x~0=v_~x~0_119, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_196, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_116, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_101, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~x$w_buff1~0=v_~x$w_buff1~0_92, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_165, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_103, ~x~0=v_~x~0_118, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_195, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [273] L735-->L738: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-06 06:44:35,464 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [322] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_104 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_195 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_102 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_196 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_166 256) 0)) .cse3))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| 0)) (= (ite .cse0 v_~x$w_buff0~0_116 (ite .cse1 v_~x$w_buff1~0_92 v_~x~0_119)) v_~x~0_118) (= v_~x$w_buff0_used~0_195 (ite .cse0 0 v_~x$w_buff0_used~0_196)) (= v_~x$r_buff0_thd0~0_101 (ite .cse2 0 v_~x$r_buff0_thd0~0_102)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_165 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd0~0_101 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_104) v_~x$r_buff1_thd0~0_103) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_166) v_~x$w_buff1_used~0_165) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_116, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_92, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_166, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_104, ~x~0=v_~x~0_119, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_196, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_116, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_101, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~x$w_buff1~0=v_~x$w_buff1~0_92, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_165, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_103, ~x~0=v_~x~0_118, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_195, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [321] $Ultimate##0-->L763: Formula: (and (= v_~x$r_buff0_thd2~0_54 1) (= v_~x$r_buff1_thd1~0_58 v_~x$r_buff0_thd1~0_57) (= v_~x$r_buff1_thd2~0_33 v_~x$r_buff0_thd2~0_55) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| 0)) (= v_~x$w_buff0_used~0_191 1) (= v_~x$w_buff0_used~0_192 v_~x$w_buff1_used~0_163) (= v_~x$r_buff1_thd0~0_101 v_~x$r_buff0_thd0~0_99) (= 2 v_~x$w_buff0~0_112) (= v_~x$w_buff0~0_113 v_~x$w_buff1~0_90) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_163 256) 0)) (not (= (mod v_~x$w_buff0_used~0_191 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_113, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_99, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_55, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_192} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_112, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_99, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_163, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_58, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_191, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-06 06:44:35,698 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:44:35,699 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 325 [2022-12-06 06:44:35,699 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 89 flow [2022-12-06 06:44:35,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:35,699 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:35,699 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:35,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:44:35,699 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 06:44:35,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:35,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1939332874, now seen corresponding path program 1 times [2022-12-06 06:44:35,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:35,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096778583] [2022-12-06 06:44:35,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:35,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:36,109 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 06:44:36,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:36,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096778583] [2022-12-06 06:44:36,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096778583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:36,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:36,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:44:36,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572604979] [2022-12-06 06:44:36,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:36,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:44:36,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:36,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:44:36,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:44:36,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 06:44:36,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 89 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 06:44:36,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:36,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 06:44:36,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:36,242 INFO L130 PetriNetUnfolder]: 121/229 cut-off events. [2022-12-06 06:44:36,242 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2022-12-06 06:44:36,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 229 events. 121/229 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 802 event pairs, 30 based on Foata normal form. 3/231 useless extension candidates. Maximal degree in co-relation 596. Up to 165 conditions per place. [2022-12-06 06:44:36,245 INFO L137 encePairwiseOnDemand]: 8/17 looper letters, 23 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2022-12-06 06:44:36,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 203 flow [2022-12-06 06:44:36,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:44:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:44:36,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-06 06:44:36,248 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4588235294117647 [2022-12-06 06:44:36,248 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 89 flow. Second operand 5 states and 39 transitions. [2022-12-06 06:44:36,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 203 flow [2022-12-06 06:44:36,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 195 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 06:44:36,251 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 137 flow [2022-12-06 06:44:36,251 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2022-12-06 06:44:36,252 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2022-12-06 06:44:36,252 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:36,252 INFO L89 Accepts]: Start accepts. Operand has 31 places, 26 transitions, 137 flow [2022-12-06 06:44:36,253 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:36,253 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:36,253 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 26 transitions, 137 flow [2022-12-06 06:44:36,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 26 transitions, 137 flow [2022-12-06 06:44:36,263 INFO L130 PetriNetUnfolder]: 23/78 cut-off events. [2022-12-06 06:44:36,263 INFO L131 PetriNetUnfolder]: For 57/61 co-relation queries the response was YES. [2022-12-06 06:44:36,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 78 events. 23/78 cut-off events. For 57/61 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 302 event pairs, 5 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 189. Up to 32 conditions per place. [2022-12-06 06:44:36,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 26 transitions, 137 flow [2022-12-06 06:44:36,264 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 06:44:36,265 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] $Ultimate##0-->L763: Formula: (and (= v_~x$r_buff0_thd2~0_54 1) (= v_~x$r_buff1_thd1~0_58 v_~x$r_buff0_thd1~0_57) (= v_~x$r_buff1_thd2~0_33 v_~x$r_buff0_thd2~0_55) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| 0)) (= v_~x$w_buff0_used~0_191 1) (= v_~x$w_buff0_used~0_192 v_~x$w_buff1_used~0_163) (= v_~x$r_buff1_thd0~0_101 v_~x$r_buff0_thd0~0_99) (= 2 v_~x$w_buff0~0_112) (= v_~x$w_buff0~0_113 v_~x$w_buff1~0_90) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_163 256) 0)) (not (= (mod v_~x$w_buff0_used~0_191 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_113, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_99, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_55, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_192} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_112, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_99, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_163, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_58, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_191, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [274] L738-->L745: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_77 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff0_used~0_78 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_24) v_~x$r_buff0_thd1~0_23) (= (ite .cse1 0 v_~x$w_buff0_used~0_78) v_~x$w_buff0_used~0_77) (= v_~x$r_buff1_thd1~0_19 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0)))) 0 v_~x$r_buff1_thd1~0_20)) (= v_~x~0_43 (ite .cse1 v_~x$w_buff0~0_28 (ite .cse4 v_~x$w_buff1~0_27 v_~x~0_44))) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_73))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_44, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_43, ~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 06:44:36,467 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:44:36,472 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 06:44:36,472 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 143 flow [2022-12-06 06:44:36,472 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 06:44:36,472 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:36,473 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:36,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:44:36,473 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 06:44:36,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:36,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1184363701, now seen corresponding path program 1 times [2022-12-06 06:44:36,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:36,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467718868] [2022-12-06 06:44:36,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:36,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:37,050 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 06:44:37,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:37,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467718868] [2022-12-06 06:44:37,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467718868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:37,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:37,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:44:37,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400913785] [2022-12-06 06:44:37,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:37,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:44:37,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:37,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:44:37,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:44:37,053 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 06:44:37,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 143 flow. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 06:44:37,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:37,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 06:44:37,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:37,174 INFO L130 PetriNetUnfolder]: 164/289 cut-off events. [2022-12-06 06:44:37,175 INFO L131 PetriNetUnfolder]: For 294/294 co-relation queries the response was YES. [2022-12-06 06:44:37,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 289 events. 164/289 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1030 event pairs, 36 based on Foata normal form. 5/294 useless extension candidates. Maximal degree in co-relation 920. Up to 234 conditions per place. [2022-12-06 06:44:37,176 INFO L137 encePairwiseOnDemand]: 7/18 looper letters, 28 selfloop transitions, 15 changer transitions 0/43 dead transitions. [2022-12-06 06:44:37,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 43 transitions, 291 flow [2022-12-06 06:44:37,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:44:37,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:44:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-06 06:44:37,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-06 06:44:37,179 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 143 flow. Second operand 5 states and 38 transitions. [2022-12-06 06:44:37,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 43 transitions, 291 flow [2022-12-06 06:44:37,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 285 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-06 06:44:37,182 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 211 flow [2022-12-06 06:44:37,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2022-12-06 06:44:37,184 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2022-12-06 06:44:37,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:37,184 INFO L89 Accepts]: Start accepts. Operand has 36 places, 31 transitions, 211 flow [2022-12-06 06:44:37,186 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:37,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:37,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 211 flow [2022-12-06 06:44:37,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 211 flow [2022-12-06 06:44:37,197 INFO L130 PetriNetUnfolder]: 39/104 cut-off events. [2022-12-06 06:44:37,197 INFO L131 PetriNetUnfolder]: For 145/152 co-relation queries the response was YES. [2022-12-06 06:44:37,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 104 events. 39/104 cut-off events. For 145/152 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 414 event pairs, 4 based on Foata normal form. 1/103 useless extension candidates. Maximal degree in co-relation 334. Up to 58 conditions per place. [2022-12-06 06:44:37,198 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 31 transitions, 211 flow [2022-12-06 06:44:37,198 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-06 06:44:37,204 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:37,206 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 06:44:37,206 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 211 flow [2022-12-06 06:44:37,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 06:44:37,206 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:37,206 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:37,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:44:37,206 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 06:44:37,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:37,207 INFO L85 PathProgramCache]: Analyzing trace with hash -114990181, now seen corresponding path program 2 times [2022-12-06 06:44:37,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:37,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087712859] [2022-12-06 06:44:37,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:37,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:37,584 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 06:44:37,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:37,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087712859] [2022-12-06 06:44:37,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087712859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:37,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:37,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:44:37,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278551366] [2022-12-06 06:44:37,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:37,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:44:37,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:37,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:44:37,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:44:37,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 06:44:37,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 211 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 06:44:37,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:37,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 06:44:37,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:37,702 INFO L130 PetriNetUnfolder]: 127/247 cut-off events. [2022-12-06 06:44:37,702 INFO L131 PetriNetUnfolder]: For 563/563 co-relation queries the response was YES. [2022-12-06 06:44:37,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 247 events. 127/247 cut-off events. For 563/563 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 964 event pairs, 22 based on Foata normal form. 10/256 useless extension candidates. Maximal degree in co-relation 899. Up to 138 conditions per place. [2022-12-06 06:44:37,704 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 30 selfloop transitions, 13 changer transitions 0/45 dead transitions. [2022-12-06 06:44:37,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 357 flow [2022-12-06 06:44:37,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:44:37,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:44:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 06:44:37,705 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2022-12-06 06:44:37,705 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 211 flow. Second operand 5 states and 41 transitions. [2022-12-06 06:44:37,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 357 flow [2022-12-06 06:44:37,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 335 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 06:44:37,710 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 249 flow [2022-12-06 06:44:37,710 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2022-12-06 06:44:37,712 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2022-12-06 06:44:37,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:37,712 INFO L89 Accepts]: Start accepts. Operand has 39 places, 33 transitions, 249 flow [2022-12-06 06:44:37,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:37,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:37,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 33 transitions, 249 flow [2022-12-06 06:44:37,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 249 flow [2022-12-06 06:44:37,724 INFO L130 PetriNetUnfolder]: 33/98 cut-off events. [2022-12-06 06:44:37,726 INFO L131 PetriNetUnfolder]: For 236/243 co-relation queries the response was YES. [2022-12-06 06:44:37,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 98 events. 33/98 cut-off events. For 236/243 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 401 event pairs, 2 based on Foata normal form. 1/97 useless extension candidates. Maximal degree in co-relation 353. Up to 51 conditions per place. [2022-12-06 06:44:37,727 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 33 transitions, 249 flow [2022-12-06 06:44:37,727 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-06 06:44:37,729 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:37,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 06:44:37,730 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 249 flow [2022-12-06 06:44:37,730 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 06:44:37,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:37,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:37,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:44:37,730 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 06:44:37,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:37,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1939430617, now seen corresponding path program 1 times [2022-12-06 06:44:37,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:37,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877540601] [2022-12-06 06:44:37,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:37,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:38,028 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 06:44:38,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:38,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877540601] [2022-12-06 06:44:38,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877540601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:38,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:38,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:44:38,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768998674] [2022-12-06 06:44:38,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:38,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:44:38,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:38,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:44:38,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:44:38,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 06:44:38,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 249 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 06:44:38,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:38,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 06:44:38,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:38,161 INFO L130 PetriNetUnfolder]: 135/262 cut-off events. [2022-12-06 06:44:38,162 INFO L131 PetriNetUnfolder]: For 884/884 co-relation queries the response was YES. [2022-12-06 06:44:38,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 262 events. 135/262 cut-off events. For 884/884 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1042 event pairs, 17 based on Foata normal form. 3/263 useless extension candidates. Maximal degree in co-relation 1066. Up to 140 conditions per place. [2022-12-06 06:44:38,163 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 30 selfloop transitions, 18 changer transitions 0/50 dead transitions. [2022-12-06 06:44:38,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 438 flow [2022-12-06 06:44:38,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:44:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:44:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-06 06:44:38,165 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2022-12-06 06:44:38,165 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 249 flow. Second operand 5 states and 43 transitions. [2022-12-06 06:44:38,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 438 flow [2022-12-06 06:44:38,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 413 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 06:44:38,167 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 332 flow [2022-12-06 06:44:38,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2022-12-06 06:44:38,168 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2022-12-06 06:44:38,168 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:38,168 INFO L89 Accepts]: Start accepts. Operand has 42 places, 38 transitions, 332 flow [2022-12-06 06:44:38,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:38,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:38,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 38 transitions, 332 flow [2022-12-06 06:44:38,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 38 transitions, 332 flow [2022-12-06 06:44:38,179 INFO L130 PetriNetUnfolder]: 37/107 cut-off events. [2022-12-06 06:44:38,179 INFO L131 PetriNetUnfolder]: For 379/394 co-relation queries the response was YES. [2022-12-06 06:44:38,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 107 events. 37/107 cut-off events. For 379/394 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 458 event pairs, 1 based on Foata normal form. 3/107 useless extension candidates. Maximal degree in co-relation 428. Up to 55 conditions per place. [2022-12-06 06:44:38,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 38 transitions, 332 flow [2022-12-06 06:44:38,181 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 06:44:38,182 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:38,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 06:44:38,183 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 332 flow [2022-12-06 06:44:38,183 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 06:44:38,183 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:38,183 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:38,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:44:38,183 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 06:44:38,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:38,183 INFO L85 PathProgramCache]: Analyzing trace with hash 730221397, now seen corresponding path program 1 times [2022-12-06 06:44:38,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:38,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827669373] [2022-12-06 06:44:38,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:38,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:38,259 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 06:44:38,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:38,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827669373] [2022-12-06 06:44:38,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827669373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:38,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:38,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:44:38,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168177644] [2022-12-06 06:44:38,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:38,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:44:38,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:38,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:44:38,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:44:38,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 06:44:38,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:38,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:38,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 06:44:38,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:38,322 INFO L130 PetriNetUnfolder]: 181/348 cut-off events. [2022-12-06 06:44:38,323 INFO L131 PetriNetUnfolder]: For 1441/1450 co-relation queries the response was YES. [2022-12-06 06:44:38,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1498 conditions, 348 events. 181/348 cut-off events. For 1441/1450 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1508 event pairs, 46 based on Foata normal form. 21/368 useless extension candidates. Maximal degree in co-relation 1475. Up to 178 conditions per place. [2022-12-06 06:44:38,324 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 29 selfloop transitions, 4 changer transitions 14/49 dead transitions. [2022-12-06 06:44:38,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 506 flow [2022-12-06 06:44:38,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:44:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:44:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-06 06:44:38,326 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-06 06:44:38,326 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 332 flow. Second operand 3 states and 28 transitions. [2022-12-06 06:44:38,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 506 flow [2022-12-06 06:44:38,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 488 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 06:44:38,328 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 228 flow [2022-12-06 06:44:38,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-06 06:44:38,329 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2022-12-06 06:44:38,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:38,329 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 228 flow [2022-12-06 06:44:38,330 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:38,330 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:38,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 228 flow [2022-12-06 06:44:38,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 28 transitions, 228 flow [2022-12-06 06:44:38,339 INFO L130 PetriNetUnfolder]: 26/91 cut-off events. [2022-12-06 06:44:38,339 INFO L131 PetriNetUnfolder]: For 324/327 co-relation queries the response was YES. [2022-12-06 06:44:38,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 91 events. 26/91 cut-off events. For 324/327 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 1 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 348. Up to 52 conditions per place. [2022-12-06 06:44:38,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 28 transitions, 228 flow [2022-12-06 06:44:38,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 06:44:38,347 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [273] L735-->L738: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [321] $Ultimate##0-->L763: Formula: (and (= v_~x$r_buff0_thd2~0_54 1) (= v_~x$r_buff1_thd1~0_58 v_~x$r_buff0_thd1~0_57) (= v_~x$r_buff1_thd2~0_33 v_~x$r_buff0_thd2~0_55) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| 0)) (= v_~x$w_buff0_used~0_191 1) (= v_~x$w_buff0_used~0_192 v_~x$w_buff1_used~0_163) (= v_~x$r_buff1_thd0~0_101 v_~x$r_buff0_thd0~0_99) (= 2 v_~x$w_buff0~0_112) (= v_~x$w_buff0~0_113 v_~x$w_buff1~0_90) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_163 256) 0)) (not (= (mod v_~x$w_buff0_used~0_191 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_113, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_99, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_55, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_192} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_112, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_99, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_163, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_58, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_191, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-06 06:44:38,434 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:44:38,434 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-06 06:44:38,435 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 222 flow [2022-12-06 06:44:38,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:38,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:38,435 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:38,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:44:38,435 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 06:44:38,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:38,435 INFO L85 PathProgramCache]: Analyzing trace with hash -7263734, now seen corresponding path program 1 times [2022-12-06 06:44:38,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:38,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275218020] [2022-12-06 06:44:38,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:38,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:38,769 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 06:44:38,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:38,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275218020] [2022-12-06 06:44:38,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275218020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:38,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:38,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:44:38,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336984708] [2022-12-06 06:44:38,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:38,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:44:38,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:38,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:44:38,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:44:38,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 06:44:38,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 222 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 06:44:38,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:38,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 06:44:38,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:38,892 INFO L130 PetriNetUnfolder]: 161/327 cut-off events. [2022-12-06 06:44:38,893 INFO L131 PetriNetUnfolder]: For 1412/1414 co-relation queries the response was YES. [2022-12-06 06:44:38,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 327 events. 161/327 cut-off events. For 1412/1414 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1424 event pairs, 7 based on Foata normal form. 12/339 useless extension candidates. Maximal degree in co-relation 1301. Up to 167 conditions per place. [2022-12-06 06:44:38,894 INFO L137 encePairwiseOnDemand]: 8/17 looper letters, 22 selfloop transitions, 10 changer transitions 10/43 dead transitions. [2022-12-06 06:44:38,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 404 flow [2022-12-06 06:44:38,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:44:38,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:44:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-12-06 06:44:38,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3627450980392157 [2022-12-06 06:44:38,896 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 222 flow. Second operand 6 states and 37 transitions. [2022-12-06 06:44:38,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 404 flow [2022-12-06 06:44:38,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 330 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-12-06 06:44:38,899 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 203 flow [2022-12-06 06:44:38,899 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=203, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2022-12-06 06:44:38,900 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 14 predicate places. [2022-12-06 06:44:38,900 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:38,900 INFO L89 Accepts]: Start accepts. Operand has 40 places, 26 transitions, 203 flow [2022-12-06 06:44:38,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:38,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:38,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 26 transitions, 203 flow [2022-12-06 06:44:38,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 203 flow [2022-12-06 06:44:38,908 INFO L130 PetriNetUnfolder]: 17/65 cut-off events. [2022-12-06 06:44:38,908 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-06 06:44:38,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 65 events. 17/65 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 213 event pairs, 1 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 234. Up to 39 conditions per place. [2022-12-06 06:44:38,909 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 26 transitions, 203 flow [2022-12-06 06:44:38,909 INFO L188 LiptonReduction]: Number of co-enabled transitions 52 [2022-12-06 06:44:39,582 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:44:39,583 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 683 [2022-12-06 06:44:39,583 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 218 flow [2022-12-06 06:44:39,583 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 06:44:39,583 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:39,583 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:39,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:44:39,583 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 06:44:39,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:39,584 INFO L85 PathProgramCache]: Analyzing trace with hash 730388611, now seen corresponding path program 1 times [2022-12-06 06:44:39,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:39,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273982383] [2022-12-06 06:44:39,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:39,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:39,844 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 06:44:39,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:39,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273982383] [2022-12-06 06:44:39,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273982383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:39,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:39,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:44:39,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211589959] [2022-12-06 06:44:39,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:39,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:44:39,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:39,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:44:39,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:44:39,846 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:44:39,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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 06:44:39,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:39,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:44:39,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:39,913 INFO L130 PetriNetUnfolder]: 68/150 cut-off events. [2022-12-06 06:44:39,914 INFO L131 PetriNetUnfolder]: For 518/518 co-relation queries the response was YES. [2022-12-06 06:44:39,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 150 events. 68/150 cut-off events. For 518/518 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 545 event pairs, 27 based on Foata normal form. 1/151 useless extension candidates. Maximal degree in co-relation 625. Up to 146 conditions per place. [2022-12-06 06:44:39,915 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 4 changer transitions 1/26 dead transitions. [2022-12-06 06:44:39,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 26 transitions, 270 flow [2022-12-06 06:44:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:44:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:44:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-12-06 06:44:39,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27941176470588236 [2022-12-06 06:44:39,916 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 218 flow. Second operand 4 states and 19 transitions. [2022-12-06 06:44:39,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 26 transitions, 270 flow [2022-12-06 06:44:39,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 222 flow, removed 16 selfloop flow, removed 7 redundant places. [2022-12-06 06:44:39,918 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 177 flow [2022-12-06 06:44:39,918 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2022-12-06 06:44:39,919 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-06 06:44:39,919 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:39,919 INFO L89 Accepts]: Start accepts. Operand has 35 places, 25 transitions, 177 flow [2022-12-06 06:44:39,919 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:39,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:39,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 177 flow [2022-12-06 06:44:39,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 177 flow [2022-12-06 06:44:39,927 INFO L130 PetriNetUnfolder]: 10/65 cut-off events. [2022-12-06 06:44:39,927 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-06 06:44:39,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 65 events. 10/65 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 274 event pairs, 1 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 207. Up to 29 conditions per place. [2022-12-06 06:44:39,928 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 177 flow [2022-12-06 06:44:39,928 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-06 06:44:39,934 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [346] L793-3-->L797: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= (ite (= (ite (= 2 v_~__unbuffered_cnt~0_45) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_13|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet6#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [377] $Ultimate##0-->L766: Formula: (and (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (= v_~y~0_87 1) (= v_~x$r_buff0_thd2~0_164 1) (= v_~x$w_buff0_used~0_445 v_~x$w_buff1_used~0_402) (= v_~x$r_buff0_thd2~0_165 v_~x$r_buff1_thd2~0_117) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_444 256) 0)) (not (= (mod v_~x$w_buff1_used~0_402 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (= v_~x$w_buff0~0_275 v_~x$w_buff1~0_236) (= 2 v_~x$w_buff0~0_274) (= v_~x$r_buff0_thd1~0_143 v_~x$r_buff1_thd1~0_148) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_31| |v_P1Thread1of1ForFork0_~arg#1.offset_31|) (= v_~x$r_buff0_thd0~0_248 v_~x$r_buff1_thd0~0_255) (= |v_P1Thread1of1ForFork0_~arg#1.base_31| |v_P1Thread1of1ForFork0_#in~arg#1.base_31|) (= v_~x$w_buff0_used~0_444 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_275, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_248, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_143, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_445} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_274, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_248, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_143, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_31|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_31|, ~x$w_buff1~0=v_~x$w_buff1~0_236, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_402, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_148, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_164, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_255, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_444, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_31|, ~y~0=v_~y~0_87} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] [2022-12-06 06:44:40,036 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:44:40,037 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-06 06:44:40,037 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 175 flow [2022-12-06 06:44:40,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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 06:44:40,037 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:40,037 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:40,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:44:40,038 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 06:44:40,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:40,038 INFO L85 PathProgramCache]: Analyzing trace with hash -113990324, now seen corresponding path program 1 times [2022-12-06 06:44:40,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:40,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117395880] [2022-12-06 06:44:40,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:40,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:40,125 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 06:44:40,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:40,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117395880] [2022-12-06 06:44:40,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117395880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:40,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:40,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:44:40,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178956391] [2022-12-06 06:44:40,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:40,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:44:40,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:40,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:44:40,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:44:40,126 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 06:44:40,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 175 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:40,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:40,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 06:44:40,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:40,181 INFO L130 PetriNetUnfolder]: 29/89 cut-off events. [2022-12-06 06:44:40,181 INFO L131 PetriNetUnfolder]: For 434/437 co-relation queries the response was YES. [2022-12-06 06:44:40,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 89 events. 29/89 cut-off events. For 434/437 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 321 event pairs, 3 based on Foata normal form. 15/104 useless extension candidates. Maximal degree in co-relation 327. Up to 44 conditions per place. [2022-12-06 06:44:40,182 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 17 selfloop transitions, 3 changer transitions 18/39 dead transitions. [2022-12-06 06:44:40,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 329 flow [2022-12-06 06:44:40,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:44:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:44:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-06 06:44:40,183 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43529411764705883 [2022-12-06 06:44:40,183 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 175 flow. Second operand 5 states and 37 transitions. [2022-12-06 06:44:40,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 329 flow [2022-12-06 06:44:40,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 285 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-12-06 06:44:40,185 INFO L231 Difference]: Finished difference. Result has 35 places, 19 transitions, 115 flow [2022-12-06 06:44:40,185 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=35, PETRI_TRANSITIONS=19} [2022-12-06 06:44:40,185 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-06 06:44:40,185 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:40,185 INFO L89 Accepts]: Start accepts. Operand has 35 places, 19 transitions, 115 flow [2022-12-06 06:44:40,186 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:40,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:40,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 19 transitions, 115 flow [2022-12-06 06:44:40,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 19 transitions, 115 flow [2022-12-06 06:44:40,191 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-06 06:44:40,191 INFO L131 PetriNetUnfolder]: For 79/81 co-relation queries the response was YES. [2022-12-06 06:44:40,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 45 events. 10/45 cut-off events. For 79/81 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 136 event pairs, 4 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 146. Up to 24 conditions per place. [2022-12-06 06:44:40,191 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 19 transitions, 115 flow [2022-12-06 06:44:40,191 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-06 06:44:40,207 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [274] L738-->L745: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_77 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff0_used~0_78 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_24) v_~x$r_buff0_thd1~0_23) (= (ite .cse1 0 v_~x$w_buff0_used~0_78) v_~x$w_buff0_used~0_77) (= v_~x$r_buff1_thd1~0_19 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0)))) 0 v_~x$r_buff1_thd1~0_20)) (= v_~x~0_43 (ite .cse1 v_~x$w_buff0~0_28 (ite .cse4 v_~x$w_buff1~0_27 v_~x~0_44))) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_73))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_44, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_43, ~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] and [282] L766-->L773: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_18 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff1_used~0_99 256) 0)) .cse4)) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_104 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd2~0_25) v_~x$r_buff0_thd2~0_24) (= v_~x~0_65 (ite .cse1 v_~x$w_buff0~0_44 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_66))) (= v_~x$w_buff1_used~0_98 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff1_thd2~0_17 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_98 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_18)) (= (ite .cse1 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_66, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_65, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} 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 06:44:40,335 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [377] $Ultimate##0-->L766: Formula: (and (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (= v_~y~0_87 1) (= v_~x$r_buff0_thd2~0_164 1) (= v_~x$w_buff0_used~0_445 v_~x$w_buff1_used~0_402) (= v_~x$r_buff0_thd2~0_165 v_~x$r_buff1_thd2~0_117) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_444 256) 0)) (not (= (mod v_~x$w_buff1_used~0_402 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (= v_~x$w_buff0~0_275 v_~x$w_buff1~0_236) (= 2 v_~x$w_buff0~0_274) (= v_~x$r_buff0_thd1~0_143 v_~x$r_buff1_thd1~0_148) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_31| |v_P1Thread1of1ForFork0_~arg#1.offset_31|) (= v_~x$r_buff0_thd0~0_248 v_~x$r_buff1_thd0~0_255) (= |v_P1Thread1of1ForFork0_~arg#1.base_31| |v_P1Thread1of1ForFork0_#in~arg#1.base_31|) (= v_~x$w_buff0_used~0_444 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_275, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_248, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_143, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_445} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_274, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_248, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_143, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_31|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_31|, ~x$w_buff1~0=v_~x$w_buff1~0_236, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_402, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_148, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_164, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_255, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_444, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_31|, ~y~0=v_~y~0_87} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] and [331] $Ultimate##0-->L735: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_29 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_29, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] [2022-12-06 06:44:40,615 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [273] L735-->L738: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [282] L766-->L773: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_18 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff1_used~0_99 256) 0)) .cse4)) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_104 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd2~0_25) v_~x$r_buff0_thd2~0_24) (= v_~x~0_65 (ite .cse1 v_~x$w_buff0~0_44 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_66))) (= v_~x$w_buff1_used~0_98 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff1_thd2~0_17 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_98 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_18)) (= (ite .cse1 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_66, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_65, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} 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 06:44:40,699 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] $Ultimate##0-->L735: Formula: (and (= 2 v_~x$w_buff0~0_292) (= |v_P1Thread1of1ForFork0_~arg#1.base_37| |v_P1Thread1of1ForFork0_#in~arg#1.base_37|) (= v_~x$r_buff0_thd0~0_262 v_~x$r_buff1_thd0~0_269) (= v_~x$w_buff0_used~0_469 v_~x$w_buff1_used~0_422) (= v_~x$w_buff0~0_293 v_~x$w_buff1~0_250) (= v_~x$w_buff0_used~0_468 1) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_422 256) 0)) (not (= (mod v_~x$w_buff0_used~0_468 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_45|) (= v_~x$r_buff0_thd2~0_180 1) (= v_~x$r_buff0_thd1~0_153 v_~x$r_buff1_thd1~0_158) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_45| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_45|) (= v_~x$r_buff0_thd2~0_181 v_~x$r_buff1_thd2~0_127) (= v_~y~0_97 2) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_37| |v_P1Thread1of1ForFork0_~arg#1.offset_37|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_45| 0)) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_293, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_262, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_37|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_153, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_181, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_37|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_469} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_292, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_262, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_45|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_153, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_37|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_37|, ~x$w_buff1~0=v_~x$w_buff1~0_250, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_127, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_422, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_158, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_45|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_180, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_269, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_37|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_468, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_37|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~y~0=v_~y~0_97} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~y~0] and [282] L766-->L773: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_18 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff1_used~0_99 256) 0)) .cse4)) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_104 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd2~0_25) v_~x$r_buff0_thd2~0_24) (= v_~x~0_65 (ite .cse1 v_~x$w_buff0~0_44 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_66))) (= v_~x$w_buff1_used~0_98 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff1_thd2~0_17 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_98 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_18)) (= (ite .cse1 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_66, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_65, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} 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 06:44:40,866 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:44:40,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 682 [2022-12-06 06:44:40,867 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 117 flow [2022-12-06 06:44:40,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:40,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:40,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:40,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:44:40,867 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 06:44:40,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:40,868 INFO L85 PathProgramCache]: Analyzing trace with hash -113781725, now seen corresponding path program 1 times [2022-12-06 06:44:40,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:40,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631472606] [2022-12-06 06:44:40,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:40,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:40,968 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 06:44:40,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:40,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631472606] [2022-12-06 06:44:40,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631472606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:40,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:40,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:44:40,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964559262] [2022-12-06 06:44:40,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:40,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:44:40,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:40,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:44:40,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:44:40,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 06:44:40,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 17 transitions, 117 flow. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 06:44:40,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:40,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 06:44:40,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:41,021 INFO L130 PetriNetUnfolder]: 9/37 cut-off events. [2022-12-06 06:44:41,022 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-06 06:44:41,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 37 events. 9/37 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 93 event pairs, 0 based on Foata normal form. 5/41 useless extension candidates. Maximal degree in co-relation 155. Up to 23 conditions per place. [2022-12-06 06:44:41,022 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 10 selfloop transitions, 5 changer transitions 8/23 dead transitions. [2022-12-06 06:44:41,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 23 transitions, 204 flow [2022-12-06 06:44:41,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:44:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:44:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2022-12-06 06:44:41,023 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2022-12-06 06:44:41,023 INFO L175 Difference]: Start difference. First operand has 30 places, 17 transitions, 117 flow. Second operand 6 states and 25 transitions. [2022-12-06 06:44:41,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 23 transitions, 204 flow [2022-12-06 06:44:41,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 140 flow, removed 25 selfloop flow, removed 7 redundant places. [2022-12-06 06:44:41,024 INFO L231 Difference]: Finished difference. Result has 31 places, 14 transitions, 77 flow [2022-12-06 06:44:41,024 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=77, PETRI_PLACES=31, PETRI_TRANSITIONS=14} [2022-12-06 06:44:41,025 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2022-12-06 06:44:41,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:41,025 INFO L89 Accepts]: Start accepts. Operand has 31 places, 14 transitions, 77 flow [2022-12-06 06:44:41,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:41,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:41,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 14 transitions, 77 flow [2022-12-06 06:44:41,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 14 transitions, 77 flow [2022-12-06 06:44:41,028 INFO L130 PetriNetUnfolder]: 2/15 cut-off events. [2022-12-06 06:44:41,028 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-06 06:44:41,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 15 events. 2/15 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 8 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 39. Up to 7 conditions per place. [2022-12-06 06:44:41,029 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 14 transitions, 77 flow [2022-12-06 06:44:41,029 INFO L188 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-06 06:46:13,968 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L773: Formula: (let ((.cse0 (= (mod v_~x$w_buff0_used~0_496 256) 0)) (.cse2 (not (= (mod v_~x$r_buff0_thd2~0_200 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_494 256) 0)))) (and (= v_~x$r_buff0_thd1~0_165 v_~x$r_buff1_thd1~0_170) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_49| 0)) (= v_~y~0_105 2) (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= v_~x$w_buff0~0_310 v_~x~0_391) (= |v_P1Thread1of1ForFork0_~arg#1.base_41| |v_P1Thread1of1ForFork0_#in~arg#1.base_41|) (= (ite .cse0 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_49|) (= v_~x$w_buff0_used~0_494 0) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_49| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_49|) (= (ite .cse1 0 1) v_~x$r_buff0_thd2~0_198) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23) (= v_~x$r_buff0_thd0~0_270 v_~x$r_buff1_thd0~0_277) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_41| |v_P1Thread1of1ForFork0_~arg#1.offset_41|) (= v_~x$w_buff0~0_311 v_~x$w_buff1~0_264) (= (ite (or (and .cse2 (not .cse0)) .cse1) 0 v_~x$w_buff0_used~0_496) v_~x$w_buff1_used~0_444) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_444 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_198 256) 0)) .cse1)) 0 v_~x$r_buff0_thd2~0_200) v_~x$r_buff1_thd2~0_141) (= 2 v_~x$w_buff0~0_310))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_311, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_270, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_41|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_165, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_200, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_41|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_496} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_310, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_270, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_49|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_165, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_41|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_41|, ~x$w_buff1~0=v_~x$w_buff1~0_264, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_141, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_444, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_170, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_49|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_198, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_277, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_41|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_494, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_41|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, ~y~0=v_~y~0_105, ~x~0=v_~x~0_391} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~y~0, ~x~0] and [274] L738-->L745: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_77 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff0_used~0_78 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_24) v_~x$r_buff0_thd1~0_23) (= (ite .cse1 0 v_~x$w_buff0_used~0_78) v_~x$w_buff0_used~0_77) (= v_~x$r_buff1_thd1~0_19 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0)))) 0 v_~x$r_buff1_thd1~0_20)) (= v_~x~0_43 (ite .cse1 v_~x$w_buff0~0_28 (ite .cse4 v_~x$w_buff1~0_27 v_~x~0_44))) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_73))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_44, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_43, ~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 06:46:14,157 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:46:14,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93133 [2022-12-06 06:46:14,158 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 11 transitions, 69 flow [2022-12-06 06:46:14,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 06:46:14,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:46:14,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:46:14,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:46:14,158 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 06:46:14,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:46:14,159 INFO L85 PathProgramCache]: Analyzing trace with hash -113691631, now seen corresponding path program 1 times [2022-12-06 06:46:14,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:46:14,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062021778] [2022-12-06 06:46:14,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:46:14,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:46:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:46:14,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:46:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:46:14,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:46:14,211 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:46:14,212 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 06:46:14,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 06:46:14,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 06:46:14,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 06:46:14,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 06:46:14,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:46:14,214 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:46:14,218 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:46:14,218 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:46:14,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:46:14 BasicIcfg [2022-12-06 06:46:14,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:46:14,243 INFO L158 Benchmark]: Toolchain (without parser) took 105188.10ms. Allocated memory was 200.3MB in the beginning and 1.0GB in the end (delta: 806.4MB). Free memory was 173.9MB in the beginning and 436.6MB in the end (delta: -262.7MB). Peak memory consumption was 544.5MB. Max. memory is 8.0GB. [2022-12-06 06:46:14,243 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 176.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:46:14,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.35ms. Allocated memory is still 200.3MB. Free memory was 173.9MB in the beginning and 149.1MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 06:46:14,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.38ms. Allocated memory is still 200.3MB. Free memory was 149.1MB in the beginning and 146.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:46:14,244 INFO L158 Benchmark]: Boogie Preprocessor took 31.86ms. Allocated memory is still 200.3MB. Free memory was 146.5MB in the beginning and 144.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:46:14,244 INFO L158 Benchmark]: RCFGBuilder took 611.54ms. Allocated memory is still 200.3MB. Free memory was 144.6MB in the beginning and 157.4MB in the end (delta: -12.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 06:46:14,244 INFO L158 Benchmark]: TraceAbstraction took 104020.91ms. Allocated memory was 200.3MB in the beginning and 1.0GB in the end (delta: 806.4MB). Free memory was 156.4MB in the beginning and 436.6MB in the end (delta: -280.3MB). Peak memory consumption was 527.1MB. Max. memory is 8.0GB. [2022-12-06 06:46:14,245 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 176.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 456.35ms. Allocated memory is still 200.3MB. Free memory was 173.9MB in the beginning and 149.1MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.38ms. Allocated memory is still 200.3MB. Free memory was 149.1MB in the beginning and 146.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.86ms. Allocated memory is still 200.3MB. Free memory was 146.5MB in the beginning and 144.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 611.54ms. Allocated memory is still 200.3MB. Free memory was 144.6MB in the beginning and 157.4MB in the end (delta: -12.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 104020.91ms. Allocated memory was 200.3MB in the beginning and 1.0GB in the end (delta: 806.4MB). Free memory was 156.4MB in the beginning and 436.6MB in the end (delta: -280.3MB). Peak memory consumption was 527.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 89 PlacesBefore, 26 PlacesAfterwards, 84 TransitionsBefore, 20 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 33 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 67 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 867, independent: 826, independent conditional: 826, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 867, independent: 826, independent conditional: 0, independent unconditional: 826, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 867, independent: 826, independent conditional: 0, independent unconditional: 826, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 867, independent: 826, independent conditional: 0, independent unconditional: 826, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 669, independent: 638, independent conditional: 0, independent unconditional: 638, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 669, independent: 626, independent conditional: 0, independent unconditional: 626, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 43, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 157, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 867, independent: 188, independent conditional: 0, independent unconditional: 188, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 669, unknown conditional: 0, unknown unconditional: 669] , Statistics on independence cache: Total cache size (in pairs): 1045, Positive cache size: 1014, Positive conditional cache size: 0, Positive unconditional cache size: 1014, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 22 PlacesBefore, 22 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 34, independent conditional: 6, independent unconditional: 28, dependent: 16, dependent conditional: 3, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 34, independent conditional: 6, independent unconditional: 28, dependent: 16, dependent conditional: 3, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 34, independent conditional: 6, independent unconditional: 28, dependent: 16, dependent conditional: 3, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, independent: 30, independent conditional: 5, independent unconditional: 25, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 41, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 25, dependent conditional: 8, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 41, unknown conditional: 7, unknown unconditional: 34] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 30, Positive conditional cache size: 5, Positive unconditional cache size: 25, Negative cache size: 11, Negative conditional cache size: 2, Negative unconditional cache size: 9, 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, 17 TransitionsBefore, 17 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 53, independent: 40, independent conditional: 4, independent unconditional: 36, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 53, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 53, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 13, dependent conditional: 0, dependent unconditional: 13, 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: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 53, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 38, Positive conditional cache size: 5, Positive unconditional cache size: 33, Negative cache size: 13, Negative conditional cache size: 2, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 27 PlacesBefore, 26 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89, independent: 68, independent conditional: 68, 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: 89, independent: 68, independent conditional: 21, independent unconditional: 47, 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: 89, independent: 68, independent conditional: 0, independent unconditional: 68, 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: 89, independent: 68, independent conditional: 0, independent unconditional: 68, 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: 14, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 89, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 50, Positive conditional cache size: 5, Positive unconditional cache size: 45, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 31 PlacesBefore, 31 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 70, independent: 58, independent conditional: 36, independent unconditional: 22, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70, independent: 58, independent conditional: 18, independent unconditional: 40, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70, independent: 58, independent conditional: 18, independent unconditional: 40, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, 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: 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: 70, independent: 56, independent conditional: 17, independent unconditional: 39, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 52, Positive conditional cache size: 6, Positive unconditional cache size: 46, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 44, independent: 36, independent conditional: 25, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 36, independent conditional: 10, independent unconditional: 26, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 36, independent conditional: 10, independent unconditional: 26, dependent: 8, dependent conditional: 0, dependent unconditional: 8, 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: 44, independent: 36, independent conditional: 10, independent unconditional: 26, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 52, Positive conditional cache size: 6, Positive unconditional cache size: 46, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 59, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, independent: 48, independent conditional: 14, independent unconditional: 34, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, independent: 48, independent conditional: 14, independent unconditional: 34, dependent: 11, dependent conditional: 0, dependent unconditional: 11, 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: 59, independent: 47, independent conditional: 13, independent unconditional: 34, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 53, Positive conditional cache size: 7, Positive unconditional cache size: 46, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 92, independent: 79, independent conditional: 40, independent unconditional: 39, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 92, independent: 79, independent conditional: 28, independent unconditional: 51, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92, independent: 79, independent conditional: 28, independent unconditional: 51, dependent: 13, dependent conditional: 0, dependent unconditional: 13, 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: 92, independent: 79, independent conditional: 28, independent unconditional: 51, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 53, Positive conditional cache size: 7, Positive unconditional cache size: 46, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 41 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 35, independent conditional: 27, independent unconditional: 8, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 35, independent conditional: 12, independent unconditional: 23, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 35, independent conditional: 12, independent unconditional: 23, dependent: 12, dependent conditional: 0, dependent unconditional: 12, 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: 47, independent: 34, independent conditional: 11, independent unconditional: 23, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 54, Positive conditional cache size: 8, Positive unconditional cache size: 46, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 39 PlacesBefore, 38 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 52 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 68, independent conditional: 68, 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: 82, independent: 68, independent conditional: 66, independent unconditional: 2, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, independent: 68, independent conditional: 38, independent unconditional: 30, 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: 82, independent: 68, independent conditional: 38, independent unconditional: 30, 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: 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: 82, independent: 67, independent conditional: 37, independent unconditional: 30, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 65, Positive conditional cache size: 11, Positive unconditional cache size: 54, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 35 PlacesBefore, 34 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 40, independent conditional: 20, independent unconditional: 20, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 40, independent conditional: 20, independent unconditional: 20, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 40, independent conditional: 20, independent unconditional: 20, dependent: 12, dependent conditional: 0, dependent unconditional: 12, 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: 52, independent: 40, independent conditional: 20, independent unconditional: 20, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 65, Positive conditional cache size: 11, Positive unconditional cache size: 54, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 32 PlacesBefore, 30 PlacesAfterwards, 19 TransitionsBefore, 17 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 2, independent unconditional: 6, 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: 8, independent: 8, independent conditional: 2, independent unconditional: 6, 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: 8, independent: 7, independent conditional: 1, independent unconditional: 6, 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): 95, Positive cache size: 77, Positive conditional cache size: 12, Positive unconditional cache size: 65, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 93.1s, 28 PlacesBefore, 24 PlacesAfterwards, 14 TransitionsBefore, 11 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 77, Positive conditional cache size: 12, Positive unconditional cache size: 65, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - 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; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2475, ((void *)0), P0, ((void *)0))=0, t2475={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] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2476, ((void *)0), P1, ((void *)0))=1, t2475={5:0}, t2476={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] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 [L765] 2 y = 1 [L734] 2 y = 2 [L737] 2 x = 1 [L740] 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) [L741] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 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 [L743] 2 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 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 [L768] 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) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 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 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 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, 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=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 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) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 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 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 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 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 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) [L811] 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)) [L812] 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)) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=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=2] - 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: 793]: 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: 791]: 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, 104 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: 103.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 522 IncrementalHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 10 mSDtfsCounter, 522 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=7, InterpolantAutomatonStates: 54, 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.1s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 1051 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 06:46:14,278 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...