/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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:45:32,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:45:32,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:45:32,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:45:32,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:45:32,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:45:32,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:45:32,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:45:32,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:45:32,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:45:32,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:45:32,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:45:32,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:45:32,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:45:32,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:45:32,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:45:32,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:45:32,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:45:32,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:45:32,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:45:32,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:45:32,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:45:32,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:45:32,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:45:32,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:45:32,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:45:32,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:45:32,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:45:32,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:45:32,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:45:32,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:45:32,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:45:32,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:45:32,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:45:32,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:45:32,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:45:32,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:45:32,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:45:32,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:45:32,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:45:32,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:45:32,633 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:45:32,657 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:45:32,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:45:32,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:45:32,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:45:32,660 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:45:32,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:45:32,660 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:45:32,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:45:32,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:45:32,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:45:32,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:45:32,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:45:32,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:45:32,662 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:45:32,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:45:32,662 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:45:32,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:45:32,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:45:32,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:45:32,662 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:45:32,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:45:32,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:45:32,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:45:32,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:45:32,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:45:32,663 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:45:32,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:45:32,663 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:45:32,663 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-13 00:45:32,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:45:32,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:45:32,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:45:32,931 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:45:32,932 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:45:32,933 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 00:45:33,994 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:45:34,317 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:45:34,318 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 00:45:34,334 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4218a19c4/ce182cc1e5b743e2a55306726f104ceb/FLAGd6d54ef40 [2022-12-13 00:45:34,346 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4218a19c4/ce182cc1e5b743e2a55306726f104ceb [2022-12-13 00:45:34,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:45:34,348 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:45:34,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:45:34,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:45:34,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:45:34,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:45:34" (1/1) ... [2022-12-13 00:45:34,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e3a07df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:34, skipping insertion in model container [2022-12-13 00:45:34,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:45:34" (1/1) ... [2022-12-13 00:45:34,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:45:34,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:45:34,474 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2022-12-13 00:45:34,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:45:34,638 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:45:34,648 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2022-12-13 00:45:34,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:34,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:34,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:45:34,730 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:45:34,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:34 WrapperNode [2022-12-13 00:45:34,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:45:34,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:45:34,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:45:34,732 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:45:34,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:34" (1/1) ... [2022-12-13 00:45:34,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:34" (1/1) ... [2022-12-13 00:45:34,784 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-13 00:45:34,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:45:34,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:45:34,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:45:34,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:45:34,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:34" (1/1) ... [2022-12-13 00:45:34,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:34" (1/1) ... [2022-12-13 00:45:34,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:34" (1/1) ... [2022-12-13 00:45:34,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:34" (1/1) ... [2022-12-13 00:45:34,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:34" (1/1) ... [2022-12-13 00:45:34,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:34" (1/1) ... [2022-12-13 00:45:34,810 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:34" (1/1) ... [2022-12-13 00:45:34,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:34" (1/1) ... [2022-12-13 00:45:34,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:45:34,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:45:34,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:45:34,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:45:34,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:34" (1/1) ... [2022-12-13 00:45:34,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:45:34,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:45:34,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:45:34,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:45:34,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:45:34,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:45:34,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:45:34,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:45:34,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:45:34,916 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:45:34,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:45:34,916 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:45:34,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:45:34,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:45:34,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:45:34,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:45:34,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:45:34,918 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:45:35,046 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:45:35,047 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:45:35,286 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:45:35,393 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:45:35,393 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:45:35,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:45:35 BoogieIcfgContainer [2022-12-13 00:45:35,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:45:35,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:45:35,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:45:35,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:45:35,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:45:34" (1/3) ... [2022-12-13 00:45:35,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6870e518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:45:35, skipping insertion in model container [2022-12-13 00:45:35,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:34" (2/3) ... [2022-12-13 00:45:35,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6870e518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:45:35, skipping insertion in model container [2022-12-13 00:45:35,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:45:35" (3/3) ... [2022-12-13 00:45:35,400 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 00:45:35,414 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:45:35,414 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:45:35,414 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:45:35,455 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:45:35,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 184 flow [2022-12-13 00:45:35,595 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-13 00:45:35,596 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:45:35,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 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/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-13 00:45:35,607 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 87 transitions, 184 flow [2022-12-13 00:45:35,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 85 transitions, 176 flow [2022-12-13 00:45:35,613 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:35,636 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 176 flow [2022-12-13 00:45:35,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 176 flow [2022-12-13 00:45:35,654 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-13 00:45:35,654 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:45:35,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 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/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-13 00:45:35,656 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 176 flow [2022-12-13 00:45:35,656 INFO L226 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-13 00:45:41,238 INFO L241 LiptonReduction]: Total number of compositions: 71 [2022-12-13 00:45:41,249 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:45:41,253 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;@5119551, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:45:41,253 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 00:45:41,255 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2022-12-13 00:45:41,255 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:45:41,255 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:41,256 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 00:45:41,256 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-13 00:45:41,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:41,259 INFO L85 PathProgramCache]: Analyzing trace with hash 379366899, now seen corresponding path program 1 times [2022-12-13 00:45:41,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:41,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311216848] [2022-12-13 00:45:41,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:41,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:41,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:41,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311216848] [2022-12-13 00:45:41,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311216848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:41,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:41,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:45:41,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955400838] [2022-12-13 00:45:41,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:41,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:45:41,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:41,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:45:41,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:45:41,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 44 [2022-12-13 00:45:41,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:41,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:41,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 44 [2022-12-13 00:45:41,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:41,995 INFO L130 PetriNetUnfolder]: 944/1804 cut-off events. [2022-12-13 00:45:41,995 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 00:45:42,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 1804 events. 944/1804 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 12073 event pairs, 100 based on Foata normal form. 0/1061 useless extension candidates. Maximal degree in co-relation 3365. Up to 1325 conditions per place. [2022-12-13 00:45:42,006 INFO L137 encePairwiseOnDemand]: 40/44 looper letters, 20 selfloop transitions, 2 changer transitions 40/69 dead transitions. [2022-12-13 00:45:42,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 268 flow [2022-12-13 00:45:42,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:45:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:45:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-13 00:45:42,019 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2022-12-13 00:45:42,020 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 94 flow. Second operand 3 states and 86 transitions. [2022-12-13 00:45:42,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 268 flow [2022-12-13 00:45:42,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:45:42,025 INFO L231 Difference]: Finished difference. Result has 49 places, 22 transitions, 52 flow [2022-12-13 00:45:42,027 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=49, PETRI_TRANSITIONS=22} [2022-12-13 00:45:42,031 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2022-12-13 00:45:42,031 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:42,031 INFO L89 Accepts]: Start accepts. Operand has 49 places, 22 transitions, 52 flow [2022-12-13 00:45:42,033 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:42,033 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:42,033 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 22 transitions, 52 flow [2022-12-13 00:45:42,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 52 flow [2022-12-13 00:45:42,036 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-13 00:45:42,037 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:45:42,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 41 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:45:42,039 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 22 transitions, 52 flow [2022-12-13 00:45:42,039 INFO L226 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-13 00:45:42,117 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:42,119 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-13 00:45:42,119 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 52 flow [2022-12-13 00:45:42,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:42,119 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:42,119 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:42,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:45:42,122 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-13 00:45:42,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:42,122 INFO L85 PathProgramCache]: Analyzing trace with hash -500557936, now seen corresponding path program 1 times [2022-12-13 00:45:42,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:42,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388730658] [2022-12-13 00:45:42,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:42,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:42,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:42,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388730658] [2022-12-13 00:45:42,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388730658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:42,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:42,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:45:42,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29477285] [2022-12-13 00:45:42,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:42,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:45:42,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:42,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:45:42,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:45:42,524 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2022-12-13 00:45:42,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:42,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:42,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2022-12-13 00:45:42,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:42,586 INFO L130 PetriNetUnfolder]: 173/350 cut-off events. [2022-12-13 00:45:42,586 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 00:45:42,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 350 events. 173/350 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1505 event pairs, 77 based on Foata normal form. 2/306 useless extension candidates. Maximal degree in co-relation 684. Up to 290 conditions per place. [2022-12-13 00:45:42,589 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 20 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2022-12-13 00:45:42,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 116 flow [2022-12-13 00:45:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:45:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:45:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-13 00:45:42,590 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-13 00:45:42,590 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 52 flow. Second operand 3 states and 42 transitions. [2022-12-13 00:45:42,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 116 flow [2022-12-13 00:45:42,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:45:42,591 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 67 flow [2022-12-13 00:45:42,592 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2022-12-13 00:45:42,592 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -21 predicate places. [2022-12-13 00:45:42,592 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:42,592 INFO L89 Accepts]: Start accepts. Operand has 30 places, 24 transitions, 67 flow [2022-12-13 00:45:42,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:42,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:42,594 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 24 transitions, 67 flow [2022-12-13 00:45:42,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 24 transitions, 67 flow [2022-12-13 00:45:42,598 INFO L130 PetriNetUnfolder]: 3/38 cut-off events. [2022-12-13 00:45:42,598 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:45:42,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 38 events. 3/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 95 event pairs, 1 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2022-12-13 00:45:42,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 24 transitions, 67 flow [2022-12-13 00:45:42,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-13 00:45:42,618 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:42,619 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 00:45:42,620 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 67 flow [2022-12-13 00:45:42,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:42,620 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:42,620 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:42,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:45:42,620 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-13 00:45:42,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:42,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1662571766, now seen corresponding path program 1 times [2022-12-13 00:45:42,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:42,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520868296] [2022-12-13 00:45:42,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:42,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:42,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:42,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520868296] [2022-12-13 00:45:42,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520868296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:42,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:42,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:45:42,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426305392] [2022-12-13 00:45:42,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:42,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:45:42,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:42,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:45:42,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:45:42,964 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2022-12-13 00:45:42,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:42,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:42,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2022-12-13 00:45:42,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:43,078 INFO L130 PetriNetUnfolder]: 169/344 cut-off events. [2022-12-13 00:45:43,079 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-13 00:45:43,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 344 events. 169/344 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1460 event pairs, 75 based on Foata normal form. 2/300 useless extension candidates. Maximal degree in co-relation 729. Up to 271 conditions per place. [2022-12-13 00:45:43,080 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 23 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2022-12-13 00:45:43,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 147 flow [2022-12-13 00:45:43,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:45:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:45:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-13 00:45:43,082 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2022-12-13 00:45:43,082 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 67 flow. Second operand 4 states and 53 transitions. [2022-12-13 00:45:43,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 147 flow [2022-12-13 00:45:43,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:45:43,084 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 89 flow [2022-12-13 00:45:43,084 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-13 00:45:43,085 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -18 predicate places. [2022-12-13 00:45:43,088 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:43,089 INFO L89 Accepts]: Start accepts. Operand has 33 places, 26 transitions, 89 flow [2022-12-13 00:45:43,089 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:43,089 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:43,089 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 89 flow [2022-12-13 00:45:43,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 89 flow [2022-12-13 00:45:43,093 INFO L130 PetriNetUnfolder]: 5/40 cut-off events. [2022-12-13 00:45:43,093 INFO L131 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2022-12-13 00:45:43,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 40 events. 5/40 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 109 event pairs, 2 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 65. Up to 12 conditions per place. [2022-12-13 00:45:43,094 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 89 flow [2022-12-13 00:45:43,094 INFO L226 LiptonReduction]: Number of co-enabled transitions 252 [2022-12-13 00:45:43,117 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:43,118 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 00:45:43,118 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 89 flow [2022-12-13 00:45:43,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:43,118 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:43,118 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:43,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:45:43,119 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-13 00:45:43,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:43,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2132275356, now seen corresponding path program 1 times [2022-12-13 00:45:43,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:43,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300372321] [2022-12-13 00:45:43,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:43,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:43,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:43,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300372321] [2022-12-13 00:45:43,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300372321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:43,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:43,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:45:43,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099736549] [2022-12-13 00:45:43,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:43,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:45:43,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:43,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:45:43,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:45:43,393 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2022-12-13 00:45:43,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:43,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:43,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2022-12-13 00:45:43,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:43,470 INFO L130 PetriNetUnfolder]: 204/386 cut-off events. [2022-12-13 00:45:43,470 INFO L131 PetriNetUnfolder]: For 149/149 co-relation queries the response was YES. [2022-12-13 00:45:43,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 386 events. 204/386 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1532 event pairs, 46 based on Foata normal form. 1/337 useless extension candidates. Maximal degree in co-relation 919. Up to 298 conditions per place. [2022-12-13 00:45:43,471 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 29 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2022-12-13 00:45:43,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 212 flow [2022-12-13 00:45:43,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:45:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:45:43,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-13 00:45:43,473 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2022-12-13 00:45:43,473 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 89 flow. Second operand 4 states and 54 transitions. [2022-12-13 00:45:43,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 212 flow [2022-12-13 00:45:43,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 200 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 00:45:43,474 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 133 flow [2022-12-13 00:45:43,474 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2022-12-13 00:45:43,475 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2022-12-13 00:45:43,475 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:43,475 INFO L89 Accepts]: Start accepts. Operand has 36 places, 31 transitions, 133 flow [2022-12-13 00:45:43,475 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:43,475 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:43,476 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 133 flow [2022-12-13 00:45:43,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 133 flow [2022-12-13 00:45:43,482 INFO L130 PetriNetUnfolder]: 19/83 cut-off events. [2022-12-13 00:45:43,482 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-13 00:45:43,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 83 events. 19/83 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 338 event pairs, 3 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 171. Up to 24 conditions per place. [2022-12-13 00:45:43,483 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 31 transitions, 133 flow [2022-12-13 00:45:43,483 INFO L226 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-13 00:45:43,488 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:43,488 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 00:45:43,488 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 133 flow [2022-12-13 00:45:43,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:43,489 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:43,489 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:43,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:45:43,489 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-13 00:45:43,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:43,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2147355310, now seen corresponding path program 2 times [2022-12-13 00:45:43,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:43,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27054578] [2022-12-13 00:45:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:43,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:43,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:43,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27054578] [2022-12-13 00:45:43,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27054578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:43,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:43,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:45:43,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048118692] [2022-12-13 00:45:43,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:43,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:45:43,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:43,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:45:43,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:45:43,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2022-12-13 00:45:43,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:43,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:43,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2022-12-13 00:45:43,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:43,850 INFO L130 PetriNetUnfolder]: 163/322 cut-off events. [2022-12-13 00:45:43,850 INFO L131 PetriNetUnfolder]: For 223/223 co-relation queries the response was YES. [2022-12-13 00:45:43,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 322 events. 163/322 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1310 event pairs, 40 based on Foata normal form. 4/281 useless extension candidates. Maximal degree in co-relation 868. Up to 238 conditions per place. [2022-12-13 00:45:43,852 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 28 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2022-12-13 00:45:43,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 233 flow [2022-12-13 00:45:43,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:45:43,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:45:43,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-13 00:45:43,853 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2022-12-13 00:45:43,853 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 133 flow. Second operand 4 states and 53 transitions. [2022-12-13 00:45:43,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 233 flow [2022-12-13 00:45:43,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:45:43,855 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 148 flow [2022-12-13 00:45:43,855 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 00:45:43,855 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -12 predicate places. [2022-12-13 00:45:43,855 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:43,855 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 148 flow [2022-12-13 00:45:43,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:43,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:43,856 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 148 flow [2022-12-13 00:45:43,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 148 flow [2022-12-13 00:45:43,862 INFO L130 PetriNetUnfolder]: 13/61 cut-off events. [2022-12-13 00:45:43,862 INFO L131 PetriNetUnfolder]: For 69/72 co-relation queries the response was YES. [2022-12-13 00:45:43,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 61 events. 13/61 cut-off events. For 69/72 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 218 event pairs, 2 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 138. Up to 20 conditions per place. [2022-12-13 00:45:43,863 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 148 flow [2022-12-13 00:45:43,863 INFO L226 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-13 00:45:43,868 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:43,869 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 00:45:43,869 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 148 flow [2022-12-13 00:45:43,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:43,869 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:43,870 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:43,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:45:43,870 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-13 00:45:43,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:43,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1676890108, now seen corresponding path program 1 times [2022-12-13 00:45:43,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:43,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485728847] [2022-12-13 00:45:43,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:43,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:44,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:44,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:44,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485728847] [2022-12-13 00:45:44,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485728847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:44,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:44,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:45:44,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203534682] [2022-12-13 00:45:44,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:44,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:45:44,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:44,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:45:44,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:45:44,170 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2022-12-13 00:45:44,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:44,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:44,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2022-12-13 00:45:44,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:44,281 INFO L130 PetriNetUnfolder]: 168/331 cut-off events. [2022-12-13 00:45:44,281 INFO L131 PetriNetUnfolder]: For 374/374 co-relation queries the response was YES. [2022-12-13 00:45:44,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 331 events. 168/331 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1359 event pairs, 47 based on Foata normal form. 1/287 useless extension candidates. Maximal degree in co-relation 932. Up to 241 conditions per place. [2022-12-13 00:45:44,299 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 28 selfloop transitions, 11 changer transitions 0/45 dead transitions. [2022-12-13 00:45:44,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 270 flow [2022-12-13 00:45:44,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:45:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:45:44,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 00:45:44,301 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2022-12-13 00:45:44,301 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 148 flow. Second operand 5 states and 64 transitions. [2022-12-13 00:45:44,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 270 flow [2022-12-13 00:45:44,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 256 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 00:45:44,303 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 186 flow [2022-12-13 00:45:44,303 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2022-12-13 00:45:44,304 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2022-12-13 00:45:44,304 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:44,304 INFO L89 Accepts]: Start accepts. Operand has 43 places, 34 transitions, 186 flow [2022-12-13 00:45:44,305 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:44,305 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:44,305 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 186 flow [2022-12-13 00:45:44,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 186 flow [2022-12-13 00:45:44,342 INFO L130 PetriNetUnfolder]: 21/79 cut-off events. [2022-12-13 00:45:44,342 INFO L131 PetriNetUnfolder]: For 134/140 co-relation queries the response was YES. [2022-12-13 00:45:44,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 79 events. 21/79 cut-off events. For 134/140 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 312 event pairs, 2 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 216. Up to 30 conditions per place. [2022-12-13 00:45:44,343 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 186 flow [2022-12-13 00:45:44,343 INFO L226 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-13 00:45:44,365 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:44,366 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-13 00:45:44,366 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 186 flow [2022-12-13 00:45:44,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:44,366 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:44,367 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:44,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:45:44,367 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-13 00:45:44,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:44,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1676892898, now seen corresponding path program 2 times [2022-12-13 00:45:44,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:44,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824681559] [2022-12-13 00:45:44,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:44,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:44,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:44,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824681559] [2022-12-13 00:45:44,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824681559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:44,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:44,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:45:44,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703506894] [2022-12-13 00:45:44,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:44,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:45:44,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:44,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:45:44,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:45:44,699 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2022-12-13 00:45:44,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:44,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:44,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2022-12-13 00:45:44,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:44,801 INFO L130 PetriNetUnfolder]: 170/336 cut-off events. [2022-12-13 00:45:44,801 INFO L131 PetriNetUnfolder]: For 551/551 co-relation queries the response was YES. [2022-12-13 00:45:44,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 336 events. 170/336 cut-off events. For 551/551 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1406 event pairs, 48 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1027. Up to 245 conditions per place. [2022-12-13 00:45:44,803 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 29 selfloop transitions, 15 changer transitions 0/50 dead transitions. [2022-12-13 00:45:44,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 340 flow [2022-12-13 00:45:44,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:45:44,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:45:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-12-13 00:45:44,804 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5727272727272728 [2022-12-13 00:45:44,805 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 186 flow. Second operand 5 states and 63 transitions. [2022-12-13 00:45:44,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 340 flow [2022-12-13 00:45:44,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 318 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 00:45:44,807 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 257 flow [2022-12-13 00:45:44,807 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2022-12-13 00:45:44,808 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2022-12-13 00:45:44,808 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:44,808 INFO L89 Accepts]: Start accepts. Operand has 46 places, 41 transitions, 257 flow [2022-12-13 00:45:44,808 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:44,808 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:44,808 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 41 transitions, 257 flow [2022-12-13 00:45:44,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 257 flow [2022-12-13 00:45:44,816 INFO L130 PetriNetUnfolder]: 24/81 cut-off events. [2022-12-13 00:45:44,816 INFO L131 PetriNetUnfolder]: For 166/172 co-relation queries the response was YES. [2022-12-13 00:45:44,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 81 events. 24/81 cut-off events. For 166/172 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 320 event pairs, 2 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 252. Up to 30 conditions per place. [2022-12-13 00:45:44,817 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 41 transitions, 257 flow [2022-12-13 00:45:44,817 INFO L226 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-13 00:45:44,818 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [308] $Ultimate##0-->L765: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~x$w_buff0_used~0_156 v_~x$w_buff1_used~0_132) (= 2 v_~x$w_buff0~0_90) (= v_~x$r_buff0_thd2~0_52 1) (= v_~x$r_buff1_thd0~0_81 v_~x$r_buff0_thd0~0_85) (= v_~x$w_buff0~0_91 v_~x$w_buff1~0_77) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) (not (= (mod v_~x$w_buff0_used~0_155 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~x$w_buff0_used~0_155 1) (= v_~x$r_buff1_thd2~0_39 v_~x$r_buff0_thd2~0_53) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff1_thd1~0_33 v_~x$r_buff0_thd1~0_33)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_33, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_53, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_156} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_33, 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_77, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_39, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_33, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_52, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_81, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_155, 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 [276] L740-->L747: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_18 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_83 256) 0)) .cse3)) (.cse1 (and .cse4 .cse5))) (and (= v_~x$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_83)) (= (ite .cse2 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x~0_57 (ite .cse2 v_~x$w_buff0~0_40 (ite .cse0 v_~x$w_buff1~0_37 v_~x~0_58))) (= v_~x$r_buff1_thd1~0_15 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_82 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_17 256) 0)))) 0 v_~x$r_buff1_thd1~0_16)) (= (ite .cse1 0 v_~x$r_buff0_thd1~0_18) v_~x$r_buff0_thd1~0_17)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_18, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_83, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_17, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_82, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_57, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} 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-13 00:45:44,966 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:45:44,967 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-13 00:45:44,967 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 264 flow [2022-12-13 00:45:44,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:44,967 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:44,967 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:44,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:45:44,968 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-13 00:45:44,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:44,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1675938718, now seen corresponding path program 3 times [2022-12-13 00:45:44,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:44,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13080536] [2022-12-13 00:45:44,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:44,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:45,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:45,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13080536] [2022-12-13 00:45:45,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13080536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:45,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:45,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:45:45,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909338204] [2022-12-13 00:45:45,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:45,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:45:45,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:45,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:45:45,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:45:45,374 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2022-12-13 00:45:45,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:45,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:45,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2022-12-13 00:45:45,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:45,540 INFO L130 PetriNetUnfolder]: 220/420 cut-off events. [2022-12-13 00:45:45,540 INFO L131 PetriNetUnfolder]: For 956/956 co-relation queries the response was YES. [2022-12-13 00:45:45,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 420 events. 220/420 cut-off events. For 956/956 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1795 event pairs, 76 based on Foata normal form. 5/372 useless extension candidates. Maximal degree in co-relation 1389. Up to 282 conditions per place. [2022-12-13 00:45:45,543 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 41 selfloop transitions, 18 changer transitions 0/64 dead transitions. [2022-12-13 00:45:45,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 64 transitions, 467 flow [2022-12-13 00:45:45,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:45:45,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:45:45,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-12-13 00:45:45,544 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5093167701863354 [2022-12-13 00:45:45,544 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 264 flow. Second operand 7 states and 82 transitions. [2022-12-13 00:45:45,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 64 transitions, 467 flow [2022-12-13 00:45:45,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 64 transitions, 453 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-13 00:45:45,546 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 338 flow [2022-12-13 00:45:45,547 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=338, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2022-12-13 00:45:45,547 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2022-12-13 00:45:45,547 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:45,547 INFO L89 Accepts]: Start accepts. Operand has 54 places, 46 transitions, 338 flow [2022-12-13 00:45:45,548 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:45,548 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:45,548 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 46 transitions, 338 flow [2022-12-13 00:45:45,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 338 flow [2022-12-13 00:45:45,557 INFO L130 PetriNetUnfolder]: 30/99 cut-off events. [2022-12-13 00:45:45,557 INFO L131 PetriNetUnfolder]: For 326/336 co-relation queries the response was YES. [2022-12-13 00:45:45,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 99 events. 30/99 cut-off events. For 326/336 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 415 event pairs, 2 based on Foata normal form. 4/83 useless extension candidates. Maximal degree in co-relation 370. Up to 36 conditions per place. [2022-12-13 00:45:45,558 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 46 transitions, 338 flow [2022-12-13 00:45:45,558 INFO L226 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-13 00:45:45,559 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:45,559 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 00:45:45,559 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 338 flow [2022-12-13 00:45:45,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:45,560 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:45,560 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:45,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:45:45,560 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-13 00:45:45,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:45,560 INFO L85 PathProgramCache]: Analyzing trace with hash 2143579594, now seen corresponding path program 1 times [2022-12-13 00:45:45,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:45,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949428347] [2022-12-13 00:45:45,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:45,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:45,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:45,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949428347] [2022-12-13 00:45:45,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949428347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:45,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:45,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:45:45,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168602705] [2022-12-13 00:45:45,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:45,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:45:45,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:45,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:45:45,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:45:45,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2022-12-13 00:45:45,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 338 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:45,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:45,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2022-12-13 00:45:45,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:46,020 INFO L130 PetriNetUnfolder]: 214/417 cut-off events. [2022-12-13 00:45:46,021 INFO L131 PetriNetUnfolder]: For 1249/1249 co-relation queries the response was YES. [2022-12-13 00:45:46,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 417 events. 214/417 cut-off events. For 1249/1249 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1888 event pairs, 69 based on Foata normal form. 3/362 useless extension candidates. Maximal degree in co-relation 1598. Up to 283 conditions per place. [2022-12-13 00:45:46,023 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 37 selfloop transitions, 20 changer transitions 0/64 dead transitions. [2022-12-13 00:45:46,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 64 transitions, 530 flow [2022-12-13 00:45:46,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:45:46,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:45:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-13 00:45:46,025 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5507246376811594 [2022-12-13 00:45:46,025 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 338 flow. Second operand 6 states and 76 transitions. [2022-12-13 00:45:46,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 64 transitions, 530 flow [2022-12-13 00:45:46,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 494 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-13 00:45:46,028 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 406 flow [2022-12-13 00:45:46,029 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=406, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2022-12-13 00:45:46,029 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2022-12-13 00:45:46,029 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:46,029 INFO L89 Accepts]: Start accepts. Operand has 58 places, 50 transitions, 406 flow [2022-12-13 00:45:46,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:46,030 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:46,030 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 50 transitions, 406 flow [2022-12-13 00:45:46,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 50 transitions, 406 flow [2022-12-13 00:45:46,040 INFO L130 PetriNetUnfolder]: 33/109 cut-off events. [2022-12-13 00:45:46,040 INFO L131 PetriNetUnfolder]: For 438/449 co-relation queries the response was YES. [2022-12-13 00:45:46,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 109 events. 33/109 cut-off events. For 438/449 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 498 event pairs, 1 based on Foata normal form. 5/91 useless extension candidates. Maximal degree in co-relation 448. Up to 36 conditions per place. [2022-12-13 00:45:46,041 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 50 transitions, 406 flow [2022-12-13 00:45:46,041 INFO L226 LiptonReduction]: Number of co-enabled transitions 326 [2022-12-13 00:45:46,120 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [275] L737-->L740: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [305] L2-1-->L806: Formula: (let ((.cse0 (not (= 0 (mod v_~x$r_buff1_thd0~0_78 256)))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_147 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_82 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse4 (and (not (= 0 (mod v_~x$w_buff0_used~0_148 256))) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_127 256) 0)) .cse0))) (and (= v_~x$r_buff1_thd0~0_77 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_126 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd0~0_81 256) 0)))) 0 v_~x$r_buff1_thd0~0_78)) (= (ite .cse2 0 v_~x$r_buff0_thd0~0_82) v_~x$r_buff0_thd0~0_81) (= (ite (or .cse3 .cse2) 0 v_~x$w_buff1_used~0_127) v_~x$w_buff1_used~0_126) (= v_~x$w_buff0_used~0_147 (ite .cse4 0 v_~x$w_buff0_used~0_148)) (= (ite .cse4 v_~x$w_buff0~0_84 (ite .cse3 v_~x$w_buff1~0_73 v_~x~0_96)) v_~x~0_95)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_84, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_82, ~x$w_buff1~0=v_~x$w_buff1~0_73, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_148} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_84, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_81, ~x$w_buff1~0=v_~x$w_buff1~0_73, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ~x~0=v_~x~0_95, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_147} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:45:46,260 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:45:46,260 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 231 [2022-12-13 00:45:46,260 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 410 flow [2022-12-13 00:45:46,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:46,261 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:46,261 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:46,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:45:46,261 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-13 00:45:46,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:46,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1847091979, now seen corresponding path program 1 times [2022-12-13 00:45:46,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:46,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611897383] [2022-12-13 00:45:46,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:46,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:46,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:46,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:46,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611897383] [2022-12-13 00:45:46,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611897383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:46,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:46,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:45:46,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407903230] [2022-12-13 00:45:46,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:46,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:45:46,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:46,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:45:46,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:45:46,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 00:45:46,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:46,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:46,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 00:45:46,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:46,436 INFO L130 PetriNetUnfolder]: 151/320 cut-off events. [2022-12-13 00:45:46,437 INFO L131 PetriNetUnfolder]: For 1607/1608 co-relation queries the response was YES. [2022-12-13 00:45:46,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 320 events. 151/320 cut-off events. For 1607/1608 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1437 event pairs, 33 based on Foata normal form. 12/259 useless extension candidates. Maximal degree in co-relation 1377. Up to 274 conditions per place. [2022-12-13 00:45:46,438 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 36 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2022-12-13 00:45:46,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 51 transitions, 456 flow [2022-12-13 00:45:46,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:45:46,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:45:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-13 00:45:46,440 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2022-12-13 00:45:46,440 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 410 flow. Second operand 3 states and 49 transitions. [2022-12-13 00:45:46,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 51 transitions, 456 flow [2022-12-13 00:45:46,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 51 transitions, 390 flow, removed 14 selfloop flow, removed 11 redundant places. [2022-12-13 00:45:46,458 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 280 flow [2022-12-13 00:45:46,458 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2022-12-13 00:45:46,459 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2022-12-13 00:45:46,459 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:46,459 INFO L89 Accepts]: Start accepts. Operand has 49 places, 43 transitions, 280 flow [2022-12-13 00:45:46,460 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:46,460 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:46,461 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 43 transitions, 280 flow [2022-12-13 00:45:46,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 43 transitions, 280 flow [2022-12-13 00:45:46,474 INFO L130 PetriNetUnfolder]: 67/183 cut-off events. [2022-12-13 00:45:46,475 INFO L131 PetriNetUnfolder]: For 384/384 co-relation queries the response was YES. [2022-12-13 00:45:46,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 183 events. 67/183 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 969 event pairs, 21 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 641. Up to 85 conditions per place. [2022-12-13 00:45:46,476 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 43 transitions, 280 flow [2022-12-13 00:45:46,476 INFO L226 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-13 00:45:46,477 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [308] $Ultimate##0-->L765: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~x$w_buff0_used~0_156 v_~x$w_buff1_used~0_132) (= 2 v_~x$w_buff0~0_90) (= v_~x$r_buff0_thd2~0_52 1) (= v_~x$r_buff1_thd0~0_81 v_~x$r_buff0_thd0~0_85) (= v_~x$w_buff0~0_91 v_~x$w_buff1~0_77) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) (not (= (mod v_~x$w_buff0_used~0_155 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~x$w_buff0_used~0_155 1) (= v_~x$r_buff1_thd2~0_39 v_~x$r_buff0_thd2~0_53) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff1_thd1~0_33 v_~x$r_buff0_thd1~0_33)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_33, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_53, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_156} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_33, 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_77, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_39, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_33, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_52, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_81, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_155, 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 [275] L737-->L740: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-13 00:45:46,560 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L795-3-->L2-1: Formula: (and (= v_~main$tmp_guard0~0_Out_2 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_In_1) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (mod v_~main$tmp_guard0~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_Out_2|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet6#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [385] L737-->L806: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_409 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_595 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_406 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_596 256) 0)) .cse5)) (.cse4 (and .cse5 .cse2)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_556 256) 0))))) (and (= (ite .cse0 v_~x$w_buff0~0_405 (ite .cse1 v_~x$w_buff1~0_381 1)) v_~x~0_525) (= (ite .cse0 0 v_~x$w_buff0_used~0_596) v_~x$w_buff0_used~0_595) (= v_~x$r_buff1_thd0~0_408 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_405 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_555 256) 0)))) 0 v_~x$r_buff1_thd0~0_409)) (= (ite .cse4 0 v_~x$r_buff0_thd0~0_406) v_~x$r_buff0_thd0~0_405) (= (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_556) v_~x$w_buff1_used~0_555)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_405, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_406, ~x$w_buff1~0=v_~x$w_buff1~0_381, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_556, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_409, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_596} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_405, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_405, ~x$w_buff1~0=v_~x$w_buff1~0_381, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_555, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_408, ~x~0=v_~x~0_525, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_595} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:45:46,813 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [275] L737-->L740: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [384] $Ultimate##0-->L747: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_589 256) 0))) (.cse0 (not (= (mod v_~x$r_buff0_thd1~0_178 256) 0))) (.cse2 (= (mod v_~x$w_buff0_used~0_591 256) 0))) (let ((.cse1 (and .cse0 (not .cse2))) (.cse3 (and .cse0 .cse4))) (and (= (ite .cse0 v_~x$w_buff0~0_401 (ite .cse1 v_~x$w_buff1~0_379 v_~x~0_522)) v_~x~0_521) (= (ite .cse2 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|) (= (ite .cse3 0 v_~x$r_buff0_thd1~0_178) v_~x$r_buff0_thd1~0_177) (= v_~x$r_buff0_thd2~0_145 v_~x$r_buff1_thd2~0_113) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| 0)) (= v_~x$r_buff0_thd0~0_403 v_~x$r_buff1_thd0~0_406) (= v_~x$w_buff0_used~0_589 (ite .cse0 0 1)) (= v_~x$r_buff0_thd2~0_144 1) (= v_~x$w_buff0~0_402 v_~x$w_buff1~0_379) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_31| |v_P1Thread1of1ForFork0_~arg#1.offset_31|) (= v_~x$r_buff1_thd1~0_187 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_551 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_177 256) 0)) .cse4)) 0 v_~x$r_buff0_thd1~0_178)) (= v_~x$w_buff1_used~0_551 (ite (or .cse1 .cse3) 0 v_~x$w_buff0_used~0_591)) (= |v_P1Thread1of1ForFork0_~arg#1.base_31| |v_P1Thread1of1ForFork0_#in~arg#1.base_31|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|) (= 2 v_~x$w_buff0~0_401)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_402, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_403, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_178, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_145, ~x~0=v_~x~0_522, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_591} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_401, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_403, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_177, 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_379, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_551, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_187, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_144, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_406, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_589, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_31|, ~x~0=v_~x~0_521} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~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, ~x~0] [2022-12-13 00:45:46,987 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [275] L737-->L740: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [308] $Ultimate##0-->L765: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~x$w_buff0_used~0_156 v_~x$w_buff1_used~0_132) (= 2 v_~x$w_buff0~0_90) (= v_~x$r_buff0_thd2~0_52 1) (= v_~x$r_buff1_thd0~0_81 v_~x$r_buff0_thd0~0_85) (= v_~x$w_buff0~0_91 v_~x$w_buff1~0_77) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) (not (= (mod v_~x$w_buff0_used~0_155 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~x$w_buff0_used~0_155 1) (= v_~x$r_buff1_thd2~0_39 v_~x$r_buff0_thd2~0_53) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff1_thd1~0_33 v_~x$r_buff0_thd1~0_33)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_33, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_53, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_156} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_33, 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_77, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_39, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_33, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_52, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_81, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_155, 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-13 00:45:47,304 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 00:45:47,304 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 845 [2022-12-13 00:45:47,304 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 296 flow [2022-12-13 00:45:47,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:47,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:47,305 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:47,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:45:47,305 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-13 00:45:47,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:47,305 INFO L85 PathProgramCache]: Analyzing trace with hash 18975324, now seen corresponding path program 1 times [2022-12-13 00:45:47,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:47,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134957834] [2022-12-13 00:45:47,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:47,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:47,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:47,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134957834] [2022-12-13 00:45:47,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134957834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:47,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:47,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:45:47,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955190108] [2022-12-13 00:45:47,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:47,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:45:47,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:47,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:45:47,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:45:47,372 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2022-12-13 00:45:47,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:47,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:47,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2022-12-13 00:45:47,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:47,433 INFO L130 PetriNetUnfolder]: 46/143 cut-off events. [2022-12-13 00:45:47,434 INFO L131 PetriNetUnfolder]: For 441/441 co-relation queries the response was YES. [2022-12-13 00:45:47,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 143 events. 46/143 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 604 event pairs, 6 based on Foata normal form. 27/132 useless extension candidates. Maximal degree in co-relation 616. Up to 58 conditions per place. [2022-12-13 00:45:47,435 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 29 selfloop transitions, 13 changer transitions 1/48 dead transitions. [2022-12-13 00:45:47,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 415 flow [2022-12-13 00:45:47,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:45:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:45:47,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-13 00:45:47,436 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2022-12-13 00:45:47,436 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 296 flow. Second operand 4 states and 59 transitions. [2022-12-13 00:45:47,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 415 flow [2022-12-13 00:45:47,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 363 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-12-13 00:45:47,438 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 263 flow [2022-12-13 00:45:47,438 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2022-12-13 00:45:47,438 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2022-12-13 00:45:47,438 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:47,438 INFO L89 Accepts]: Start accepts. Operand has 50 places, 39 transitions, 263 flow [2022-12-13 00:45:47,439 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:47,439 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:47,439 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 39 transitions, 263 flow [2022-12-13 00:45:47,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 39 transitions, 263 flow [2022-12-13 00:45:47,446 INFO L130 PetriNetUnfolder]: 16/87 cut-off events. [2022-12-13 00:45:47,446 INFO L131 PetriNetUnfolder]: For 67/73 co-relation queries the response was YES. [2022-12-13 00:45:47,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 87 events. 16/87 cut-off events. For 67/73 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 389 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 259. Up to 43 conditions per place. [2022-12-13 00:45:47,447 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 39 transitions, 263 flow [2022-12-13 00:45:47,447 INFO L226 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-13 00:45:48,755 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] L737-->L747: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_615 256) 0))) (.cse2 (= (mod v_~x$w_buff0_used~0_616 256) 0)) (.cse0 (not (= 0 (mod v_~x$r_buff0_thd1~0_192 256))))) (let ((.cse3 (and (not .cse2) .cse0)) (.cse4 (and .cse0 .cse1))) (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_37| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_37|) (= (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_573 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_191 256) 0)))) 0 v_~x$r_buff0_thd1~0_192) v_~x$r_buff1_thd1~0_201) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_37| (ite .cse2 1 0)) (= v_~x$w_buff0_used~0_615 (ite .cse0 0 1)) (= (ite .cse0 v_~x$w_buff0~0_417 (ite .cse3 v_~x$w_buff1~0_391 1)) v_~x~0_541) (= 2 v_~x$w_buff0~0_417) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_37| 0)) (= (ite .cse4 0 v_~x$r_buff0_thd1~0_192) v_~x$r_buff0_thd1~0_191) (= |v_P1Thread1of1ForFork0_~arg#1.base_35| |v_P1Thread1of1ForFork0_#in~arg#1.base_35|) (= v_~x$r_buff0_thd0~0_415 v_~x$r_buff1_thd0~0_418) (= v_~x$w_buff0~0_418 v_~x$w_buff1~0_391) (= v_~x$r_buff0_thd2~0_152 1) (= v_~x$r_buff0_thd2~0_153 v_~x$r_buff1_thd2~0_117) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_35| |v_P1Thread1of1ForFork0_~arg#1.offset_35|) (= v_~x$w_buff1_used~0_573 (ite (or .cse3 .cse4) 0 v_~x$w_buff0_used~0_616))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_418, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_415, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_35|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_192, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_153, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_616} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_417, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_415, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_37|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_191, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_35|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_35|, ~x$w_buff1~0=v_~x$w_buff1~0_391, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_573, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_201, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_37|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_152, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_418, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_615, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_35|, ~x~0=v_~x~0_541} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~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, ~x~0] and [283] L765-->L768: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-13 00:45:48,883 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 00:45:48,884 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1446 [2022-12-13 00:45:48,884 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 253 flow [2022-12-13 00:45:48,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:48,884 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:48,884 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:48,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:45:48,884 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-13 00:45:48,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:48,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1654173619, now seen corresponding path program 1 times [2022-12-13 00:45:48,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:48,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415615205] [2022-12-13 00:45:48,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:48,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:08,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:08,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:08,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415615205] [2022-12-13 00:46:08,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415615205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:08,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:08,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:46:08,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455635323] [2022-12-13 00:46:08,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:08,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:46:08,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:08,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:46:08,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:46:08,235 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-13 00:46:08,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:08,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:08,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-13 00:46:08,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:08,401 INFO L130 PetriNetUnfolder]: 55/155 cut-off events. [2022-12-13 00:46:08,401 INFO L131 PetriNetUnfolder]: For 319/325 co-relation queries the response was YES. [2022-12-13 00:46:08,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 155 events. 55/155 cut-off events. For 319/325 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 732 event pairs, 2 based on Foata normal form. 15/142 useless extension candidates. Maximal degree in co-relation 675. Up to 90 conditions per place. [2022-12-13 00:46:08,402 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 20 selfloop transitions, 4 changer transitions 29/58 dead transitions. [2022-12-13 00:46:08,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 511 flow [2022-12-13 00:46:08,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:46:08,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:46:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-12-13 00:46:08,404 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2022-12-13 00:46:08,404 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 253 flow. Second operand 6 states and 64 transitions. [2022-12-13 00:46:08,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 511 flow [2022-12-13 00:46:08,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 58 transitions, 411 flow, removed 29 selfloop flow, removed 7 redundant places. [2022-12-13 00:46:08,405 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 151 flow [2022-12-13 00:46:08,405 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=151, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2022-12-13 00:46:08,406 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -7 predicate places. [2022-12-13 00:46:08,407 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:08,407 INFO L89 Accepts]: Start accepts. Operand has 44 places, 27 transitions, 151 flow [2022-12-13 00:46:08,407 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:08,407 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:08,407 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 27 transitions, 151 flow [2022-12-13 00:46:08,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 27 transitions, 151 flow [2022-12-13 00:46:08,412 INFO L130 PetriNetUnfolder]: 11/54 cut-off events. [2022-12-13 00:46:08,412 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-13 00:46:08,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 54 events. 11/54 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 218 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 149. Up to 28 conditions per place. [2022-12-13 00:46:08,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 27 transitions, 151 flow [2022-12-13 00:46:08,413 INFO L226 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-13 00:46:08,527 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [275] L737-->L740: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [284] L768-->L775: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$w_buff0_used~0_101 (ite .cse0 0 v_~x$w_buff0_used~0_102)) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_90 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_20)) (= v_~x$w_buff1_used~0_90 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_91)) (= v_~x~0_69 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse4 v_~x$w_buff1~0_43 v_~x~0_70)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_70, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:46:08,590 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] L737-->L775: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd2~0_144 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_201 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_679 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_614 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_680 256) 0))))) (and (= v_~x$r_buff0_thd2~0_200 (ite .cse0 0 v_~x$r_buff0_thd2~0_201)) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_614) v_~x$w_buff1_used~0_613) (= (ite .cse2 v_~x$w_buff0~0_469 (ite .cse1 v_~x$w_buff1~0_421 1)) v_~x~0_577) (= (ite .cse2 0 v_~x$w_buff0_used~0_680) v_~x$w_buff0_used~0_679) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_200 256) 0)) .cse3) (and (not (= 0 (mod v_~x$w_buff1_used~0_613 256))) .cse4)) 0 v_~x$r_buff1_thd2~0_144) v_~x$r_buff1_thd2~0_143)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_469, ~x$w_buff1~0=v_~x$w_buff1~0_421, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_144, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_614, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_201, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_680} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_469, ~x$w_buff1~0=v_~x$w_buff1~0_421, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_143, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_613, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_200, ~x~0=v_~x~0_577, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_679} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [276] L740-->L747: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_18 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_83 256) 0)) .cse3)) (.cse1 (and .cse4 .cse5))) (and (= v_~x$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_83)) (= (ite .cse2 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x~0_57 (ite .cse2 v_~x$w_buff0~0_40 (ite .cse0 v_~x$w_buff1~0_37 v_~x~0_58))) (= v_~x$r_buff1_thd1~0_15 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_82 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_17 256) 0)))) 0 v_~x$r_buff1_thd1~0_16)) (= (ite .cse1 0 v_~x$r_buff0_thd1~0_18) v_~x$r_buff0_thd1~0_17)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_18, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_83, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_17, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_82, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_57, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} 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-13 00:46:09,064 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] $Ultimate##0-->L768: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_39| |v_P1Thread1of1ForFork0_~arg#1.offset_39|) (= v_~y~0_37 v_~__unbuffered_p1_EAX~0_140) (= v_~x$r_buff0_thd2~0_161 v_~x$r_buff1_thd2~0_121) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_41| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_41|) (= v_~x$w_buff0~0_426 v_~x$w_buff1~0_395) (= |v_P1Thread1of1ForFork0_~arg#1.base_39| |v_P1Thread1of1ForFork0_#in~arg#1.base_39|) (= v_~x$w_buff0_used~0_623 1) (= v_~x$r_buff0_thd2~0_160 1) (= v_~x$w_buff0_used~0_624 v_~x$w_buff1_used~0_577) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_41| 0)) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_623 256) 0)) (not (= (mod v_~x$w_buff1_used~0_577 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_41|) (= v_~x$r_buff0_thd1~0_197 v_~x$r_buff1_thd1~0_205) (= 2 v_~x$w_buff0~0_425) (= v_~x$r_buff0_thd0~0_419 v_~x$r_buff1_thd0~0_422)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_426, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_419, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_39|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_197, ~y~0=v_~y~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_161, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_39|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_624} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_425, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_419, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_41|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_197, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_39|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_39|, ~x$w_buff1~0=v_~x$w_buff1~0_395, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_121, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_577, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_205, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_41|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_160, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_422, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_39|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_623, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_140, ~y~0=v_~y~0_37} 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, ~__unbuffered_p1_EAX~0] and [405] $Ultimate##0-->L747: Formula: (let ((.cse14 (not (= (mod v_~x$r_buff0_thd2~0_209 256) 0)))) (let ((.cse6 (and .cse14 (not (= (mod v_~x$w_buff0_used~0_698 256) 0))))) (let ((.cse1 (ite .cse6 0 v_~x$w_buff0_used~0_698))) (let ((.cse10 (not (= (mod .cse1 256) 0))) (.cse9 (not (= (mod v_~x$r_buff1_thd2~0_152 256) 0)))) (let ((.cse7 (and (not (= 0 (mod v_~x$w_buff1_used~0_632 256))) .cse9)) (.cse12 (and .cse10 .cse14))) (let ((.cse11 (ite (or .cse7 .cse12) 0 v_~x$w_buff1_used~0_632))) (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_697 256) 0))) (.cse8 (not (= (mod .cse11 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_240 256) 0))) (.cse13 (not (= (mod v_~x$r_buff0_thd1~0_234 256) 0)))) (let ((.cse0 (and .cse13 .cse10)) (.cse5 (and .cse8 .cse3)) (.cse4 (and .cse2 .cse13))) (and (= v_~x$w_buff0_used~0_697 (ite .cse0 0 .cse1)) (= v_~x$r_buff1_thd1~0_239 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd1~0_233 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_631 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_240)) (= v_~y~0_62 1) (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= v_~x$r_buff0_thd1~0_233 (ite .cse4 0 v_~x$r_buff0_thd1~0_234)) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23) (= (ite .cse0 v_~x$w_buff0~0_477 (ite .cse5 v_~x$w_buff1~0_429 (ite .cse6 v_~x$w_buff0~0_477 (ite .cse7 v_~x$w_buff1~0_429 1)))) v_~x~0_589) (= (ite (or (and .cse8 .cse9) (and (not (= (mod v_~x$r_buff0_thd2~0_208 256) 0)) .cse10)) 0 v_~x$r_buff1_thd2~0_152) v_~x$r_buff1_thd2~0_151) (= (ite (or .cse5 .cse4) 0 .cse11) v_~x$w_buff1_used~0_631) (= (ite .cse12 0 v_~x$r_buff0_thd2~0_209) v_~x$r_buff0_thd2~0_208)))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_477, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_234, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, ~x$w_buff1~0=v_~x$w_buff1~0_429, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_632, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_152, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_240, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_209, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_698} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_477, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_233, ~x$w_buff1~0=v_~x$w_buff1~0_429, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_631, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_151, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_239, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_208, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_697, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, ~y~0=v_~y~0_62, ~x~0=v_~x~0_589} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, P0Thread1of1ForFork1_~arg.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~y~0, ~x~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0] [2022-12-13 00:46:09,342 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] $Ultimate##0-->L768: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_39| |v_P1Thread1of1ForFork0_~arg#1.offset_39|) (= v_~y~0_37 v_~__unbuffered_p1_EAX~0_140) (= v_~x$r_buff0_thd2~0_161 v_~x$r_buff1_thd2~0_121) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_41| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_41|) (= v_~x$w_buff0~0_426 v_~x$w_buff1~0_395) (= |v_P1Thread1of1ForFork0_~arg#1.base_39| |v_P1Thread1of1ForFork0_#in~arg#1.base_39|) (= v_~x$w_buff0_used~0_623 1) (= v_~x$r_buff0_thd2~0_160 1) (= v_~x$w_buff0_used~0_624 v_~x$w_buff1_used~0_577) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_41| 0)) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_623 256) 0)) (not (= (mod v_~x$w_buff1_used~0_577 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_41|) (= v_~x$r_buff0_thd1~0_197 v_~x$r_buff1_thd1~0_205) (= 2 v_~x$w_buff0~0_425) (= v_~x$r_buff0_thd0~0_419 v_~x$r_buff1_thd0~0_422)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_426, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_419, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_39|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_197, ~y~0=v_~y~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_161, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_39|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_624} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_425, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_419, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_41|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_197, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_39|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_39|, ~x$w_buff1~0=v_~x$w_buff1~0_395, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_121, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_577, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_205, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_41|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_160, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_422, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_39|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_623, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_140, ~y~0=v_~y~0_37} 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, ~__unbuffered_p1_EAX~0] and [404] $Ultimate##0-->L747: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_236 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_230 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_693 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_694 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_628 256) 0))))) (and (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_~x$w_buff1_used~0_627 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_628)) (= v_~x$w_buff0_used~0_693 (ite .cse2 0 v_~x$w_buff0_used~0_694)) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= (ite .cse0 0 v_~x$r_buff0_thd1~0_230) v_~x$r_buff0_thd1~0_229) (= v_~y~0_60 1) (= v_~x$r_buff1_thd1~0_235 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_229 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_627 256) 0)))) 0 v_~x$r_buff1_thd1~0_236)) (= (ite .cse2 v_~x$w_buff0~0_475 (ite .cse1 v_~x$w_buff1~0_427 1)) v_~x~0_587)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_475, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_230, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~x$w_buff1~0=v_~x$w_buff1~0_427, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_628, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_236, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_694} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_475, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_229, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~x$w_buff1~0=v_~x$w_buff1~0_427, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_627, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_235, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_60, ~x~0=v_~x~0_587, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_693} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, P0Thread1of1ForFork1_~arg.offset, ~x$r_buff1_thd1~0, ~y~0, ~x~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0] [2022-12-13 00:46:09,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [407] $Ultimate##0-->L747: Formula: (let ((.cse4 (= (mod v_~x$w_buff0_used~0_709 256) 0)) (.cse3 (not (= (mod v_~x$w_buff0_used~0_707 256) 0))) (.cse0 (not (= (mod v_~x$r_buff0_thd1~0_242 256) 0)))) (let ((.cse2 (and .cse3 .cse0)) (.cse1 (and (not .cse4) .cse0))) (and (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_59| |v_P1Thread1of1ForFork0_~arg#1.offset_59|) (= (ite .cse0 0 1) v_~x$w_buff0_used~0_707) (= v_P0Thread1of1ForFork1_~arg.offset_27 |v_P0Thread1of1ForFork1_#in~arg.offset_27|) (= |v_P1Thread1of1ForFork0_~arg#1.base_59| |v_P1Thread1of1ForFork0_#in~arg#1.base_59|) (= v_~x$w_buff1_used~0_639 (ite (or .cse1 .cse2) 0 v_~x$w_buff0_used~0_709)) (= v_~x$r_buff0_thd1~0_241 (ite .cse2 0 v_~x$r_buff0_thd1~0_242)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_61| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_61|) (= v_~x$r_buff0_thd2~0_218 1) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_241 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_639 256) 0)) .cse0)) 0 v_~x$r_buff0_thd1~0_242) v_~x$r_buff1_thd1~0_247) (= (ite .cse4 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_61|) (= (ite .cse0 v_~x$w_buff0~0_483 (ite .cse1 v_~x$w_buff1~0_433 1)) v_~x~0_593) (= v_~x$w_buff0~0_484 v_~x$w_buff1~0_433) (= 2 v_~x$w_buff0~0_483) (= v_~y~0_68 1) (= v_~y~0_69 v_~__unbuffered_p1_EAX~0_162) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_61| 0)) (= v_~x$r_buff0_thd0~0_451 v_~x$r_buff1_thd0~0_456) (= |v_P0Thread1of1ForFork1_#in~arg.base_27| v_P0Thread1of1ForFork1_~arg.base_27) (= v_~x$r_buff0_thd2~0_219 v_~x$r_buff1_thd2~0_159)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_484, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_451, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_59|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_242, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_27|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_27|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_219, ~y~0=v_~y~0_69, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_59|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_709} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_483, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_451, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_61|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_241, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_59|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_59|, ~x$w_buff1~0=v_~x$w_buff1~0_433, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_639, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_159, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_247, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_27|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_61|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_218, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_456, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_27, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_59|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_707, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_162, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_27|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_27, ~y~0=v_~y~0_68, ~x~0=v_~x~0_593} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~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, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~y~0, ~x~0] and [284] L768-->L775: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$w_buff0_used~0_101 (ite .cse0 0 v_~x$w_buff0_used~0_102)) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_90 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_20)) (= v_~x$w_buff1_used~0_90 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_91)) (= v_~x~0_69 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse4 v_~x$w_buff1~0_43 v_~x~0_70)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_70, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:46:09,837 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 00:46:09,838 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1431 [2022-12-13 00:46:09,838 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 134 flow [2022-12-13 00:46:09,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:09,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:09,838 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:09,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:46:09,838 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-13 00:46:09,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:09,839 INFO L85 PathProgramCache]: Analyzing trace with hash 22398777, now seen corresponding path program 1 times [2022-12-13 00:46:09,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:09,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909613025] [2022-12-13 00:46:09,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:09,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:29,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:29,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:29,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909613025] [2022-12-13 00:46:29,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909613025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:29,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:29,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:46:29,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838854066] [2022-12-13 00:46:29,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:29,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:46:29,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:29,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:46:29,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:46:29,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 16 [2022-12-13 00:46:29,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:29,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:29,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 16 [2022-12-13 00:46:29,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:30,030 INFO L130 PetriNetUnfolder]: 21/70 cut-off events. [2022-12-13 00:46:30,030 INFO L131 PetriNetUnfolder]: For 125/127 co-relation queries the response was YES. [2022-12-13 00:46:30,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 70 events. 21/70 cut-off events. For 125/127 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 287 event pairs, 0 based on Foata normal form. 11/63 useless extension candidates. Maximal degree in co-relation 241. Up to 46 conditions per place. [2022-12-13 00:46:30,031 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 12 selfloop transitions, 3 changer transitions 10/30 dead transitions. [2022-12-13 00:46:30,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 30 transitions, 224 flow [2022-12-13 00:46:30,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:46:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:46:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-12-13 00:46:30,033 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4125 [2022-12-13 00:46:30,033 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 134 flow. Second operand 5 states and 33 transitions. [2022-12-13 00:46:30,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 30 transitions, 224 flow [2022-12-13 00:46:30,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 195 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-12-13 00:46:30,034 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 103 flow [2022-12-13 00:46:30,034 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2022-12-13 00:46:30,034 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -20 predicate places. [2022-12-13 00:46:30,034 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:30,034 INFO L89 Accepts]: Start accepts. Operand has 31 places, 20 transitions, 103 flow [2022-12-13 00:46:30,036 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:30,036 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:30,036 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 103 flow [2022-12-13 00:46:30,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 103 flow [2022-12-13 00:46:30,040 INFO L130 PetriNetUnfolder]: 10/40 cut-off events. [2022-12-13 00:46:30,040 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-13 00:46:30,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 40 events. 10/40 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 125 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 105. Up to 28 conditions per place. [2022-12-13 00:46:30,041 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 20 transitions, 103 flow [2022-12-13 00:46:30,041 INFO L226 LiptonReduction]: Number of co-enabled transitions 28 [2022-12-13 00:46:30,041 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:30,041 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 00:46:30,042 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 103 flow [2022-12-13 00:46:30,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:30,042 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:30,042 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:30,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:46:30,042 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:46:30,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:30,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1663564509, now seen corresponding path program 1 times [2022-12-13 00:46:30,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:30,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366363830] [2022-12-13 00:46:30,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:30,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:46:30,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:46:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:46:30,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:46:30,103 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:46:30,104 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 00:46:30,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 00:46:30,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 00:46:30,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 00:46:30,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 00:46:30,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 00:46:30,108 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:30,111 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:46:30,111 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:46:30,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:46:30 BasicIcfg [2022-12-13 00:46:30,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:46:30,159 INFO L158 Benchmark]: Toolchain (without parser) took 55810.12ms. Allocated memory was 238.0MB in the beginning and 807.4MB in the end (delta: 569.4MB). Free memory was 213.1MB in the beginning and 621.3MB in the end (delta: -408.2MB). Peak memory consumption was 160.8MB. Max. memory is 8.0GB. [2022-12-13 00:46:30,159 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 238.0MB. Free memory is still 213.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:46:30,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.00ms. Allocated memory is still 238.0MB. Free memory was 213.1MB in the beginning and 188.1MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 00:46:30,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.66ms. Allocated memory is still 238.0MB. Free memory was 188.1MB in the beginning and 185.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:46:30,159 INFO L158 Benchmark]: Boogie Preprocessor took 26.59ms. Allocated memory is still 238.0MB. Free memory was 185.5MB in the beginning and 183.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:46:30,160 INFO L158 Benchmark]: RCFGBuilder took 582.09ms. Allocated memory is still 238.0MB. Free memory was 183.9MB in the beginning and 152.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-13 00:46:30,160 INFO L158 Benchmark]: TraceAbstraction took 54761.34ms. Allocated memory was 238.0MB in the beginning and 807.4MB in the end (delta: 569.4MB). Free memory was 151.4MB in the beginning and 621.3MB in the end (delta: -469.9MB). Peak memory consumption was 98.9MB. Max. memory is 8.0GB. [2022-12-13 00:46:30,161 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 238.0MB. Free memory is still 213.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 382.00ms. Allocated memory is still 238.0MB. Free memory was 213.1MB in the beginning and 188.1MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.66ms. Allocated memory is still 238.0MB. Free memory was 188.1MB in the beginning and 185.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.59ms. Allocated memory is still 238.0MB. Free memory was 185.5MB in the beginning and 183.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 582.09ms. Allocated memory is still 238.0MB. Free memory was 183.9MB in the beginning and 152.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 54761.34ms. Allocated memory was 238.0MB in the beginning and 807.4MB in the end (delta: 569.4MB). Free memory was 151.4MB in the beginning and 621.3MB in the end (delta: -469.9MB). Peak memory consumption was 98.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 90 PlacesBefore, 51 PlacesAfterwards, 85 TransitionsBefore, 44 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 32 ConcurrentYvCompositions, 2 ChoiceCompositions, 71 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1627, independent: 1427, independent conditional: 1427, independent unconditional: 0, dependent: 200, dependent conditional: 200, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1627, independent: 1427, independent conditional: 0, independent unconditional: 1427, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1627, independent: 1427, independent conditional: 0, independent unconditional: 1427, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1627, independent: 1427, independent conditional: 0, independent unconditional: 1427, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 892, independent: 839, independent conditional: 0, independent unconditional: 839, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 892, independent: 822, independent conditional: 0, independent unconditional: 822, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 418, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 406, dependent conditional: 0, dependent unconditional: 406, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1627, independent: 588, independent conditional: 0, independent unconditional: 588, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 892, unknown conditional: 0, unknown unconditional: 892] , Statistics on independence cache: Total cache size (in pairs): 1335, Positive cache size: 1282, Positive conditional cache size: 0, Positive unconditional cache size: 1282, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 29 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 146, independent: 122, independent conditional: 122, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 146, independent: 122, independent conditional: 9, independent unconditional: 113, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 146, independent: 122, independent conditional: 9, independent unconditional: 113, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 146, independent: 122, independent conditional: 9, independent unconditional: 113, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 118, independent: 101, independent conditional: 6, independent unconditional: 95, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 118, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 60, dependent conditional: 7, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 146, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 118, unknown conditional: 7, unknown unconditional: 111] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 101, Positive conditional cache size: 6, Positive unconditional cache size: 95, Negative cache size: 17, Negative conditional cache size: 1, 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.0s, 30 PlacesBefore, 30 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 107, independent: 86, independent conditional: 86, 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: 107, independent: 86, independent conditional: 6, independent unconditional: 80, 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: 107, independent: 86, independent conditional: 5, independent unconditional: 81, 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: 107, independent: 86, independent conditional: 5, independent unconditional: 81, 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: 12, independent: 10, independent conditional: 4, independent unconditional: 6, 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: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 107, independent: 76, independent conditional: 1, independent unconditional: 75, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 12, unknown conditional: 4, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 111, Positive conditional cache size: 10, Positive unconditional cache size: 101, Negative cache size: 19, Negative conditional cache size: 1, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 79, independent conditional: 9, independent unconditional: 70, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, independent: 79, independent conditional: 6, independent unconditional: 73, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, independent: 79, independent conditional: 6, independent unconditional: 73, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 3, independent unconditional: 6, 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: 11, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, independent: 70, independent conditional: 3, independent unconditional: 67, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 11, unknown conditional: 3, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 120, Positive conditional cache size: 13, Positive unconditional cache size: 107, Negative cache size: 21, Negative conditional cache size: 1, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 76, independent: 66, independent conditional: 18, independent unconditional: 48, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 66, independent conditional: 16, independent unconditional: 50, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 66, independent conditional: 16, independent unconditional: 50, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, independent: 60, independent conditional: 15, independent unconditional: 45, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 126, Positive conditional cache size: 14, Positive unconditional cache size: 112, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 55, independent conditional: 55, 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: 66, independent: 55, independent conditional: 18, independent unconditional: 37, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 55, independent conditional: 12, independent unconditional: 43, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 55, independent conditional: 12, independent unconditional: 43, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 53, independent conditional: 11, independent unconditional: 42, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 128, Positive conditional cache size: 15, Positive unconditional cache size: 113, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, 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: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 53, independent conditional: 53, 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: 65, independent: 53, independent conditional: 17, independent unconditional: 36, 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: 65, independent: 53, independent conditional: 14, independent unconditional: 39, 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: 65, independent: 53, independent conditional: 14, independent unconditional: 39, 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: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, independent: 53, independent conditional: 14, independent unconditional: 39, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 128, Positive conditional cache size: 15, Positive unconditional cache size: 113, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 46 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 151, independent: 117, independent conditional: 117, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 151, independent: 117, independent conditional: 11, independent unconditional: 106, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 151, independent: 117, independent conditional: 11, independent unconditional: 106, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 151, independent: 117, independent conditional: 11, independent unconditional: 106, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 151, independent: 114, independent conditional: 9, independent unconditional: 105, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 132, Positive conditional cache size: 17, Positive unconditional cache size: 115, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, 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, 54 PlacesBefore, 54 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 73, independent: 64, independent conditional: 17, independent unconditional: 47, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 73, independent: 64, independent conditional: 13, independent unconditional: 51, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 73, independent: 64, independent conditional: 13, independent unconditional: 51, dependent: 9, dependent conditional: 0, dependent unconditional: 9, 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: 73, independent: 64, independent conditional: 13, independent unconditional: 51, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 132, Positive conditional cache size: 17, Positive unconditional cache size: 115, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 58 PlacesBefore, 57 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 193, independent: 172, independent conditional: 172, 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: 193, independent: 172, independent conditional: 49, independent unconditional: 123, dependent: 21, dependent conditional: 12, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 193, independent: 172, independent conditional: 30, independent unconditional: 142, 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: 193, independent: 172, independent conditional: 30, independent unconditional: 142, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 193, independent: 170, independent conditional: 30, independent unconditional: 140, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 149, Positive conditional cache size: 17, Positive unconditional cache size: 132, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 49 PlacesBefore, 48 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 192, independent: 168, independent conditional: 168, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 192, independent: 168, independent conditional: 36, independent unconditional: 132, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 192, independent: 168, independent conditional: 21, independent unconditional: 147, dependent: 24, dependent conditional: 15, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 192, independent: 168, independent conditional: 21, independent unconditional: 147, dependent: 24, dependent conditional: 15, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 192, independent: 161, independent conditional: 16, independent unconditional: 145, dependent: 22, dependent conditional: 13, dependent unconditional: 9, unknown: 9, unknown conditional: 7, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 179, Positive conditional cache size: 22, Positive unconditional cache size: 157, Negative cache size: 27, Negative conditional cache size: 5, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 49 PlacesBefore, 45 PlacesAfterwards, 39 TransitionsBefore, 35 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123, independent: 102, independent conditional: 102, 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: 123, independent: 102, independent conditional: 64, independent unconditional: 38, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 123, independent: 102, independent conditional: 64, independent unconditional: 38, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 123, independent: 102, independent conditional: 64, independent unconditional: 38, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 123, independent: 98, independent conditional: 61, independent unconditional: 37, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 196, Positive conditional cache size: 25, Positive unconditional cache size: 171, Negative cache size: 27, Negative conditional cache size: 5, Negative unconditional cache size: 22, 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: 1.4s, 39 PlacesBefore, 33 PlacesAfterwards, 27 TransitionsBefore, 22 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 19, independent unconditional: 5, 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: 24, independent: 24, independent conditional: 17, independent unconditional: 7, 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: 24, independent: 24, independent conditional: 17, independent unconditional: 7, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 19, independent conditional: 13, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 235, Positive conditional cache size: 29, Positive unconditional cache size: 206, Negative cache size: 27, Negative conditional cache size: 5, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 28 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 235, Positive conditional cache size: 29, Positive unconditional cache size: 206, Negative cache size: 27, Negative conditional cache size: 5, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447, ((void *)0), P0, ((void *)0))=-2, t1447={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] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448, ((void *)0), P1, ((void *)0))=-1, t1447={5:0}, t1448={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] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 [L767] 2 __unbuffered_p1_EAX = y [L736] 2 y = 1 [L739] 2 x = 1 [L770] 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) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 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 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 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 [L742] 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) [L743] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 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 [L745] 2 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 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 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 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) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 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 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 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 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 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) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 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)) [L818] 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)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - 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: 795]: 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, 105 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: 54.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 217 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 217 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 782 IncrementalHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 13 mSDtfsCounter, 782 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=410occurred in iteration=9, InterpolantAutomatonStates: 59, 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, 42.2s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 1237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:46:30,209 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...