/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:37:56,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:37:56,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:37:56,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:37:56,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:37:56,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:37:56,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:37:56,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:37:56,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:37:56,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:37:56,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:37:56,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:37:56,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:37:56,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:37:56,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:37:56,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:37:56,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:37:56,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:37:56,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:37:56,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:37:56,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:37:56,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:37:56,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:37:56,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:37:56,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:37:56,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:37:56,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:37:56,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:37:56,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:37:56,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:37:56,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:37:56,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:37:56,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:37:56,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:37:56,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:37:56,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:37:56,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:37:56,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:37:56,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:37:56,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:37:56,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:37:56,733 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:37:56,768 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:37:56,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:37:56,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:37:56,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:37:56,770 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:37:56,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:37:56,771 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:37:56,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:37:56,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:37:56,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:37:56,771 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:37:56,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:37:56,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:37:56,772 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:37:56,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:37:56,772 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:37:56,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:37:56,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:37:56,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:37:56,773 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:37:56,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:37:56,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:37:56,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:37:56,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:37:56,773 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:37:56,773 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:37:56,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:37:56,774 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:37:56,774 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:37:57,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:37:57,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:37:57,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:37:57,114 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:37:57,114 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:37:57,116 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i [2022-12-06 06:37:58,198 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:37:58,427 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:37:58,431 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i [2022-12-06 06:37:58,441 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f82c2bb15/5b9f4ad8fdc44f769f9e451e51f7686b/FLAG61b6ff022 [2022-12-06 06:37:58,452 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f82c2bb15/5b9f4ad8fdc44f769f9e451e51f7686b [2022-12-06 06:37:58,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:37:58,454 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:37:58,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:37:58,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:37:58,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:37:58,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:37:58" (1/1) ... [2022-12-06 06:37:58,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28454311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:58, skipping insertion in model container [2022-12-06 06:37:58,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:37:58" (1/1) ... [2022-12-06 06:37:58,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:37:58,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:37:58,638 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/safe011_power.opt_pso.opt.i[959,972] [2022-12-06 06:37:58,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:37:58,842 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:37:58,853 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/safe011_power.opt_pso.opt.i[959,972] [2022-12-06 06:37:58,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:58,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:58,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:37:58,939 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:37:58,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:58 WrapperNode [2022-12-06 06:37:58,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:37:58,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:37:58,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:37:58,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:37:58,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:58" (1/1) ... [2022-12-06 06:37:58,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:58" (1/1) ... [2022-12-06 06:37:59,003 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-06 06:37:59,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:37:59,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:37:59,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:37:59,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:37:59,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:58" (1/1) ... [2022-12-06 06:37:59,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:58" (1/1) ... [2022-12-06 06:37:59,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:58" (1/1) ... [2022-12-06 06:37:59,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:58" (1/1) ... [2022-12-06 06:37:59,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:58" (1/1) ... [2022-12-06 06:37:59,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:58" (1/1) ... [2022-12-06 06:37:59,045 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:58" (1/1) ... [2022-12-06 06:37:59,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:58" (1/1) ... [2022-12-06 06:37:59,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:37:59,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:37:59,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:37:59,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:37:59,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:58" (1/1) ... [2022-12-06 06:37:59,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:37:59,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:37:59,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:37:59,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:37:59,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:37:59,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:37:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:37:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:37:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:37:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:37:59,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:37:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:37:59,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:37:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:37:59,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:37:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:37:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:37:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:37:59,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:37:59,177 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:37:59,332 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:37:59,343 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:37:59,627 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:37:59,795 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:37:59,795 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:37:59,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:37:59 BoogieIcfgContainer [2022-12-06 06:37:59,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:37:59,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:37:59,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:37:59,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:37:59,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:37:58" (1/3) ... [2022-12-06 06:37:59,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192f3bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:37:59, skipping insertion in model container [2022-12-06 06:37:59,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:58" (2/3) ... [2022-12-06 06:37:59,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192f3bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:37:59, skipping insertion in model container [2022-12-06 06:37:59,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:37:59" (3/3) ... [2022-12-06 06:37:59,805 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i [2022-12-06 06:37:59,822 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:37:59,822 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:37:59,822 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:37:59,894 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:37:59,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 06:37:59,980 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 06:37:59,980 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:37:59,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:37:59,987 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 06:37:59,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-06 06:37:59,992 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:00,016 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 06:38:00,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-06 06:38:00,059 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 06:38:00,060 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:38:00,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:38:00,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 06:38:00,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 1906 [2022-12-06 06:38:04,938 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-06 06:38:04,955 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:38:04,960 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;@4ae6f3ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:38:04,961 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:38:04,966 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-06 06:38:04,967 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:38:04,967 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:04,967 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:38:04,968 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:04,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:04,971 INFO L85 PathProgramCache]: Analyzing trace with hash 445773821, now seen corresponding path program 1 times [2022-12-06 06:38:04,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:04,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369652450] [2022-12-06 06:38:04,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:04,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:05,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:05,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:05,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369652450] [2022-12-06 06:38:05,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369652450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:05,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:05,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:38:05,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25871485] [2022-12-06 06:38:05,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:05,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:38:05,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:05,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:38:05,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:38:05,330 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:38:05,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:05,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:05,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:38:05,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:05,611 INFO L130 PetriNetUnfolder]: 879/1434 cut-off events. [2022-12-06 06:38:05,611 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 06:38:05,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2801 conditions, 1434 events. 879/1434 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7472 event pairs, 144 based on Foata normal form. 0/1281 useless extension candidates. Maximal degree in co-relation 2790. Up to 1060 conditions per place. [2022-12-06 06:38:05,624 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 27 selfloop transitions, 2 changer transitions 6/38 dead transitions. [2022-12-06 06:38:05,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 158 flow [2022-12-06 06:38:05,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:38:05,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:38:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 06:38:05,633 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2022-12-06 06:38:05,634 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 49 transitions. [2022-12-06 06:38:05,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 158 flow [2022-12-06 06:38:05,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:38:05,638 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 52 flow [2022-12-06 06:38:05,639 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2022-12-06 06:38:05,643 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 06:38:05,643 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:05,644 INFO L89 Accepts]: Start accepts. Operand has 33 places, 21 transitions, 52 flow [2022-12-06 06:38:05,646 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:05,646 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:05,646 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 52 flow [2022-12-06 06:38:05,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 06:38:05,651 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 06:38:05,651 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:38:05,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:38:05,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 06:38:05,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 06:38:05,712 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:05,714 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-06 06:38:05,714 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 06:38:05,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:05,714 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:05,715 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:05,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:38:05,718 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:05,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:05,718 INFO L85 PathProgramCache]: Analyzing trace with hash 300536112, now seen corresponding path program 1 times [2022-12-06 06:38:05,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:05,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378438419] [2022-12-06 06:38:05,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:05,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:06,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:06,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378438419] [2022-12-06 06:38:06,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378438419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:06,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:06,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:38:06,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024346852] [2022-12-06 06:38:06,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:06,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:38:06,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:06,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:38:06,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:38:06,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 06:38:06,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:06,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:06,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 06:38:06,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:06,429 INFO L130 PetriNetUnfolder]: 1040/1564 cut-off events. [2022-12-06 06:38:06,429 INFO L131 PetriNetUnfolder]: For 124/124 co-relation queries the response was YES. [2022-12-06 06:38:06,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3302 conditions, 1564 events. 1040/1564 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6775 event pairs, 379 based on Foata normal form. 28/1591 useless extension candidates. Maximal degree in co-relation 3292. Up to 1347 conditions per place. [2022-12-06 06:38:06,436 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 32 selfloop transitions, 10 changer transitions 0/43 dead transitions. [2022-12-06 06:38:06,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 188 flow [2022-12-06 06:38:06,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:38:06,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:38:06,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 06:38:06,438 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 06:38:06,438 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 4 states and 48 transitions. [2022-12-06 06:38:06,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 188 flow [2022-12-06 06:38:06,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:38:06,440 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 111 flow [2022-12-06 06:38:06,440 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2022-12-06 06:38:06,440 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 06:38:06,440 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:06,441 INFO L89 Accepts]: Start accepts. Operand has 33 places, 29 transitions, 111 flow [2022-12-06 06:38:06,441 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:06,441 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:06,441 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 29 transitions, 111 flow [2022-12-06 06:38:06,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 111 flow [2022-12-06 06:38:06,483 INFO L130 PetriNetUnfolder]: 144/284 cut-off events. [2022-12-06 06:38:06,484 INFO L131 PetriNetUnfolder]: For 38/39 co-relation queries the response was YES. [2022-12-06 06:38:06,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 284 events. 144/284 cut-off events. For 38/39 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1323 event pairs, 81 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 620. Up to 212 conditions per place. [2022-12-06 06:38:06,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 29 transitions, 111 flow [2022-12-06 06:38:06,486 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 06:38:06,499 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:06,500 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 06:38:06,501 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 111 flow [2022-12-06 06:38:06,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:06,501 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:06,501 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:06,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:38:06,501 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:06,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:06,502 INFO L85 PathProgramCache]: Analyzing trace with hash 726683029, now seen corresponding path program 1 times [2022-12-06 06:38:06,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:06,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703200768] [2022-12-06 06:38:06,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:06,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:06,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:06,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703200768] [2022-12-06 06:38:06,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703200768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:06,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:06,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:38:06,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951533353] [2022-12-06 06:38:06,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:06,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:38:06,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:06,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:38:06,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:38:06,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-06 06:38:06,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:06,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:06,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-06 06:38:06,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:06,786 INFO L130 PetriNetUnfolder]: 728/1141 cut-off events. [2022-12-06 06:38:06,787 INFO L131 PetriNetUnfolder]: For 484/484 co-relation queries the response was YES. [2022-12-06 06:38:06,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3221 conditions, 1141 events. 728/1141 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5106 event pairs, 139 based on Foata normal form. 12/1149 useless extension candidates. Maximal degree in co-relation 3209. Up to 868 conditions per place. [2022-12-06 06:38:06,793 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 31 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2022-12-06 06:38:06,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 204 flow [2022-12-06 06:38:06,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:38:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:38:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 06:38:06,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 06:38:06,796 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 111 flow. Second operand 3 states and 36 transitions. [2022-12-06 06:38:06,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 204 flow [2022-12-06 06:38:06,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 204 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:38:06,799 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 119 flow [2022-12-06 06:38:06,799 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2022-12-06 06:38:06,800 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2022-12-06 06:38:06,800 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:06,801 INFO L89 Accepts]: Start accepts. Operand has 36 places, 29 transitions, 119 flow [2022-12-06 06:38:06,802 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:06,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:06,802 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 119 flow [2022-12-06 06:38:06,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 119 flow [2022-12-06 06:38:06,831 INFO L130 PetriNetUnfolder]: 145/289 cut-off events. [2022-12-06 06:38:06,831 INFO L131 PetriNetUnfolder]: For 84/85 co-relation queries the response was YES. [2022-12-06 06:38:06,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 289 events. 145/289 cut-off events. For 84/85 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1363 event pairs, 78 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 652. Up to 212 conditions per place. [2022-12-06 06:38:06,833 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 119 flow [2022-12-06 06:38:06,834 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-06 06:38:06,836 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:06,837 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 06:38:06,838 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 119 flow [2022-12-06 06:38:06,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:06,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:06,838 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:06,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:38:06,838 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:06,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:06,839 INFO L85 PathProgramCache]: Analyzing trace with hash 731692948, now seen corresponding path program 1 times [2022-12-06 06:38:06,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:06,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916499521] [2022-12-06 06:38:06,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:06,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:07,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:07,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916499521] [2022-12-06 06:38:07,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916499521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:07,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:07,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:38:07,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834654576] [2022-12-06 06:38:07,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:07,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:38:07,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:07,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:38:07,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:38:07,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:38:07,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:07,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:07,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:38:07,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:07,417 INFO L130 PetriNetUnfolder]: 909/1464 cut-off events. [2022-12-06 06:38:07,417 INFO L131 PetriNetUnfolder]: For 797/804 co-relation queries the response was YES. [2022-12-06 06:38:07,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4133 conditions, 1464 events. 909/1464 cut-off events. For 797/804 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7124 event pairs, 206 based on Foata normal form. 14/1452 useless extension candidates. Maximal degree in co-relation 4118. Up to 1256 conditions per place. [2022-12-06 06:38:07,423 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 39 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2022-12-06 06:38:07,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 269 flow [2022-12-06 06:38:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:38:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:38:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 06:38:07,425 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2022-12-06 06:38:07,425 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 119 flow. Second operand 3 states and 38 transitions. [2022-12-06 06:38:07,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 269 flow [2022-12-06 06:38:07,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:38:07,427 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 146 flow [2022-12-06 06:38:07,427 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2022-12-06 06:38:07,428 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2022-12-06 06:38:07,428 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:07,428 INFO L89 Accepts]: Start accepts. Operand has 37 places, 32 transitions, 146 flow [2022-12-06 06:38:07,428 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:07,428 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:07,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 32 transitions, 146 flow [2022-12-06 06:38:07,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 146 flow [2022-12-06 06:38:07,461 INFO L130 PetriNetUnfolder]: 184/365 cut-off events. [2022-12-06 06:38:07,461 INFO L131 PetriNetUnfolder]: For 208/210 co-relation queries the response was YES. [2022-12-06 06:38:07,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 365 events. 184/365 cut-off events. For 208/210 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1850 event pairs, 91 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 891. Up to 253 conditions per place. [2022-12-06 06:38:07,463 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 32 transitions, 146 flow [2022-12-06 06:38:07,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-06 06:38:07,465 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:07,466 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 06:38:07,466 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 146 flow [2022-12-06 06:38:07,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:07,466 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:07,466 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:07,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:38:07,466 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:07,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:07,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1207699291, now seen corresponding path program 1 times [2022-12-06 06:38:07,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:07,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982556884] [2022-12-06 06:38:07,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:07,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:07,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:07,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982556884] [2022-12-06 06:38:07,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982556884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:07,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:07,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:38:07,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435546508] [2022-12-06 06:38:07,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:07,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:38:07,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:07,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:38:07,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:38:07,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:38:07,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:07,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:07,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:38:07,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:07,835 INFO L130 PetriNetUnfolder]: 1324/2067 cut-off events. [2022-12-06 06:38:07,835 INFO L131 PetriNetUnfolder]: For 1845/1884 co-relation queries the response was YES. [2022-12-06 06:38:07,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6053 conditions, 2067 events. 1324/2067 cut-off events. For 1845/1884 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10233 event pairs, 242 based on Foata normal form. 112/2141 useless extension candidates. Maximal degree in co-relation 6037. Up to 1007 conditions per place. [2022-12-06 06:38:07,845 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 52 selfloop transitions, 3 changer transitions 3/62 dead transitions. [2022-12-06 06:38:07,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 62 transitions, 376 flow [2022-12-06 06:38:07,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:38:07,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:38:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 06:38:07,847 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 06:38:07,848 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 146 flow. Second operand 4 states and 48 transitions. [2022-12-06 06:38:07,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 62 transitions, 376 flow [2022-12-06 06:38:07,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 62 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:38:07,854 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 154 flow [2022-12-06 06:38:07,854 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2022-12-06 06:38:07,855 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-06 06:38:07,855 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:07,855 INFO L89 Accepts]: Start accepts. Operand has 41 places, 32 transitions, 154 flow [2022-12-06 06:38:07,857 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:07,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:07,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 32 transitions, 154 flow [2022-12-06 06:38:07,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 154 flow [2022-12-06 06:38:07,897 INFO L130 PetriNetUnfolder]: 226/494 cut-off events. [2022-12-06 06:38:07,898 INFO L131 PetriNetUnfolder]: For 419/425 co-relation queries the response was YES. [2022-12-06 06:38:07,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 494 events. 226/494 cut-off events. For 419/425 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2911 event pairs, 112 based on Foata normal form. 4/482 useless extension candidates. Maximal degree in co-relation 1206. Up to 325 conditions per place. [2022-12-06 06:38:07,901 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 154 flow [2022-12-06 06:38:07,901 INFO L188 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-06 06:38:07,903 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:07,903 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 06:38:07,903 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 154 flow [2022-12-06 06:38:07,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:07,904 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:07,904 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:07,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:38:07,904 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:07,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:07,905 INFO L85 PathProgramCache]: Analyzing trace with hash -935549246, now seen corresponding path program 1 times [2022-12-06 06:38:07,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:07,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437984319] [2022-12-06 06:38:07,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:07,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:08,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:08,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:08,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437984319] [2022-12-06 06:38:08,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437984319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:08,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:08,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:38:08,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328307095] [2022-12-06 06:38:08,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:08,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:38:08,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:08,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:38:08,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:38:08,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:38:08,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 154 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-06 06:38:08,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:08,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:38:08,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:08,544 INFO L130 PetriNetUnfolder]: 1279/2038 cut-off events. [2022-12-06 06:38:08,545 INFO L131 PetriNetUnfolder]: For 1968/1988 co-relation queries the response was YES. [2022-12-06 06:38:08,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6241 conditions, 2038 events. 1279/2038 cut-off events. For 1968/1988 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10366 event pairs, 341 based on Foata normal form. 20/2026 useless extension candidates. Maximal degree in co-relation 6222. Up to 1684 conditions per place. [2022-12-06 06:38:08,555 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 40 selfloop transitions, 8 changer transitions 11/62 dead transitions. [2022-12-06 06:38:08,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 391 flow [2022-12-06 06:38:08,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:38:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:38:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 06:38:08,558 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2022-12-06 06:38:08,558 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 154 flow. Second operand 4 states and 50 transitions. [2022-12-06 06:38:08,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 391 flow [2022-12-06 06:38:08,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:38:08,564 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 194 flow [2022-12-06 06:38:08,564 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2022-12-06 06:38:08,566 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-12-06 06:38:08,566 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:08,566 INFO L89 Accepts]: Start accepts. Operand has 43 places, 35 transitions, 194 flow [2022-12-06 06:38:08,567 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:08,567 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:08,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 194 flow [2022-12-06 06:38:08,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 35 transitions, 194 flow [2022-12-06 06:38:08,606 INFO L130 PetriNetUnfolder]: 122/264 cut-off events. [2022-12-06 06:38:08,607 INFO L131 PetriNetUnfolder]: For 362/367 co-relation queries the response was YES. [2022-12-06 06:38:08,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 264 events. 122/264 cut-off events. For 362/367 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1218 event pairs, 51 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 792. Up to 167 conditions per place. [2022-12-06 06:38:08,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 35 transitions, 194 flow [2022-12-06 06:38:08,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-06 06:38:08,631 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:38:08,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-06 06:38:08,632 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 197 flow [2022-12-06 06:38:08,632 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-06 06:38:08,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:08,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:08,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:38:08,633 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:08,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:08,633 INFO L85 PathProgramCache]: Analyzing trace with hash 824111857, now seen corresponding path program 1 times [2022-12-06 06:38:08,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:08,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501256406] [2022-12-06 06:38:08,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:08,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:09,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:09,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501256406] [2022-12-06 06:38:09,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501256406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:09,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:09,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:38:09,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220994920] [2022-12-06 06:38:09,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:09,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:38:09,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:09,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:38:09,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:38:09,051 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 06:38:09,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:09,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:09,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 06:38:09,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:09,347 INFO L130 PetriNetUnfolder]: 726/1160 cut-off events. [2022-12-06 06:38:09,347 INFO L131 PetriNetUnfolder]: For 2018/2028 co-relation queries the response was YES. [2022-12-06 06:38:09,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4069 conditions, 1160 events. 726/1160 cut-off events. For 2018/2028 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4843 event pairs, 235 based on Foata normal form. 1/1160 useless extension candidates. Maximal degree in co-relation 4049. Up to 1015 conditions per place. [2022-12-06 06:38:09,356 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 45 selfloop transitions, 14 changer transitions 0/61 dead transitions. [2022-12-06 06:38:09,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 417 flow [2022-12-06 06:38:09,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:38:09,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:38:09,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 06:38:09,358 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:38:09,358 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 197 flow. Second operand 5 states and 55 transitions. [2022-12-06 06:38:09,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 417 flow [2022-12-06 06:38:09,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 61 transitions, 395 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-06 06:38:09,363 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 288 flow [2022-12-06 06:38:09,363 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=288, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2022-12-06 06:38:09,363 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2022-12-06 06:38:09,364 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:09,364 INFO L89 Accepts]: Start accepts. Operand has 45 places, 45 transitions, 288 flow [2022-12-06 06:38:09,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:09,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:09,365 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 45 transitions, 288 flow [2022-12-06 06:38:09,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 45 transitions, 288 flow [2022-12-06 06:38:09,402 INFO L130 PetriNetUnfolder]: 130/271 cut-off events. [2022-12-06 06:38:09,402 INFO L131 PetriNetUnfolder]: For 450/469 co-relation queries the response was YES. [2022-12-06 06:38:09,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 271 events. 130/271 cut-off events. For 450/469 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1215 event pairs, 45 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 942. Up to 175 conditions per place. [2022-12-06 06:38:09,405 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 45 transitions, 288 flow [2022-12-06 06:38:09,405 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 06:38:09,471 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [323] L742-->L745: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [409] L826-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_122 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_225 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_122 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_226 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_210 256) 0))))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_21| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (= v_~x$r_buff0_thd0~0_121 (ite .cse0 0 v_~x$r_buff0_thd0~0_122)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_210) v_~x$w_buff1_used~0_209) (= v_~x$w_buff0_used~0_225 (ite .cse2 0 v_~x$w_buff0_used~0_226)) (= (ite .cse2 v_~x$w_buff0~0_125 (ite .cse1 v_~x$w_buff1~0_127 v_~x~0_157)) v_~x~0_156) (= (mod v_~main$tmp_guard0~0_18 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_21| 0)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_209 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd0~0_121 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_122) v_~x$r_buff1_thd0~0_121)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_125, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_122, ~x$w_buff1~0=v_~x$w_buff1~0_127, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_122, ~x~0=v_~x~0_157, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_226} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_125, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_121, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_21|, ~x$w_buff1~0=v_~x$w_buff1~0_127, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_121, ~x~0=v_~x~0_156, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_225, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:38:09,646 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [323] L742-->L745: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [425] $Ultimate##0-->L771: Formula: (and (= v_~x$r_buff0_thd0~0_145 v_~x$r_buff1_thd0~0_147) (= (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_261 256))) (not (= (mod v_~x$w_buff1_used~0_243 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= v_~x$w_buff0~0_156 v_~x$w_buff1~0_153) (= v_~x$r_buff1_thd1~0_52 v_~x$r_buff0_thd1~0_53) (= v_~x$w_buff0_used~0_261 1) (= v_~x$r_buff1_thd3~0_51 v_~x$r_buff0_thd3~0_51) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= v_~x$w_buff0_used~0_262 v_~x$w_buff1_used~0_243) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff0_thd2~0_70 1) (= v_~x$r_buff1_thd2~0_53 v_~x$r_buff0_thd2~0_71) (= 2 v_~x$w_buff0~0_155)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_156, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_145, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_51, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_71, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_262} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_145, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, 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_153, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_51, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_243, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_52, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_51, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_70, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_147, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_261, 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_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-06 06:38:09,747 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [448] L742-->L771: Formula: (and (= v_~x$r_buff0_thd3~0_111 v_~x$r_buff1_thd3~0_107) (= v_~x$r_buff0_thd2~0_147 v_~x$r_buff1_thd2~0_113) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_25| |v_P1Thread1of1ForFork0_~arg#1.offset_25|) (= v_~x$r_buff0_thd0~0_276 v_~x$r_buff1_thd0~0_282) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_443 256) 0)) (not (= (mod v_~x$w_buff0_used~0_473 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_29|) (= v_~x$r_buff1_thd1~0_95 v_~x$r_buff0_thd1~0_95) (= v_~x$w_buff0_used~0_473 1) (= v_~x~0_391 1) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_29| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_29| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_29|) (= 2 v_~x$w_buff0~0_296) (= v_~x$w_buff0_used~0_474 v_~x$w_buff1_used~0_443) (= v_~x$w_buff0~0_297 v_~x$w_buff1~0_281) (= v_~x$r_buff0_thd2~0_146 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_25| |v_P1Thread1of1ForFork0_#in~arg#1.base_25|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_297, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_276, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_25|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_95, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_111, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_147, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_474} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_296, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_276, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_95, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_25|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_25|, ~x$w_buff1~0=v_~x$w_buff1~0_281, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_107, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_443, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_95, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_29|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_111, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_146, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_282, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_473, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_25|, ~x~0=v_~x~0_391} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~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, ~x~0] and [324] L745-->L752: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_69 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_14 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_20 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_70 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_57 256) 0)))) (.cse2 (and .cse0 .cse5))) (and (= v_~x$r_buff1_thd1~0_13 (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_19 256) 0))) (and (not (= 0 (mod v_~x$w_buff1_used~0_56 256))) .cse1)) 0 v_~x$r_buff1_thd1~0_14)) (= v_~x$r_buff0_thd1~0_19 (ite .cse2 0 v_~x$r_buff0_thd1~0_20)) (= v_~x~0_39 (ite .cse3 v_~x$w_buff0~0_21 (ite .cse4 v_~x$w_buff1~0_28 v_~x~0_40))) (= (ite .cse3 0 v_~x$w_buff0_used~0_70) v_~x$w_buff0_used~0_69) (= v_~x$w_buff1_used~0_56 (ite (or .cse4 .cse2) 0 v_~x$w_buff1_used~0_57))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_57, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_21, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_13, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:38:09,948 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [449] L742-->L752: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_477 256) 0))) (.cse0 (not (= (mod v_~x$r_buff0_thd1~0_98 256) 0))) (.cse1 (= (mod v_~x$w_buff0_used~0_479 256) 0))) (let ((.cse3 (and .cse0 (not .cse1))) (.cse2 (and .cse0 .cse4))) (and (= v_~x$r_buff0_thd3~0_113 v_~x$r_buff1_thd3~0_109) (= v_~x$w_buff0_used~0_477 (ite .cse0 0 1)) (= v_~x$r_buff0_thd0~0_278 v_~x$r_buff1_thd0~0_284) (= (ite .cse1 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_31|) (= v_~x$r_buff0_thd2~0_150 1) (= v_~x$w_buff0~0_301 v_~x$w_buff1~0_283) (= 2 v_~x$w_buff0~0_300) (= v_~x$r_buff0_thd1~0_97 (ite .cse2 0 v_~x$r_buff0_thd1~0_98)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_31| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_31|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_27| |v_P1Thread1of1ForFork0_~arg#1.offset_27|) (= v_~x$r_buff0_thd2~0_151 v_~x$r_buff1_thd2~0_115) (= (ite .cse0 v_~x$w_buff0~0_300 (ite .cse3 v_~x$w_buff1~0_283 1)) v_~x~0_393) (= |v_P1Thread1of1ForFork0_~arg#1.base_27| |v_P1Thread1of1ForFork0_#in~arg#1.base_27|) (= v_~x$w_buff1_used~0_445 (ite (or .cse3 .cse2) 0 v_~x$w_buff0_used~0_479)) (= v_~x$r_buff1_thd1~0_97 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_97 256) 0)) .cse4) (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_445 256))))) 0 v_~x$r_buff0_thd1~0_98)) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_31| 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_301, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_278, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_27|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_113, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_151, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_27|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_479} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_300, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_278, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_97, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_27|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_27|, ~x$w_buff1~0=v_~x$w_buff1~0_283, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_445, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_109, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_97, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_31|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_113, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_150, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_284, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_27|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_477, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_27|, ~x~0=v_~x~0_393} 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_thd3~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 [331] L771-->L774: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] [2022-12-06 06:38:10,124 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:38:10,125 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 761 [2022-12-06 06:38:10,125 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 300 flow [2022-12-06 06:38:10,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:10,126 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:10,126 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:10,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:38:10,126 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:10,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:10,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1895915613, now seen corresponding path program 1 times [2022-12-06 06:38:10,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:10,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118009610] [2022-12-06 06:38:10,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:10,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:10,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:10,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118009610] [2022-12-06 06:38:10,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118009610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:10,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:10,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:38:10,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516042406] [2022-12-06 06:38:10,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:10,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:38:10,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:10,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:38:10,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:38:10,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 06:38:10,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 300 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:10,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:10,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 06:38:10,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:10,647 INFO L130 PetriNetUnfolder]: 969/1522 cut-off events. [2022-12-06 06:38:10,648 INFO L131 PetriNetUnfolder]: For 3060/3060 co-relation queries the response was YES. [2022-12-06 06:38:10,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5631 conditions, 1522 events. 969/1522 cut-off events. For 3060/3060 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6662 event pairs, 279 based on Foata normal form. 43/1560 useless extension candidates. Maximal degree in co-relation 5611. Up to 879 conditions per place. [2022-12-06 06:38:10,656 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 50 selfloop transitions, 8 changer transitions 5/64 dead transitions. [2022-12-06 06:38:10,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 523 flow [2022-12-06 06:38:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:38:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:38:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 06:38:10,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-06 06:38:10,657 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 300 flow. Second operand 4 states and 48 transitions. [2022-12-06 06:38:10,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 523 flow [2022-12-06 06:38:10,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 484 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 06:38:10,663 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 292 flow [2022-12-06 06:38:10,664 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=292, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2022-12-06 06:38:10,665 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-12-06 06:38:10,666 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:10,666 INFO L89 Accepts]: Start accepts. Operand has 47 places, 43 transitions, 292 flow [2022-12-06 06:38:10,667 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:10,667 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:10,667 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 43 transitions, 292 flow [2022-12-06 06:38:10,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 292 flow [2022-12-06 06:38:10,712 INFO L130 PetriNetUnfolder]: 153/357 cut-off events. [2022-12-06 06:38:10,713 INFO L131 PetriNetUnfolder]: For 684/754 co-relation queries the response was YES. [2022-12-06 06:38:10,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 357 events. 153/357 cut-off events. For 684/754 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1918 event pairs, 58 based on Foata normal form. 1/341 useless extension candidates. Maximal degree in co-relation 1185. Up to 220 conditions per place. [2022-12-06 06:38:10,716 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 43 transitions, 292 flow [2022-12-06 06:38:10,716 INFO L188 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-06 06:38:10,720 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:10,722 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 06:38:10,722 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 292 flow [2022-12-06 06:38:10,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:10,723 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:10,723 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:10,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:38:10,723 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:10,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1771823778, now seen corresponding path program 1 times [2022-12-06 06:38:10,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:10,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826584590] [2022-12-06 06:38:10,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:10,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:11,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:11,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826584590] [2022-12-06 06:38:11,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826584590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:11,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:11,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:38:11,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487272894] [2022-12-06 06:38:11,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:11,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:38:11,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:11,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:38:11,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:38:11,281 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 06:38:11,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 292 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:11,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:11,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 06:38:11,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:11,603 INFO L130 PetriNetUnfolder]: 1002/1579 cut-off events. [2022-12-06 06:38:11,604 INFO L131 PetriNetUnfolder]: For 3366/3368 co-relation queries the response was YES. [2022-12-06 06:38:11,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5919 conditions, 1579 events. 1002/1579 cut-off events. For 3366/3368 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7069 event pairs, 369 based on Foata normal form. 3/1576 useless extension candidates. Maximal degree in co-relation 5897. Up to 1367 conditions per place. [2022-12-06 06:38:11,616 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 42 selfloop transitions, 21 changer transitions 7/71 dead transitions. [2022-12-06 06:38:11,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 578 flow [2022-12-06 06:38:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:38:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:38:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-06 06:38:11,618 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43846153846153846 [2022-12-06 06:38:11,618 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 292 flow. Second operand 5 states and 57 transitions. [2022-12-06 06:38:11,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 578 flow [2022-12-06 06:38:11,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 556 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 06:38:11,624 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 422 flow [2022-12-06 06:38:11,624 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2022-12-06 06:38:11,624 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2022-12-06 06:38:11,624 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:11,625 INFO L89 Accepts]: Start accepts. Operand has 52 places, 50 transitions, 422 flow [2022-12-06 06:38:11,625 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:11,626 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:11,626 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 50 transitions, 422 flow [2022-12-06 06:38:11,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 50 transitions, 422 flow [2022-12-06 06:38:11,679 INFO L130 PetriNetUnfolder]: 173/385 cut-off events. [2022-12-06 06:38:11,679 INFO L131 PetriNetUnfolder]: For 1093/1176 co-relation queries the response was YES. [2022-12-06 06:38:11,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1657 conditions, 385 events. 173/385 cut-off events. For 1093/1176 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2015 event pairs, 45 based on Foata normal form. 3/377 useless extension candidates. Maximal degree in co-relation 1635. Up to 237 conditions per place. [2022-12-06 06:38:11,685 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 50 transitions, 422 flow [2022-12-06 06:38:11,685 INFO L188 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-06 06:38:11,688 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:11,689 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-06 06:38:11,689 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 422 flow [2022-12-06 06:38:11,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:11,689 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:11,689 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:11,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:38:11,690 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:11,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:11,690 INFO L85 PathProgramCache]: Analyzing trace with hash 907963122, now seen corresponding path program 1 times [2022-12-06 06:38:11,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:11,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005168450] [2022-12-06 06:38:11,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:11,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:11,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:11,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:11,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005168450] [2022-12-06 06:38:11,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005168450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:11,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:11,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:38:11,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547992056] [2022-12-06 06:38:11,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:11,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:38:11,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:11,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:38:11,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:38:11,864 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-06 06:38:11,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 422 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:11,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:11,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-06 06:38:11,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:12,076 INFO L130 PetriNetUnfolder]: 671/1179 cut-off events. [2022-12-06 06:38:12,077 INFO L131 PetriNetUnfolder]: For 4930/4953 co-relation queries the response was YES. [2022-12-06 06:38:12,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5018 conditions, 1179 events. 671/1179 cut-off events. For 4930/4953 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6019 event pairs, 92 based on Foata normal form. 147/1313 useless extension candidates. Maximal degree in co-relation 4993. Up to 522 conditions per place. [2022-12-06 06:38:12,087 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 69 selfloop transitions, 5 changer transitions 4/82 dead transitions. [2022-12-06 06:38:12,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 82 transitions, 814 flow [2022-12-06 06:38:12,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:38:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:38:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 06:38:12,089 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2022-12-06 06:38:12,089 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 422 flow. Second operand 4 states and 62 transitions. [2022-12-06 06:38:12,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 82 transitions, 814 flow [2022-12-06 06:38:12,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 82 transitions, 775 flow, removed 19 selfloop flow, removed 1 redundant places. [2022-12-06 06:38:12,096 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 397 flow [2022-12-06 06:38:12,096 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=397, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2022-12-06 06:38:12,097 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2022-12-06 06:38:12,097 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:12,097 INFO L89 Accepts]: Start accepts. Operand has 56 places, 49 transitions, 397 flow [2022-12-06 06:38:12,098 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:12,098 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:12,098 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 49 transitions, 397 flow [2022-12-06 06:38:12,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 49 transitions, 397 flow [2022-12-06 06:38:12,151 INFO L130 PetriNetUnfolder]: 206/498 cut-off events. [2022-12-06 06:38:12,152 INFO L131 PetriNetUnfolder]: For 1656/1828 co-relation queries the response was YES. [2022-12-06 06:38:12,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2108 conditions, 498 events. 206/498 cut-off events. For 1656/1828 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3126 event pairs, 75 based on Foata normal form. 11/449 useless extension candidates. Maximal degree in co-relation 2083. Up to 246 conditions per place. [2022-12-06 06:38:12,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 49 transitions, 397 flow [2022-12-06 06:38:12,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-06 06:38:12,493 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:38:12,494 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 397 [2022-12-06 06:38:12,494 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 390 flow [2022-12-06 06:38:12,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:12,494 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:12,494 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:12,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:38:12,494 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:12,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:12,495 INFO L85 PathProgramCache]: Analyzing trace with hash 199294429, now seen corresponding path program 1 times [2022-12-06 06:38:12,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:12,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637667025] [2022-12-06 06:38:12,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:12,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:12,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:12,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637667025] [2022-12-06 06:38:12,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637667025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:12,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:12,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:38:12,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077665231] [2022-12-06 06:38:12,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:12,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:38:12,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:12,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:38:12,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:38:12,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 06:38:12,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 390 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-06 06:38:12,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:12,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 06:38:12,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:12,863 INFO L130 PetriNetUnfolder]: 515/938 cut-off events. [2022-12-06 06:38:12,863 INFO L131 PetriNetUnfolder]: For 4007/4034 co-relation queries the response was YES. [2022-12-06 06:38:12,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4299 conditions, 938 events. 515/938 cut-off events. For 4007/4034 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4624 event pairs, 89 based on Foata normal form. 95/1025 useless extension candidates. Maximal degree in co-relation 4271. Up to 382 conditions per place. [2022-12-06 06:38:12,871 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 68 selfloop transitions, 8 changer transitions 6/86 dead transitions. [2022-12-06 06:38:12,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 86 transitions, 818 flow [2022-12-06 06:38:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:38:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:38:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-06 06:38:12,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.584 [2022-12-06 06:38:12,873 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 390 flow. Second operand 5 states and 73 transitions. [2022-12-06 06:38:12,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 86 transitions, 818 flow [2022-12-06 06:38:12,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 86 transitions, 789 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-06 06:38:12,880 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 391 flow [2022-12-06 06:38:12,880 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=391, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2022-12-06 06:38:12,880 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2022-12-06 06:38:12,881 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:12,881 INFO L89 Accepts]: Start accepts. Operand has 59 places, 49 transitions, 391 flow [2022-12-06 06:38:12,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:12,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:12,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 49 transitions, 391 flow [2022-12-06 06:38:12,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 49 transitions, 391 flow [2022-12-06 06:38:12,919 INFO L130 PetriNetUnfolder]: 107/334 cut-off events. [2022-12-06 06:38:12,919 INFO L131 PetriNetUnfolder]: For 1120/1383 co-relation queries the response was YES. [2022-12-06 06:38:12,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 334 events. 107/334 cut-off events. For 1120/1383 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2084 event pairs, 16 based on Foata normal form. 30/318 useless extension candidates. Maximal degree in co-relation 1418. Up to 179 conditions per place. [2022-12-06 06:38:12,924 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 49 transitions, 391 flow [2022-12-06 06:38:12,924 INFO L188 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-06 06:38:13,616 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:38:13,617 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 736 [2022-12-06 06:38:13,618 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 412 flow [2022-12-06 06:38:13,618 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-06 06:38:13,618 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:13,618 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:13,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:38:13,618 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:13,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:13,619 INFO L85 PathProgramCache]: Analyzing trace with hash 856782532, now seen corresponding path program 1 times [2022-12-06 06:38:13,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:13,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352184423] [2022-12-06 06:38:13,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:13,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:13,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:13,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352184423] [2022-12-06 06:38:13,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352184423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:13,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:13,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:38:13,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562376450] [2022-12-06 06:38:13,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:13,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:38:13,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:13,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:38:13,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:38:13,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 06:38:13,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:13,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:13,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 06:38:13,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:13,956 INFO L130 PetriNetUnfolder]: 208/404 cut-off events. [2022-12-06 06:38:13,956 INFO L131 PetriNetUnfolder]: For 2009/2014 co-relation queries the response was YES. [2022-12-06 06:38:13,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1975 conditions, 404 events. 208/404 cut-off events. For 2009/2014 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1617 event pairs, 30 based on Foata normal form. 21/420 useless extension candidates. Maximal degree in co-relation 1945. Up to 150 conditions per place. [2022-12-06 06:38:13,959 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 35 selfloop transitions, 11 changer transitions 20/69 dead transitions. [2022-12-06 06:38:13,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 69 transitions, 666 flow [2022-12-06 06:38:13,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:38:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:38:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-12-06 06:38:13,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2022-12-06 06:38:13,961 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 412 flow. Second operand 6 states and 68 transitions. [2022-12-06 06:38:13,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 69 transitions, 666 flow [2022-12-06 06:38:13,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 596 flow, removed 20 selfloop flow, removed 7 redundant places. [2022-12-06 06:38:13,966 INFO L231 Difference]: Finished difference. Result has 58 places, 36 transitions, 276 flow [2022-12-06 06:38:13,967 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=276, PETRI_PLACES=58, PETRI_TRANSITIONS=36} [2022-12-06 06:38:13,967 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2022-12-06 06:38:13,967 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:13,967 INFO L89 Accepts]: Start accepts. Operand has 58 places, 36 transitions, 276 flow [2022-12-06 06:38:13,968 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:13,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:13,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 36 transitions, 276 flow [2022-12-06 06:38:13,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 36 transitions, 276 flow [2022-12-06 06:38:13,979 INFO L130 PetriNetUnfolder]: 25/82 cut-off events. [2022-12-06 06:38:13,979 INFO L131 PetriNetUnfolder]: For 161/163 co-relation queries the response was YES. [2022-12-06 06:38:13,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 82 events. 25/82 cut-off events. For 161/163 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 232 event pairs, 5 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 301. Up to 25 conditions per place. [2022-12-06 06:38:13,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 36 transitions, 276 flow [2022-12-06 06:38:13,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-06 06:38:14,939 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [339] L794-->L801: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_121 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_122 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_115 256) 0)))) (.cse2 (and .cse3 .cse5))) (and (= v_~x~0_73 (ite .cse0 v_~x$w_buff0~0_41 (ite .cse1 v_~x$w_buff1~0_52 v_~x~0_74))) (= v_~x$w_buff0_used~0_121 (ite .cse0 0 v_~x$w_buff0_used~0_122)) (= v_~x$r_buff0_thd3~0_23 (ite .cse2 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_114 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_114 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_115))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$w_buff1~0=v_~x$w_buff1~0_52, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_122} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$w_buff1~0=v_~x$w_buff1~0_52, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_121} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] and [445] $Ultimate##0-->L794: Formula: (and (= v_~z~0_110 1) (= v_~y~0_50 v_~__unbuffered_p2_EAX~0_114) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_50} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_110, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] [2022-12-06 06:38:15,023 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L774-->L781: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_93)) (= v_~x$r_buff0_thd2~0_24 (ite .cse1 0 v_~x$r_buff0_thd2~0_25)) (= (ite .cse2 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_20)) (= v_~x~0_61 (ite .cse2 v_~x$w_buff0~0_33 (ite .cse0 v_~x$w_buff1~0_44 v_~x~0_62)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_44, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_44, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_61, ~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] and [445] $Ultimate##0-->L794: Formula: (and (= v_~z~0_110 1) (= v_~y~0_50 v_~__unbuffered_p2_EAX~0_114) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_50} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_110, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] [2022-12-06 06:38:15,114 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [369] $Ultimate##0-->L742: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_~z~0_29 2) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~z~0=v_~z~0_29, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, P0Thread1of1ForFork2_~arg.base] and [445] $Ultimate##0-->L794: Formula: (and (= v_~z~0_110 1) (= v_~y~0_50 v_~__unbuffered_p2_EAX~0_114) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_50} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_110, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] [2022-12-06 06:38:15,142 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [339] L794-->L801: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_121 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_122 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_115 256) 0)))) (.cse2 (and .cse3 .cse5))) (and (= v_~x~0_73 (ite .cse0 v_~x$w_buff0~0_41 (ite .cse1 v_~x$w_buff1~0_52 v_~x~0_74))) (= v_~x$w_buff0_used~0_121 (ite .cse0 0 v_~x$w_buff0_used~0_122)) (= v_~x$r_buff0_thd3~0_23 (ite .cse2 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_114 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_114 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_115))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$w_buff1~0=v_~x$w_buff1~0_52, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_122} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$w_buff1~0=v_~x$w_buff1~0_52, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_121} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] and [445] $Ultimate##0-->L794: Formula: (and (= v_~z~0_110 1) (= v_~y~0_50 v_~__unbuffered_p2_EAX~0_114) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_50} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_110, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] [2022-12-06 06:38:15,224 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 06:41:25,461 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L781-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res#1.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49) (= |v_P1Thread1of1ForFork0_#res#1.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_7|, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, P1Thread1of1ForFork0_#res#1.offset] and [466] L823-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse24 (not (= (mod v_~x$r_buff0_thd0~0_309 256) 0)))) (let ((.cse17 (and (not (= 0 (mod v_~x$w_buff0_used~0_552 256))) .cse24))) (let ((.cse14 (ite .cse17 0 v_~x$w_buff0_used~0_552))) (let ((.cse19 (= (mod .cse14 256) 0))) (let ((.cse22 (not .cse19))) (let ((.cse23 (and .cse22 .cse24))) (let ((.cse21 (not (= (mod v_~x$r_buff1_thd0~0_315 256) 0))) (.cse8 (ite .cse23 0 v_~x$r_buff0_thd0~0_309))) (let ((.cse10 (= (mod .cse8 256) 0)) (.cse18 (and .cse21 (not (= (mod v_~x$w_buff1_used~0_504 256) 0))))) (let ((.cse12 (ite (or .cse18 .cse23) 0 v_~x$w_buff1_used~0_504)) (.cse11 (not .cse10))) (let ((.cse16 (and .cse22 .cse11)) (.cse20 (= (mod .cse12 256) 0))) (let ((.cse2 (ite (or .cse16 (and (not .cse20) .cse21)) 0 v_~x$r_buff1_thd0~0_315))) (let ((.cse5 (= (mod .cse2 256) 0))) (let ((.cse9 (and .cse10 .cse5)) (.cse13 (and .cse20 .cse10))) (let ((.cse15 (or .cse19 .cse9 .cse13)) (.cse0 (ite .cse17 v_~x$w_buff0~0_351 (ite .cse18 v_~x$w_buff1~0_318 v_~x~0_448)))) (let ((.cse6 (= (mod v_~x$w_buff1_used~0_503 256) 0)) (.cse7 (ite .cse15 .cse0 (ite .cse16 v_~x$w_buff0~0_351 v_~x$w_buff1~0_318))) (.cse3 (= (mod v_~x$w_buff0_used~0_551 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_104 256) 0)))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_77|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_77| 0) (= v_~x$flush_delayed~0_103 0) (= .cse0 v_~x$mem_tmp~0_102) (= v_~x$r_buff1_thd0~0_314 (ite .cse1 .cse2 (ite (let ((.cse4 (= (mod v_~x$r_buff0_thd0~0_308 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6))) .cse2 0))) (= (ite (= (ite (not (and (= 2 .cse7) (= v_~z~0_127 2) (= v_~__unbuffered_p2_EAX~0_128 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_102) (= v_~main$tmp_guard0~0_82 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#t~nondet10#1_145| v_~weak$$choice2~0_104) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= v_~x$r_buff0_thd0~0_308 (ite .cse1 .cse8 (ite (or .cse3 .cse9 (and .cse10 .cse6)) .cse8 (ite (and (not .cse3) .cse11) 0 .cse8)))) (= v_~x$w_buff1~0_318 v_~x$w_buff1~0_317) (= (ite .cse1 v_~x$mem_tmp~0_102 .cse7) v_~x~0_447) (= v_~x$w_buff1_used~0_503 (ite .cse1 .cse12 (ite (or .cse3 .cse9 .cse13) .cse12 0))) (= (mod v_~main$tmp_guard1~0_102 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|) (= (ite .cse1 .cse14 (ite .cse15 .cse14 (ite .cse16 0 .cse14))) v_~x$w_buff0_used~0_551) (= |v_ULTIMATE.start_main_#t~nondet9#1_151| v_~weak$$choice0~0_87) (= v_~x$w_buff0~0_351 v_~x$w_buff0~0_350) (= (mod v_~main$tmp_guard0~0_82 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_351, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_309, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_145|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_151|, ~x$w_buff1~0=v_~x$w_buff1~0_318, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_315, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_552, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ~z~0=v_~z~0_127, ~x~0=v_~x~0_448} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_350, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_308, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_77|, ~x$flush_delayed~0=v_~x$flush_delayed~0_103, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_503, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_102, ~x$mem_tmp~0=v_~x$mem_tmp~0_102, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_82, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_314, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_551, ~weak$$choice0~0=v_~weak$$choice0~0_87, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_53|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_59|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_104, ~x~0=v_~x~0_447, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:41:25,876 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [427] L752-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] and [466] L823-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse24 (not (= (mod v_~x$r_buff0_thd0~0_309 256) 0)))) (let ((.cse17 (and (not (= 0 (mod v_~x$w_buff0_used~0_552 256))) .cse24))) (let ((.cse14 (ite .cse17 0 v_~x$w_buff0_used~0_552))) (let ((.cse19 (= (mod .cse14 256) 0))) (let ((.cse22 (not .cse19))) (let ((.cse23 (and .cse22 .cse24))) (let ((.cse21 (not (= (mod v_~x$r_buff1_thd0~0_315 256) 0))) (.cse8 (ite .cse23 0 v_~x$r_buff0_thd0~0_309))) (let ((.cse10 (= (mod .cse8 256) 0)) (.cse18 (and .cse21 (not (= (mod v_~x$w_buff1_used~0_504 256) 0))))) (let ((.cse12 (ite (or .cse18 .cse23) 0 v_~x$w_buff1_used~0_504)) (.cse11 (not .cse10))) (let ((.cse16 (and .cse22 .cse11)) (.cse20 (= (mod .cse12 256) 0))) (let ((.cse2 (ite (or .cse16 (and (not .cse20) .cse21)) 0 v_~x$r_buff1_thd0~0_315))) (let ((.cse5 (= (mod .cse2 256) 0))) (let ((.cse9 (and .cse10 .cse5)) (.cse13 (and .cse20 .cse10))) (let ((.cse15 (or .cse19 .cse9 .cse13)) (.cse0 (ite .cse17 v_~x$w_buff0~0_351 (ite .cse18 v_~x$w_buff1~0_318 v_~x~0_448)))) (let ((.cse6 (= (mod v_~x$w_buff1_used~0_503 256) 0)) (.cse7 (ite .cse15 .cse0 (ite .cse16 v_~x$w_buff0~0_351 v_~x$w_buff1~0_318))) (.cse3 (= (mod v_~x$w_buff0_used~0_551 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_104 256) 0)))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_77|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_77| 0) (= v_~x$flush_delayed~0_103 0) (= .cse0 v_~x$mem_tmp~0_102) (= v_~x$r_buff1_thd0~0_314 (ite .cse1 .cse2 (ite (let ((.cse4 (= (mod v_~x$r_buff0_thd0~0_308 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6))) .cse2 0))) (= (ite (= (ite (not (and (= 2 .cse7) (= v_~z~0_127 2) (= v_~__unbuffered_p2_EAX~0_128 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_102) (= v_~main$tmp_guard0~0_82 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#t~nondet10#1_145| v_~weak$$choice2~0_104) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= v_~x$r_buff0_thd0~0_308 (ite .cse1 .cse8 (ite (or .cse3 .cse9 (and .cse10 .cse6)) .cse8 (ite (and (not .cse3) .cse11) 0 .cse8)))) (= v_~x$w_buff1~0_318 v_~x$w_buff1~0_317) (= (ite .cse1 v_~x$mem_tmp~0_102 .cse7) v_~x~0_447) (= v_~x$w_buff1_used~0_503 (ite .cse1 .cse12 (ite (or .cse3 .cse9 .cse13) .cse12 0))) (= (mod v_~main$tmp_guard1~0_102 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|) (= (ite .cse1 .cse14 (ite .cse15 .cse14 (ite .cse16 0 .cse14))) v_~x$w_buff0_used~0_551) (= |v_ULTIMATE.start_main_#t~nondet9#1_151| v_~weak$$choice0~0_87) (= v_~x$w_buff0~0_351 v_~x$w_buff0~0_350) (= (mod v_~main$tmp_guard0~0_82 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_351, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_309, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_145|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_151|, ~x$w_buff1~0=v_~x$w_buff1~0_318, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_315, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_552, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ~z~0=v_~z~0_127, ~x~0=v_~x~0_448} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_350, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_308, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_77|, ~x$flush_delayed~0=v_~x$flush_delayed~0_103, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_503, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_102, ~x$mem_tmp~0=v_~x$mem_tmp~0_102, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_82, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_314, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_551, ~weak$$choice0~0=v_~weak$$choice0~0_87, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_53|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_59|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_104, ~x~0=v_~x~0_447, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:41:26,251 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [431] L801-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res.base_7| 0) (= |v_P2Thread1of1ForFork1_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] and [466] L823-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse24 (not (= (mod v_~x$r_buff0_thd0~0_309 256) 0)))) (let ((.cse17 (and (not (= 0 (mod v_~x$w_buff0_used~0_552 256))) .cse24))) (let ((.cse14 (ite .cse17 0 v_~x$w_buff0_used~0_552))) (let ((.cse19 (= (mod .cse14 256) 0))) (let ((.cse22 (not .cse19))) (let ((.cse23 (and .cse22 .cse24))) (let ((.cse21 (not (= (mod v_~x$r_buff1_thd0~0_315 256) 0))) (.cse8 (ite .cse23 0 v_~x$r_buff0_thd0~0_309))) (let ((.cse10 (= (mod .cse8 256) 0)) (.cse18 (and .cse21 (not (= (mod v_~x$w_buff1_used~0_504 256) 0))))) (let ((.cse12 (ite (or .cse18 .cse23) 0 v_~x$w_buff1_used~0_504)) (.cse11 (not .cse10))) (let ((.cse16 (and .cse22 .cse11)) (.cse20 (= (mod .cse12 256) 0))) (let ((.cse2 (ite (or .cse16 (and (not .cse20) .cse21)) 0 v_~x$r_buff1_thd0~0_315))) (let ((.cse5 (= (mod .cse2 256) 0))) (let ((.cse9 (and .cse10 .cse5)) (.cse13 (and .cse20 .cse10))) (let ((.cse15 (or .cse19 .cse9 .cse13)) (.cse0 (ite .cse17 v_~x$w_buff0~0_351 (ite .cse18 v_~x$w_buff1~0_318 v_~x~0_448)))) (let ((.cse6 (= (mod v_~x$w_buff1_used~0_503 256) 0)) (.cse7 (ite .cse15 .cse0 (ite .cse16 v_~x$w_buff0~0_351 v_~x$w_buff1~0_318))) (.cse3 (= (mod v_~x$w_buff0_used~0_551 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_104 256) 0)))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_77|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_77| 0) (= v_~x$flush_delayed~0_103 0) (= .cse0 v_~x$mem_tmp~0_102) (= v_~x$r_buff1_thd0~0_314 (ite .cse1 .cse2 (ite (let ((.cse4 (= (mod v_~x$r_buff0_thd0~0_308 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6))) .cse2 0))) (= (ite (= (ite (not (and (= 2 .cse7) (= v_~z~0_127 2) (= v_~__unbuffered_p2_EAX~0_128 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_102) (= v_~main$tmp_guard0~0_82 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#t~nondet10#1_145| v_~weak$$choice2~0_104) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= v_~x$r_buff0_thd0~0_308 (ite .cse1 .cse8 (ite (or .cse3 .cse9 (and .cse10 .cse6)) .cse8 (ite (and (not .cse3) .cse11) 0 .cse8)))) (= v_~x$w_buff1~0_318 v_~x$w_buff1~0_317) (= (ite .cse1 v_~x$mem_tmp~0_102 .cse7) v_~x~0_447) (= v_~x$w_buff1_used~0_503 (ite .cse1 .cse12 (ite (or .cse3 .cse9 .cse13) .cse12 0))) (= (mod v_~main$tmp_guard1~0_102 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|) (= (ite .cse1 .cse14 (ite .cse15 .cse14 (ite .cse16 0 .cse14))) v_~x$w_buff0_used~0_551) (= |v_ULTIMATE.start_main_#t~nondet9#1_151| v_~weak$$choice0~0_87) (= v_~x$w_buff0~0_351 v_~x$w_buff0~0_350) (= (mod v_~main$tmp_guard0~0_82 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_351, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_309, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_145|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_151|, ~x$w_buff1~0=v_~x$w_buff1~0_318, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_315, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_552, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ~z~0=v_~z~0_127, ~x~0=v_~x~0_448} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_350, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_308, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_77|, ~x$flush_delayed~0=v_~x$flush_delayed~0_103, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_503, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_102, ~x$mem_tmp~0=v_~x$mem_tmp~0_102, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_82, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_314, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_551, ~weak$$choice0~0=v_~weak$$choice0~0_87, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_53|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_59|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_104, ~x~0=v_~x~0_447, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:41:26,610 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 06:41:26,611 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 06:41:26,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:41:26,612 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 06:41:26,614 INFO L158 Benchmark]: Toolchain (without parser) took 208159.96ms. Allocated memory was 188.7MB in the beginning and 845.2MB in the end (delta: 656.4MB). Free memory was 153.3MB in the beginning and 508.4MB in the end (delta: -355.1MB). Peak memory consumption was 508.2MB. Max. memory is 8.0GB. [2022-12-06 06:41:26,614 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 166.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:41:26,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.69ms. Allocated memory is still 188.7MB. Free memory was 153.3MB in the beginning and 127.1MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 06:41:26,615 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.07ms. Allocated memory is still 188.7MB. Free memory was 127.1MB in the beginning and 124.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:41:26,615 INFO L158 Benchmark]: Boogie Preprocessor took 60.43ms. Allocated memory is still 188.7MB. Free memory was 124.5MB in the beginning and 122.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:41:26,615 INFO L158 Benchmark]: RCFGBuilder took 731.85ms. Allocated memory is still 188.7MB. Free memory was 122.4MB in the beginning and 86.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-06 06:41:26,615 INFO L158 Benchmark]: TraceAbstraction took 206814.05ms. Allocated memory was 188.7MB in the beginning and 845.2MB in the end (delta: 656.4MB). Free memory was 86.2MB in the beginning and 508.4MB in the end (delta: -422.2MB). Peak memory consumption was 442.1MB. Max. memory is 8.0GB. [2022-12-06 06:41:26,616 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.11ms. Allocated memory is still 188.7MB. Free memory is still 166.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 484.69ms. Allocated memory is still 188.7MB. Free memory was 153.3MB in the beginning and 127.1MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.07ms. Allocated memory is still 188.7MB. Free memory was 127.1MB in the beginning and 124.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.43ms. Allocated memory is still 188.7MB. Free memory was 124.5MB in the beginning and 122.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 731.85ms. Allocated memory is still 188.7MB. Free memory was 122.4MB in the beginning and 86.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 206814.05ms. Allocated memory was 188.7MB in the beginning and 845.2MB in the end (delta: 656.4MB). Free memory was 86.2MB in the beginning and 508.4MB in the end (delta: -422.2MB). Peak memory consumption was 442.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 112 PlacesBefore, 36 PlacesAfterwards, 104 TransitionsBefore, 27 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1412, independent: 1357, independent conditional: 1357, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1412, independent: 1357, independent conditional: 0, independent unconditional: 1357, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1412, independent: 1357, independent conditional: 0, independent unconditional: 1357, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1412, independent: 1357, independent conditional: 0, independent unconditional: 1357, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1200, independent: 1160, independent conditional: 0, independent unconditional: 1160, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1200, independent: 1145, independent conditional: 0, independent unconditional: 1145, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 55, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 247, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1412, independent: 197, independent conditional: 0, independent unconditional: 197, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1200, unknown conditional: 0, unknown unconditional: 1200] , Statistics on independence cache: Total cache size (in pairs): 1807, Positive cache size: 1767, Positive conditional cache size: 0, Positive unconditional cache size: 1767, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, 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, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 103, independent: 81, independent conditional: 8, independent unconditional: 73, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 103, independent: 81, independent conditional: 8, independent unconditional: 73, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 103, independent: 81, independent conditional: 8, independent unconditional: 73, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 89, independent: 74, independent conditional: 7, independent unconditional: 67, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 89, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 103, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 89, unknown conditional: 9, unknown unconditional: 80] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 74, Positive conditional cache size: 7, Positive unconditional cache size: 67, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, 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, 33 PlacesBefore, 33 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, independent: 105, independent conditional: 105, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 118, independent: 105, independent conditional: 26, independent unconditional: 79, dependent: 13, dependent conditional: 5, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 118, independent: 105, independent conditional: 14, independent unconditional: 91, dependent: 13, dependent conditional: 5, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 118, independent: 105, independent conditional: 14, independent unconditional: 91, dependent: 13, dependent conditional: 5, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 6, independent unconditional: 11, 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: 19, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 118, independent: 88, independent conditional: 8, independent unconditional: 80, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 19, unknown conditional: 8, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 91, Positive conditional cache size: 13, Positive unconditional cache size: 78, Negative cache size: 17, Negative conditional cache size: 4, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, independent: 77, independent conditional: 77, 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: 88, independent: 77, independent conditional: 15, independent unconditional: 62, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 88, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 93, Positive conditional cache size: 13, Positive unconditional cache size: 80, Negative cache size: 17, Negative conditional cache size: 4, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 44, independent conditional: 13, independent unconditional: 31, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 44, independent conditional: 4, independent unconditional: 40, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 44, independent conditional: 4, independent unconditional: 40, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 43, independent conditional: 4, independent unconditional: 39, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 94, Positive conditional cache size: 13, Positive unconditional cache size: 81, Negative cache size: 17, Negative conditional cache size: 4, Negative unconditional cache size: 13, 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.0s, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 19, independent conditional: 11, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 19, independent conditional: 3, independent unconditional: 16, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 19, independent conditional: 3, independent unconditional: 16, dependent: 3, dependent conditional: 0, dependent unconditional: 3, 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: 22, independent: 19, independent conditional: 3, independent unconditional: 16, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 94, Positive conditional cache size: 13, Positive unconditional cache size: 81, Negative cache size: 17, Negative conditional cache size: 4, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 74, independent conditional: 74, 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: 84, independent: 74, independent conditional: 22, independent unconditional: 52, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 74, independent conditional: 4, independent unconditional: 70, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 74, independent conditional: 4, independent unconditional: 70, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 84, independent: 71, independent conditional: 4, independent unconditional: 67, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 99, Positive conditional cache size: 13, Positive unconditional cache size: 86, Negative cache size: 17, Negative conditional cache size: 4, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 45 PlacesBefore, 44 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 326, independent: 286, independent conditional: 286, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 326, independent: 286, independent conditional: 122, independent unconditional: 164, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 326, independent: 286, independent conditional: 81, independent unconditional: 205, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 326, independent: 286, independent conditional: 81, independent unconditional: 205, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 326, independent: 277, independent conditional: 77, independent unconditional: 200, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 10, unknown conditional: 4, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 131, Positive conditional cache size: 17, Positive unconditional cache size: 114, Negative cache size: 18, Negative conditional cache size: 4, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 41, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 39, independent conditional: 29, independent unconditional: 10, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 39, independent conditional: 19, independent unconditional: 20, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 39, independent conditional: 19, independent unconditional: 20, dependent: 7, dependent conditional: 0, dependent unconditional: 7, 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: 46, independent: 39, independent conditional: 19, independent unconditional: 20, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 131, Positive conditional cache size: 17, Positive unconditional cache size: 114, Negative cache size: 18, Negative conditional cache size: 4, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 48, independent conditional: 48, 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: 57, independent: 48, independent conditional: 22, independent unconditional: 26, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 48, independent conditional: 14, independent unconditional: 34, 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: 57, independent: 48, independent conditional: 14, independent unconditional: 34, 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: 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: 57, independent: 46, independent conditional: 14, independent unconditional: 32, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 133, Positive conditional cache size: 17, Positive unconditional cache size: 116, Negative cache size: 18, Negative conditional cache size: 4, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 56 PlacesBefore, 55 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 20, independent unconditional: 5, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 25, independent conditional: 7, independent unconditional: 18, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 7, independent unconditional: 18, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, 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: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 27, independent: 19, independent conditional: 3, independent unconditional: 16, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 7, unknown conditional: 4, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 142, Positive conditional cache size: 21, Positive unconditional cache size: 121, Negative cache size: 19, Negative conditional cache size: 4, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 59 PlacesBefore, 58 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 59, independent: 55, independent conditional: 45, independent unconditional: 10, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 55, independent conditional: 19, independent unconditional: 36, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 55, independent conditional: 19, independent unconditional: 36, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, independent: 46, independent conditional: 15, independent unconditional: 31, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 9, unknown conditional: 4, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 167, Positive conditional cache size: 25, Positive unconditional cache size: 142, Negative cache size: 19, Negative conditional cache size: 4, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 192.6s, 57 PlacesBefore, 53 PlacesAfterwards, 36 TransitionsBefore, 32 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 18, independent unconditional: 2, 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: 20, independent: 20, independent conditional: 9, independent unconditional: 11, 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: 20, independent: 20, independent conditional: 9, independent unconditional: 11, 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: 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: 20, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 207, Positive conditional cache size: 27, Positive unconditional cache size: 180, Negative cache size: 19, Negative conditional cache size: 4, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 06:41:26,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...