/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:19:46,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:19:46,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:19:46,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:19:46,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:19:46,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:19:46,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:19:46,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:19:46,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:19:46,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:19:46,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:19:46,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:19:46,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:19:46,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:19:46,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:19:46,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:19:46,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:19:46,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:19:46,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:19:46,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:19:46,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:19:46,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:19:46,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:19:46,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:19:46,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:19:46,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:19:46,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:19:46,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:19:46,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:19:46,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:19:46,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:19:46,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:19:46,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:19:46,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:19:46,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:19:46,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:19:46,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:19:46,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:19:46,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:19:46,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:19:46,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:19:46,561 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:19:46,576 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:19:46,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:19:46,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:19:46,577 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:19:46,577 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:19:46,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:19:46,577 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:19:46,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:19:46,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:19:46,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:19:46,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:19:46,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:19:46,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:19:46,578 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:19:46,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:19:46,578 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:19:46,579 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:19:46,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:19:46,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:19:46,579 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:19:46,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:19:46,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:19:46,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:19:46,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:19:46,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:19:46,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:19:46,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:19:46,580 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:19:46,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:19:46,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:19:46,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:19:46,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:19:46,845 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:19:46,845 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:19:46,846 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-05 23:19:47,757 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:19:47,923 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:19:47,923 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-12-05 23:19:47,965 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cc4150ba/24b68e20cb97403fabf291501d93d0b8/FLAG317d55e83 [2022-12-05 23:19:47,975 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cc4150ba/24b68e20cb97403fabf291501d93d0b8 [2022-12-05 23:19:47,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:19:47,978 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:19:47,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:19:47,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:19:47,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:19:47,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:19:47" (1/1) ... [2022-12-05 23:19:47,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e83900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:47, skipping insertion in model container [2022-12-05 23:19:47,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:19:47" (1/1) ... [2022-12-05 23:19:47,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:19:48,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:19:48,157 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-05 23:19:48,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:19:48,338 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:19:48,346 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-05 23:19:48,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:19:48,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:19:48,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:19:48,428 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:19:48,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:48 WrapperNode [2022-12-05 23:19:48,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:19:48,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:19:48,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:19:48,430 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:19:48,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:48" (1/1) ... [2022-12-05 23:19:48,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:48" (1/1) ... [2022-12-05 23:19:48,486 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2022-12-05 23:19:48,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:19:48,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:19:48,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:19:48,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:19:48,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:48" (1/1) ... [2022-12-05 23:19:48,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:48" (1/1) ... [2022-12-05 23:19:48,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:48" (1/1) ... [2022-12-05 23:19:48,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:48" (1/1) ... [2022-12-05 23:19:48,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:48" (1/1) ... [2022-12-05 23:19:48,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:48" (1/1) ... [2022-12-05 23:19:48,514 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:48" (1/1) ... [2022-12-05 23:19:48,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:48" (1/1) ... [2022-12-05 23:19:48,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:19:48,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:19:48,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:19:48,530 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:19:48,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:48" (1/1) ... [2022-12-05 23:19:48,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:19:48,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:19:48,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:19:48,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:19:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:19:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:19:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:19:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:19:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:19:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:19:48,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:19:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:19:48,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:19:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:19:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:19:48,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:19:48,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:19:48,619 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:19:48,708 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:19:48,709 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:19:48,957 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:19:49,032 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:19:49,033 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:19:49,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:19:49 BoogieIcfgContainer [2022-12-05 23:19:49,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:19:49,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:19:49,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:19:49,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:19:49,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:19:47" (1/3) ... [2022-12-05 23:19:49,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd1ed7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:19:49, skipping insertion in model container [2022-12-05 23:19:49,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:19:48" (2/3) ... [2022-12-05 23:19:49,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd1ed7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:19:49, skipping insertion in model container [2022-12-05 23:19:49,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:19:49" (3/3) ... [2022-12-05 23:19:49,040 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2022-12-05 23:19:49,052 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:19:49,052 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:19:49,052 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:19:49,078 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:19:49,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow [2022-12-05 23:19:49,124 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2022-12-05 23:19:49,124 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:19:49,127 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-05 23:19:49,127 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 86 transitions, 182 flow [2022-12-05 23:19:49,129 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 174 flow [2022-12-05 23:19:49,130 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:49,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 84 transitions, 174 flow [2022-12-05 23:19:49,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 174 flow [2022-12-05 23:19:49,158 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2022-12-05 23:19:49,159 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:19:49,159 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-05 23:19:49,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 84 transitions, 174 flow [2022-12-05 23:19:49,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-05 23:19:52,801 INFO L203 LiptonReduction]: Total number of compositions: 67 [2022-12-05 23:19:52,811 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:19:52,815 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;@4f6d81b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:19:52,816 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:19:52,817 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-05 23:19:52,818 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:19:52,818 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:52,818 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:19:52,818 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-05 23:19:52,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:52,821 INFO L85 PathProgramCache]: Analyzing trace with hash 379307268, now seen corresponding path program 1 times [2022-12-05 23:19:52,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:52,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846992517] [2022-12-05 23:19:52,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:52,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:19:53,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:53,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846992517] [2022-12-05 23:19:53,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846992517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:53,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:53,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:19:53,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078384364] [2022-12-05 23:19:53,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:53,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:19:53,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:53,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:19:53,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:19:53,091 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:19:53,092 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-05 23:19:53,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:53,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:19:53,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:53,189 INFO L130 PetriNetUnfolder]: 135/265 cut-off events. [2022-12-05 23:19:53,190 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:19:53,190 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-05 23:19:53,192 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 17 selfloop transitions, 2 changer transitions 4/25 dead transitions. [2022-12-05 23:19:53,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 102 flow [2022-12-05 23:19:53,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:19:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:19:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-05 23:19:53,206 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-05 23:19:53,207 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 34 transitions. [2022-12-05 23:19:53,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 102 flow [2022-12-05 23:19:53,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:19:53,211 INFO L231 Difference]: Finished difference. Result has 24 places, 15 transitions, 38 flow [2022-12-05 23:19:53,212 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-05 23:19:53,215 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -2 predicate places. [2022-12-05 23:19:53,215 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:53,216 INFO L89 Accepts]: Start accepts. Operand has 24 places, 15 transitions, 38 flow [2022-12-05 23:19:53,218 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:53,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:53,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 15 transitions, 38 flow [2022-12-05 23:19:53,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 15 transitions, 38 flow [2022-12-05 23:19:53,231 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-05 23:19:53,231 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:19:53,231 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-05 23:19:53,232 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 15 transitions, 38 flow [2022-12-05 23:19:53,232 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-05 23:19:53,270 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:53,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-05 23:19:53,273 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 38 flow [2022-12-05 23:19:53,273 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-05 23:19:53,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:53,273 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:53,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:19:53,277 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-05 23:19:53,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:53,277 INFO L85 PathProgramCache]: Analyzing trace with hash -557900278, now seen corresponding path program 1 times [2022-12-05 23:19:53,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:53,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856807888] [2022-12-05 23:19:53,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:53,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:19:53,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:53,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856807888] [2022-12-05 23:19:53,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856807888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:53,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:53,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:19:53,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417095695] [2022-12-05 23:19:53,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:53,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:19:53,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:53,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:19:53,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:19:53,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-05 23:19:53,514 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-05 23:19:53,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:53,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-05 23:19:53,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:53,601 INFO L130 PetriNetUnfolder]: 107/202 cut-off events. [2022-12-05 23:19:53,601 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-05 23:19:53,602 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-05 23:19:53,604 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 18 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2022-12-05 23:19:53,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 98 flow [2022-12-05 23:19:53,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:19:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:19:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-05 23:19:53,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-05 23:19:53,606 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 38 flow. Second operand 3 states and 25 transitions. [2022-12-05 23:19:53,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 98 flow [2022-12-05 23:19:53,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:19:53,607 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 53 flow [2022-12-05 23:19:53,607 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-05 23:19:53,607 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -3 predicate places. [2022-12-05 23:19:53,608 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:53,608 INFO L89 Accepts]: Start accepts. Operand has 23 places, 17 transitions, 53 flow [2022-12-05 23:19:53,608 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:53,608 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:53,609 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 17 transitions, 53 flow [2022-12-05 23:19:53,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 17 transitions, 53 flow [2022-12-05 23:19:53,618 INFO L130 PetriNetUnfolder]: 3/25 cut-off events. [2022-12-05 23:19:53,618 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:19:53,620 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-05 23:19:53,620 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 17 transitions, 53 flow [2022-12-05 23:19:53,620 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-05 23:19:53,633 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:53,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-05 23:19:53,634 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 53 flow [2022-12-05 23:19:53,634 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-05 23:19:53,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:53,635 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:53,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:19:53,635 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-05 23:19:53,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:53,635 INFO L85 PathProgramCache]: Analyzing trace with hash -115040153, now seen corresponding path program 1 times [2022-12-05 23:19:53,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:53,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798853843] [2022-12-05 23:19:53,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:53,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:19:53,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:53,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798853843] [2022-12-05 23:19:53,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798853843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:53,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:53,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:19:53,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425632065] [2022-12-05 23:19:53,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:53,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:19:53,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:53,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:19:53,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:19:53,918 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-05 23:19:53,918 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-05 23:19:53,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:53,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-05 23:19:53,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:53,967 INFO L130 PetriNetUnfolder]: 123/230 cut-off events. [2022-12-05 23:19:53,967 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-05 23:19:53,967 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-05 23:19:53,968 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 19 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2022-12-05 23:19:53,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 131 flow [2022-12-05 23:19:53,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:19:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:19:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-05 23:19:53,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-05 23:19:53,969 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 53 flow. Second operand 4 states and 29 transitions. [2022-12-05 23:19:53,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 131 flow [2022-12-05 23:19:53,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:19:53,970 INFO L231 Difference]: Finished difference. Result has 27 places, 22 transitions, 87 flow [2022-12-05 23:19:53,970 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-05 23:19:53,971 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2022-12-05 23:19:53,971 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:53,971 INFO L89 Accepts]: Start accepts. Operand has 27 places, 22 transitions, 87 flow [2022-12-05 23:19:53,972 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:53,972 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:53,972 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 22 transitions, 87 flow [2022-12-05 23:19:53,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 22 transitions, 87 flow [2022-12-05 23:19:53,977 INFO L130 PetriNetUnfolder]: 9/49 cut-off events. [2022-12-05 23:19:53,977 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-05 23:19:53,977 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-05 23:19:53,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 22 transitions, 87 flow [2022-12-05 23:19:53,978 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-05 23:19:53,982 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-05 23:19:54,064 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-05 23:19:54,302 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:19:54,303 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 332 [2022-12-05 23:19:54,303 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 89 flow [2022-12-05 23:19:54,303 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-05 23:19:54,303 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:54,303 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:54,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:19:54,304 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-05 23:19:54,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:54,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1939332874, now seen corresponding path program 1 times [2022-12-05 23:19:54,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:54,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109645043] [2022-12-05 23:19:54,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:54,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:19:54,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:54,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109645043] [2022-12-05 23:19:54,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109645043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:54,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:54,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:19:54,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146424123] [2022-12-05 23:19:54,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:54,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:19:54,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:54,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:19:54,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:19:54,675 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-05 23:19:54,675 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-05 23:19:54,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:54,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-05 23:19:54,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:54,776 INFO L130 PetriNetUnfolder]: 121/229 cut-off events. [2022-12-05 23:19:54,776 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2022-12-05 23:19:54,776 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-05 23:19:54,778 INFO L137 encePairwiseOnDemand]: 8/17 looper letters, 23 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2022-12-05 23:19:54,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 203 flow [2022-12-05 23:19:54,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:19:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:19:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-05 23:19:54,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4588235294117647 [2022-12-05 23:19:54,780 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 89 flow. Second operand 5 states and 39 transitions. [2022-12-05 23:19:54,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 203 flow [2022-12-05 23:19:54,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 195 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 23:19:54,783 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 137 flow [2022-12-05 23:19:54,783 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-05 23:19:54,784 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2022-12-05 23:19:54,784 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:54,784 INFO L89 Accepts]: Start accepts. Operand has 31 places, 26 transitions, 137 flow [2022-12-05 23:19:54,785 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:54,785 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:54,785 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 26 transitions, 137 flow [2022-12-05 23:19:54,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 26 transitions, 137 flow [2022-12-05 23:19:54,810 INFO L130 PetriNetUnfolder]: 23/78 cut-off events. [2022-12-05 23:19:54,810 INFO L131 PetriNetUnfolder]: For 57/61 co-relation queries the response was YES. [2022-12-05 23:19:54,811 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-05 23:19:54,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 26 transitions, 137 flow [2022-12-05 23:19:54,811 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-05 23:19:54,812 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-05 23:19:54,997 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:19:54,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-05 23:19:54,998 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 143 flow [2022-12-05 23:19:54,998 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-05 23:19:54,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:54,999 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:54,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:19:54,999 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-05 23:19:54,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:54,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1184363701, now seen corresponding path program 1 times [2022-12-05 23:19:54,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:54,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314304039] [2022-12-05 23:19:54,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:55,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:19:55,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:55,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314304039] [2022-12-05 23:19:55,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314304039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:55,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:55,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:19:55,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238034837] [2022-12-05 23:19:55,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:55,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:19:55,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:55,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:19:55,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:19:55,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:19:55,463 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-05 23:19:55,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:55,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:19:55,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:55,554 INFO L130 PetriNetUnfolder]: 164/289 cut-off events. [2022-12-05 23:19:55,555 INFO L131 PetriNetUnfolder]: For 294/294 co-relation queries the response was YES. [2022-12-05 23:19:55,555 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-05 23:19:55,559 INFO L137 encePairwiseOnDemand]: 7/18 looper letters, 28 selfloop transitions, 15 changer transitions 0/43 dead transitions. [2022-12-05 23:19:55,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 43 transitions, 291 flow [2022-12-05 23:19:55,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:19:55,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:19:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-05 23:19:55,561 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-05 23:19:55,561 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 143 flow. Second operand 5 states and 38 transitions. [2022-12-05 23:19:55,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 43 transitions, 291 flow [2022-12-05 23:19:55,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 285 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-05 23:19:55,565 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 211 flow [2022-12-05 23:19:55,566 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-05 23:19:55,567 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2022-12-05 23:19:55,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:55,568 INFO L89 Accepts]: Start accepts. Operand has 36 places, 31 transitions, 211 flow [2022-12-05 23:19:55,569 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:55,570 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:55,570 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 211 flow [2022-12-05 23:19:55,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 211 flow [2022-12-05 23:19:55,585 INFO L130 PetriNetUnfolder]: 39/104 cut-off events. [2022-12-05 23:19:55,586 INFO L131 PetriNetUnfolder]: For 145/152 co-relation queries the response was YES. [2022-12-05 23:19:55,586 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-05 23:19:55,587 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 31 transitions, 211 flow [2022-12-05 23:19:55,588 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-05 23:19:55,594 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:55,596 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-05 23:19:55,596 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 211 flow [2022-12-05 23:19:55,596 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-05 23:19:55,597 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:55,597 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:55,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:19:55,597 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-05 23:19:55,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:55,597 INFO L85 PathProgramCache]: Analyzing trace with hash -114990181, now seen corresponding path program 2 times [2022-12-05 23:19:55,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:55,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842430083] [2022-12-05 23:19:55,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:55,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:19:55,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:55,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842430083] [2022-12-05 23:19:55,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842430083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:55,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:55,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:19:55,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286528762] [2022-12-05 23:19:55,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:55,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:19:55,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:55,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:19:55,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:19:55,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-05 23:19:55,948 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-05 23:19:55,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:55,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-05 23:19:55,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:56,055 INFO L130 PetriNetUnfolder]: 127/247 cut-off events. [2022-12-05 23:19:56,056 INFO L131 PetriNetUnfolder]: For 563/563 co-relation queries the response was YES. [2022-12-05 23:19:56,056 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-05 23:19:56,058 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 30 selfloop transitions, 13 changer transitions 0/45 dead transitions. [2022-12-05 23:19:56,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 357 flow [2022-12-05 23:19:56,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:19:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:19:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-05 23:19:56,058 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2022-12-05 23:19:56,059 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 211 flow. Second operand 5 states and 41 transitions. [2022-12-05 23:19:56,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 357 flow [2022-12-05 23:19:56,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 335 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-05 23:19:56,061 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 249 flow [2022-12-05 23:19:56,061 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-05 23:19:56,061 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2022-12-05 23:19:56,061 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:56,061 INFO L89 Accepts]: Start accepts. Operand has 39 places, 33 transitions, 249 flow [2022-12-05 23:19:56,062 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:56,062 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:56,062 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 33 transitions, 249 flow [2022-12-05 23:19:56,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 249 flow [2022-12-05 23:19:56,072 INFO L130 PetriNetUnfolder]: 33/98 cut-off events. [2022-12-05 23:19:56,072 INFO L131 PetriNetUnfolder]: For 236/243 co-relation queries the response was YES. [2022-12-05 23:19:56,073 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-05 23:19:56,073 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 33 transitions, 249 flow [2022-12-05 23:19:56,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-05 23:19:56,075 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:56,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-05 23:19:56,075 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 249 flow [2022-12-05 23:19:56,075 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-05 23:19:56,075 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:56,075 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:56,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:19:56,076 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-05 23:19:56,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1939430617, now seen corresponding path program 1 times [2022-12-05 23:19:56,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:56,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096522988] [2022-12-05 23:19:56,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:56,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:19:56,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:56,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096522988] [2022-12-05 23:19:56,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096522988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:56,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:56,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:19:56,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896413179] [2022-12-05 23:19:56,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:56,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:19:56,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:56,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:19:56,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:19:56,323 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-05 23:19:56,323 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-05 23:19:56,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:56,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-05 23:19:56,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:56,461 INFO L130 PetriNetUnfolder]: 135/262 cut-off events. [2022-12-05 23:19:56,461 INFO L131 PetriNetUnfolder]: For 884/884 co-relation queries the response was YES. [2022-12-05 23:19:56,462 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-05 23:19:56,463 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 30 selfloop transitions, 18 changer transitions 0/50 dead transitions. [2022-12-05 23:19:56,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 438 flow [2022-12-05 23:19:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:19:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:19:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-05 23:19:56,464 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2022-12-05 23:19:56,464 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 249 flow. Second operand 5 states and 43 transitions. [2022-12-05 23:19:56,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 438 flow [2022-12-05 23:19:56,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 413 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-05 23:19:56,468 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 332 flow [2022-12-05 23:19:56,468 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-05 23:19:56,469 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2022-12-05 23:19:56,469 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:56,469 INFO L89 Accepts]: Start accepts. Operand has 42 places, 38 transitions, 332 flow [2022-12-05 23:19:56,470 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:56,470 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:56,470 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 38 transitions, 332 flow [2022-12-05 23:19:56,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 38 transitions, 332 flow [2022-12-05 23:19:56,483 INFO L130 PetriNetUnfolder]: 37/107 cut-off events. [2022-12-05 23:19:56,484 INFO L131 PetriNetUnfolder]: For 379/394 co-relation queries the response was YES. [2022-12-05 23:19:56,484 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-05 23:19:56,485 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 38 transitions, 332 flow [2022-12-05 23:19:56,485 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-05 23:19:56,488 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:19:56,489 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-05 23:19:56,489 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 332 flow [2022-12-05 23:19:56,489 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-05 23:19:56,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:56,489 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:56,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:19:56,490 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-05 23:19:56,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:56,490 INFO L85 PathProgramCache]: Analyzing trace with hash 730221397, now seen corresponding path program 1 times [2022-12-05 23:19:56,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:56,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179804055] [2022-12-05 23:19:56,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:56,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:19:56,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:56,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179804055] [2022-12-05 23:19:56,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179804055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:56,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:56,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:19:56,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067042119] [2022-12-05 23:19:56,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:56,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:19:56,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:56,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:19:56,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:19:56,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-05 23:19:56,565 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-05 23:19:56,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:56,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-05 23:19:56,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:56,625 INFO L130 PetriNetUnfolder]: 181/348 cut-off events. [2022-12-05 23:19:56,625 INFO L131 PetriNetUnfolder]: For 1441/1450 co-relation queries the response was YES. [2022-12-05 23:19:56,626 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-05 23:19:56,627 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 29 selfloop transitions, 4 changer transitions 14/49 dead transitions. [2022-12-05 23:19:56,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 506 flow [2022-12-05 23:19:56,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:19:56,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:19:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-05 23:19:56,629 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-05 23:19:56,629 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 332 flow. Second operand 3 states and 28 transitions. [2022-12-05 23:19:56,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 506 flow [2022-12-05 23:19:56,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 488 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 23:19:56,632 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 228 flow [2022-12-05 23:19:56,632 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-05 23:19:56,633 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2022-12-05 23:19:56,633 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:56,633 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 228 flow [2022-12-05 23:19:56,634 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:56,634 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:56,634 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 228 flow [2022-12-05 23:19:56,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 28 transitions, 228 flow [2022-12-05 23:19:56,644 INFO L130 PetriNetUnfolder]: 26/91 cut-off events. [2022-12-05 23:19:56,644 INFO L131 PetriNetUnfolder]: For 324/327 co-relation queries the response was YES. [2022-12-05 23:19:56,644 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-05 23:19:56,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 28 transitions, 228 flow [2022-12-05 23:19:56,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-05 23:19:56,651 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-05 23:19:56,722 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:19:56,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-05 23:19:56,723 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 222 flow [2022-12-05 23:19:56,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:19:56,723 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:56,723 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:56,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:19:56,723 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-05 23:19:56,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:56,723 INFO L85 PathProgramCache]: Analyzing trace with hash -7263734, now seen corresponding path program 1 times [2022-12-05 23:19:56,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:56,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985403408] [2022-12-05 23:19:56,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:56,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:57,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:19:57,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:57,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985403408] [2022-12-05 23:19:57,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985403408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:57,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:57,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:19:57,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400187647] [2022-12-05 23:19:57,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:57,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:19:57,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:57,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:19:57,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:19:57,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-05 23:19:57,098 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-05 23:19:57,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:57,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-05 23:19:57,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:57,226 INFO L130 PetriNetUnfolder]: 161/327 cut-off events. [2022-12-05 23:19:57,227 INFO L131 PetriNetUnfolder]: For 1412/1414 co-relation queries the response was YES. [2022-12-05 23:19:57,227 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-05 23:19:57,228 INFO L137 encePairwiseOnDemand]: 8/17 looper letters, 22 selfloop transitions, 10 changer transitions 10/43 dead transitions. [2022-12-05 23:19:57,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 404 flow [2022-12-05 23:19:57,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:19:57,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:19:57,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-12-05 23:19:57,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3627450980392157 [2022-12-05 23:19:57,229 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 222 flow. Second operand 6 states and 37 transitions. [2022-12-05 23:19:57,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 404 flow [2022-12-05 23:19:57,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 330 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-12-05 23:19:57,232 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 203 flow [2022-12-05 23:19:57,232 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-05 23:19:57,233 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 14 predicate places. [2022-12-05 23:19:57,233 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:57,233 INFO L89 Accepts]: Start accepts. Operand has 40 places, 26 transitions, 203 flow [2022-12-05 23:19:57,234 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:57,234 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:57,234 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 26 transitions, 203 flow [2022-12-05 23:19:57,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 203 flow [2022-12-05 23:19:57,241 INFO L130 PetriNetUnfolder]: 17/65 cut-off events. [2022-12-05 23:19:57,241 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-05 23:19:57,241 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-05 23:19:57,242 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 26 transitions, 203 flow [2022-12-05 23:19:57,242 INFO L188 LiptonReduction]: Number of co-enabled transitions 52 [2022-12-05 23:19:57,952 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:19:57,953 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 720 [2022-12-05 23:19:57,953 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 218 flow [2022-12-05 23:19:57,953 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-05 23:19:57,953 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:57,953 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:57,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:19:57,953 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-05 23:19:57,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:57,954 INFO L85 PathProgramCache]: Analyzing trace with hash 730388611, now seen corresponding path program 1 times [2022-12-05 23:19:57,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:57,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476383433] [2022-12-05 23:19:57,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:57,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:19:58,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:58,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476383433] [2022-12-05 23:19:58,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476383433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:58,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:58,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:19:58,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441074901] [2022-12-05 23:19:58,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:58,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:19:58,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:58,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:19:58,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:19:58,146 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:19:58,146 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-05 23:19:58,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:58,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:19:58,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:58,198 INFO L130 PetriNetUnfolder]: 68/150 cut-off events. [2022-12-05 23:19:58,199 INFO L131 PetriNetUnfolder]: For 518/518 co-relation queries the response was YES. [2022-12-05 23:19:58,199 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-05 23:19:58,199 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 4 changer transitions 1/26 dead transitions. [2022-12-05 23:19:58,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 26 transitions, 270 flow [2022-12-05 23:19:58,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:19:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:19:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-12-05 23:19:58,200 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27941176470588236 [2022-12-05 23:19:58,200 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 218 flow. Second operand 4 states and 19 transitions. [2022-12-05 23:19:58,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 26 transitions, 270 flow [2022-12-05 23:19:58,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 222 flow, removed 16 selfloop flow, removed 7 redundant places. [2022-12-05 23:19:58,202 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 177 flow [2022-12-05 23:19:58,203 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-05 23:19:58,203 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-05 23:19:58,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:58,203 INFO L89 Accepts]: Start accepts. Operand has 35 places, 25 transitions, 177 flow [2022-12-05 23:19:58,204 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:58,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:58,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 177 flow [2022-12-05 23:19:58,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 177 flow [2022-12-05 23:19:58,211 INFO L130 PetriNetUnfolder]: 10/65 cut-off events. [2022-12-05 23:19:58,211 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-05 23:19:58,211 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-05 23:19:58,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 177 flow [2022-12-05 23:19:58,212 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-05 23:19:58,218 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-05 23:19:58,326 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:19:58,327 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-05 23:19:58,327 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 175 flow [2022-12-05 23:19:58,327 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-05 23:19:58,327 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:58,327 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:58,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:19:58,327 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-05 23:19:58,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:58,327 INFO L85 PathProgramCache]: Analyzing trace with hash -113990324, now seen corresponding path program 1 times [2022-12-05 23:19:58,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:58,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678515559] [2022-12-05 23:19:58,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:58,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:19:58,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:58,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678515559] [2022-12-05 23:19:58,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678515559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:58,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:58,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:19:58,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792885648] [2022-12-05 23:19:58,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:58,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:19:58,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:58,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:19:58,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:19:58,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-05 23:19:58,440 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-05 23:19:58,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:58,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-05 23:19:58,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:58,500 INFO L130 PetriNetUnfolder]: 29/89 cut-off events. [2022-12-05 23:19:58,501 INFO L131 PetriNetUnfolder]: For 434/437 co-relation queries the response was YES. [2022-12-05 23:19:58,501 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-05 23:19:58,501 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 17 selfloop transitions, 3 changer transitions 18/39 dead transitions. [2022-12-05 23:19:58,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 329 flow [2022-12-05 23:19:58,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:19:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:19:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-05 23:19:58,502 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43529411764705883 [2022-12-05 23:19:58,502 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 175 flow. Second operand 5 states and 37 transitions. [2022-12-05 23:19:58,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 329 flow [2022-12-05 23:19:58,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 285 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-12-05 23:19:58,504 INFO L231 Difference]: Finished difference. Result has 35 places, 19 transitions, 115 flow [2022-12-05 23:19:58,504 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-05 23:19:58,504 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-05 23:19:58,504 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:58,504 INFO L89 Accepts]: Start accepts. Operand has 35 places, 19 transitions, 115 flow [2022-12-05 23:19:58,505 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:58,505 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:58,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 19 transitions, 115 flow [2022-12-05 23:19:58,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 19 transitions, 115 flow [2022-12-05 23:19:58,510 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-05 23:19:58,510 INFO L131 PetriNetUnfolder]: For 79/81 co-relation queries the response was YES. [2022-12-05 23:19:58,510 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-05 23:19:58,510 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 19 transitions, 115 flow [2022-12-05 23:19:58,510 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-05 23:19:58,538 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-05 23:19:58,666 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-05 23:19:58,932 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-05 23:19:58,985 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-05 23:19:59,147 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 23:19:59,148 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 644 [2022-12-05 23:19:59,148 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 117 flow [2022-12-05 23:19:59,148 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-05 23:19:59,148 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:19:59,148 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:19:59,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:19:59,148 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-05 23:19:59,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:19:59,149 INFO L85 PathProgramCache]: Analyzing trace with hash -113781725, now seen corresponding path program 1 times [2022-12-05 23:19:59,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:19:59,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646266011] [2022-12-05 23:19:59,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:19:59,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:19:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:19:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:19:59,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:19:59,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646266011] [2022-12-05 23:19:59,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646266011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:19:59,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:19:59,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:19:59,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394240748] [2022-12-05 23:19:59,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:19:59,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:19:59,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:19:59,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:19:59,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:19:59,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 23:19:59,228 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-05 23:19:59,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:19:59,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 23:19:59,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:19:59,275 INFO L130 PetriNetUnfolder]: 9/37 cut-off events. [2022-12-05 23:19:59,275 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-05 23:19:59,276 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-05 23:19:59,276 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 10 selfloop transitions, 5 changer transitions 8/23 dead transitions. [2022-12-05 23:19:59,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 23 transitions, 204 flow [2022-12-05 23:19:59,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:19:59,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:19:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2022-12-05 23:19:59,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2022-12-05 23:19:59,277 INFO L175 Difference]: Start difference. First operand has 30 places, 17 transitions, 117 flow. Second operand 6 states and 25 transitions. [2022-12-05 23:19:59,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 23 transitions, 204 flow [2022-12-05 23:19:59,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 140 flow, removed 25 selfloop flow, removed 7 redundant places. [2022-12-05 23:19:59,278 INFO L231 Difference]: Finished difference. Result has 31 places, 14 transitions, 77 flow [2022-12-05 23:19:59,278 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-05 23:19:59,278 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2022-12-05 23:19:59,278 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:19:59,278 INFO L89 Accepts]: Start accepts. Operand has 31 places, 14 transitions, 77 flow [2022-12-05 23:19:59,279 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:19:59,279 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:19:59,279 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 14 transitions, 77 flow [2022-12-05 23:19:59,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 14 transitions, 77 flow [2022-12-05 23:19:59,281 INFO L130 PetriNetUnfolder]: 2/15 cut-off events. [2022-12-05 23:19:59,281 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-05 23:19:59,281 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-05 23:19:59,281 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 14 transitions, 77 flow [2022-12-05 23:19:59,281 INFO L188 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-05 23:21:26,257 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-05 23:21:26,437 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:21:26,439 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87161 [2022-12-05 23:21:26,439 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 11 transitions, 69 flow [2022-12-05 23:21:26,439 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-05 23:21:26,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:21:26,439 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:26,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:21:26,439 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-05 23:21:26,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:21:26,440 INFO L85 PathProgramCache]: Analyzing trace with hash -113691631, now seen corresponding path program 1 times [2022-12-05 23:21:26,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:21:26,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790793991] [2022-12-05 23:21:26,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:21:26,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:21:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:21:26,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:21:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:21:26,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:21:26,543 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:21:26,543 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 23:21:26,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 23:21:26,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 23:21:26,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 23:21:26,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 23:21:26,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:21:26,545 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:26,548 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:21:26,549 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:21:26,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:21:26 BasicIcfg [2022-12-05 23:21:26,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:21:26,590 INFO L158 Benchmark]: Toolchain (without parser) took 98612.33ms. Allocated memory was 178.3MB in the beginning and 813.7MB in the end (delta: 635.4MB). Free memory was 142.3MB in the beginning and 525.6MB in the end (delta: -383.3MB). Peak memory consumption was 252.7MB. Max. memory is 8.0GB. [2022-12-05 23:21:26,590 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory was 155.8MB in the beginning and 155.7MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:21:26,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.11ms. Allocated memory is still 178.3MB. Free memory was 142.3MB in the beginning and 117.7MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-05 23:21:26,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.90ms. Allocated memory is still 178.3MB. Free memory was 117.7MB in the beginning and 115.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:21:26,591 INFO L158 Benchmark]: Boogie Preprocessor took 42.29ms. Allocated memory is still 178.3MB. Free memory was 115.0MB in the beginning and 113.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:21:26,591 INFO L158 Benchmark]: RCFGBuilder took 504.38ms. Allocated memory is still 178.3MB. Free memory was 113.5MB in the beginning and 82.5MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-05 23:21:26,591 INFO L158 Benchmark]: TraceAbstraction took 97554.04ms. Allocated memory was 178.3MB in the beginning and 813.7MB in the end (delta: 635.4MB). Free memory was 82.0MB in the beginning and 525.6MB in the end (delta: -443.6MB). Peak memory consumption was 192.9MB. Max. memory is 8.0GB. [2022-12-05 23:21:26,593 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 178.3MB. Free memory was 155.8MB in the beginning and 155.7MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 450.11ms. Allocated memory is still 178.3MB. Free memory was 142.3MB in the beginning and 117.7MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.90ms. Allocated memory is still 178.3MB. Free memory was 117.7MB in the beginning and 115.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.29ms. Allocated memory is still 178.3MB. Free memory was 115.0MB in the beginning and 113.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 504.38ms. Allocated memory is still 178.3MB. Free memory was 113.5MB in the beginning and 82.5MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 97554.04ms. Allocated memory was 178.3MB in the beginning and 813.7MB in the end (delta: 635.4MB). Free memory was 82.0MB in the beginning and 525.6MB in the end (delta: -443.6MB). Peak memory consumption was 192.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 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: 185, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 168, dependent conditional: 0, dependent unconditional: 168, 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: 37, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 37, dependent conditional: 7, dependent unconditional: 30, 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: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, 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: 63, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 63, dependent conditional: 0, dependent unconditional: 63, 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.6s, 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: 87.2s, 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)=1, \old(expression)=0, \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: 97.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, 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, 2.7s 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-05 23:21:26,627 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...