/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:08:17,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:08:17,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:08:17,861 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:08:17,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:08:17,865 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:08:17,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:08:17,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:08:17,875 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:08:17,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:08:17,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:08:17,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:08:17,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:08:17,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:08:17,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:08:17,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:08:17,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:08:17,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:08:17,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:08:17,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:08:17,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:08:17,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:08:17,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:08:17,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:08:17,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:08:17,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:08:17,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:08:17,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:08:17,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:08:17,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:08:17,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:08:17,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:08:17,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:08:17,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:08:17,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:08:17,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:08:17,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:08:17,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:08:17,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:08:17,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:08:17,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:08:17,923 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:08:17,953 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:08:17,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:08:17,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:08:17,956 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:08:17,956 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:08:17,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:08:17,957 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:08:17,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:08:17,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:08:17,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:08:17,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:08:17,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:08:17,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:08:17,958 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:08:17,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:08:17,959 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:08:17,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:08:17,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:08:17,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:08:17,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:08:17,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:08:17,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:08:17,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:08:17,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:08:17,960 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:08:17,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:08:17,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:08:17,961 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:08:17,961 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:08:18,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:08:18,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:08:18,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:08:18,303 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:08:18,304 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:08:18,305 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_tso.i [2022-12-05 23:08:19,292 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:08:19,553 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:08:19,554 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_tso.i [2022-12-05 23:08:19,572 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9179cbd08/6385abb007234b62922b0dcce6c01acb/FLAG2431a3c3e [2022-12-05 23:08:19,585 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9179cbd08/6385abb007234b62922b0dcce6c01acb [2022-12-05 23:08:19,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:08:19,588 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:08:19,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:08:19,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:08:19,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:08:19,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:08:19" (1/1) ... [2022-12-05 23:08:19,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab791c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:19, skipping insertion in model container [2022-12-05 23:08:19,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:08:19" (1/1) ... [2022-12-05 23:08:19,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:08:19,648 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:08:19,819 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/rfi002_tso.i[987,1000] [2022-12-05 23:08:19,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:19,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:19,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:19,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:19,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:08:20,077 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:08:20,088 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/rfi002_tso.i[987,1000] [2022-12-05 23:08:20,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:20,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:20,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:08:20,216 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:08:20,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:20 WrapperNode [2022-12-05 23:08:20,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:08:20,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:08:20,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:08:20,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:08:20,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:20" (1/1) ... [2022-12-05 23:08:20,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:20" (1/1) ... [2022-12-05 23:08:20,300 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 203 [2022-12-05 23:08:20,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:08:20,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:08:20,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:08:20,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:08:20,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:20" (1/1) ... [2022-12-05 23:08:20,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:20" (1/1) ... [2022-12-05 23:08:20,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:20" (1/1) ... [2022-12-05 23:08:20,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:20" (1/1) ... [2022-12-05 23:08:20,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:20" (1/1) ... [2022-12-05 23:08:20,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:20" (1/1) ... [2022-12-05 23:08:20,355 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:20" (1/1) ... [2022-12-05 23:08:20,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:20" (1/1) ... [2022-12-05 23:08:20,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:08:20,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:08:20,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:08:20,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:08:20,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:20" (1/1) ... [2022-12-05 23:08:20,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:08:20,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:08:20,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:08:20,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:08:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:08:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:08:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:08:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:08:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:08:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:08:20,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:08:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:08:20,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:08:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:08:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:08:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:08:20,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:08:20,456 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:08:20,601 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:08:20,602 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:08:21,023 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:08:21,307 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:08:21,308 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:08:21,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:08:21 BoogieIcfgContainer [2022-12-05 23:08:21,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:08:21,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:08:21,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:08:21,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:08:21,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:08:19" (1/3) ... [2022-12-05 23:08:21,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad87a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:08:21, skipping insertion in model container [2022-12-05 23:08:21,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:20" (2/3) ... [2022-12-05 23:08:21,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad87a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:08:21, skipping insertion in model container [2022-12-05 23:08:21,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:08:21" (3/3) ... [2022-12-05 23:08:21,318 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi002_tso.i [2022-12-05 23:08:21,335 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:08:21,335 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-05 23:08:21,335 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:08:21,394 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:08:21,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 107 transitions, 224 flow [2022-12-05 23:08:21,490 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-05 23:08:21,490 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:21,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-05 23:08:21,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 107 transitions, 224 flow [2022-12-05 23:08:21,501 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 105 transitions, 216 flow [2022-12-05 23:08:21,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:21,522 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 105 transitions, 216 flow [2022-12-05 23:08:21,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 105 transitions, 216 flow [2022-12-05 23:08:21,562 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-05 23:08:21,563 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:21,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-05 23:08:21,566 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 105 transitions, 216 flow [2022-12-05 23:08:21,566 INFO L188 LiptonReduction]: Number of co-enabled transitions 1314 [2022-12-05 23:08:28,460 INFO L203 LiptonReduction]: Total number of compositions: 84 [2022-12-05 23:08:28,474 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:08:28,480 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;@5204d33c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:08:28,480 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 23:08:28,483 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-05 23:08:28,483 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:28,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:28,484 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:08:28,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-05 23:08:28,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:28,488 INFO L85 PathProgramCache]: Analyzing trace with hash 581242839, now seen corresponding path program 1 times [2022-12-05 23:08:28,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:28,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075704722] [2022-12-05 23:08:28,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:28,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:08:28,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:28,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075704722] [2022-12-05 23:08:28,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075704722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:28,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:28,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:08:28,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900418936] [2022-12-05 23:08:28,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:28,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:08:28,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:28,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:08:28,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:08:28,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 23:08:28,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 54 flow. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:28,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:28,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 23:08:28,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:29,130 INFO L130 PetriNetUnfolder]: 455/756 cut-off events. [2022-12-05 23:08:29,130 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 23:08:29,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 756 events. 455/756 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3157 event pairs, 35 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 1520. Up to 673 conditions per place. [2022-12-05 23:08:29,136 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 29 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-12-05 23:08:29,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 130 flow [2022-12-05 23:08:29,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:08:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:08:29,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-05 23:08:29,146 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 23:08:29,148 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 54 flow. Second operand 3 states and 36 transitions. [2022-12-05 23:08:29,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 130 flow [2022-12-05 23:08:29,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:29,152 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 50 flow [2022-12-05 23:08:29,153 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2022-12-05 23:08:29,156 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2022-12-05 23:08:29,156 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:29,157 INFO L89 Accepts]: Start accepts. Operand has 28 places, 21 transitions, 50 flow [2022-12-05 23:08:29,158 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:29,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:29,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 21 transitions, 50 flow [2022-12-05 23:08:29,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 21 transitions, 50 flow [2022-12-05 23:08:29,165 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-05 23:08:29,165 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:29,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:08:29,166 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 21 transitions, 50 flow [2022-12-05 23:08:29,166 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-05 23:08:29,351 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:29,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-05 23:08:29,353 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 50 flow [2022-12-05 23:08:29,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:29,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:29,353 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 23:08:29,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:08:29,354 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-05 23:08:29,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:29,354 INFO L85 PathProgramCache]: Analyzing trace with hash 838659334, now seen corresponding path program 1 times [2022-12-05 23:08:29,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:29,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725970360] [2022-12-05 23:08:29,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:29,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:29,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:08:29,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:29,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725970360] [2022-12-05 23:08:29,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725970360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:29,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:29,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:08:29,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072069625] [2022-12-05 23:08:29,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:29,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:08:29,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:29,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:08:29,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:08:29,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 23:08:29,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 50 flow. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:29,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:29,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 23:08:29,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:29,618 INFO L130 PetriNetUnfolder]: 395/660 cut-off events. [2022-12-05 23:08:29,618 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-05 23:08:29,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 660 events. 395/660 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2567 event pairs, 95 based on Foata normal form. 0/576 useless extension candidates. Maximal degree in co-relation 1364. Up to 481 conditions per place. [2022-12-05 23:08:29,622 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 24 selfloop transitions, 2 changer transitions 4/30 dead transitions. [2022-12-05 23:08:29,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 30 transitions, 128 flow [2022-12-05 23:08:29,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:08:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:08:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-05 23:08:29,623 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2022-12-05 23:08:29,623 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 50 flow. Second operand 3 states and 31 transitions. [2022-12-05 23:08:29,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 30 transitions, 128 flow [2022-12-05 23:08:29,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:29,625 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2022-12-05 23:08:29,625 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2022-12-05 23:08:29,626 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-05 23:08:29,626 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:29,626 INFO L89 Accepts]: Start accepts. Operand has 27 places, 18 transitions, 44 flow [2022-12-05 23:08:29,626 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:29,626 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:29,626 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 18 transitions, 44 flow [2022-12-05 23:08:29,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 18 transitions, 44 flow [2022-12-05 23:08:29,631 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-05 23:08:29,631 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:29,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 18 events. 0/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:08:29,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 18 transitions, 44 flow [2022-12-05 23:08:29,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-05 23:08:29,851 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:29,852 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-05 23:08:29,852 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2022-12-05 23:08:29,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:29,852 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:29,852 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:29,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:08:29,853 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-05 23:08:29,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:29,853 INFO L85 PathProgramCache]: Analyzing trace with hash 228671409, now seen corresponding path program 1 times [2022-12-05 23:08:29,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:29,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259235595] [2022-12-05 23:08:29,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:29,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:08:30,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:30,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259235595] [2022-12-05 23:08:30,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259235595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:30,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:30,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:08:30,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385973517] [2022-12-05 23:08:30,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:30,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:08:30,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:30,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:08:30,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:08:30,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:08:30,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:30,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:30,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:08:30,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:30,171 INFO L130 PetriNetUnfolder]: 214/374 cut-off events. [2022-12-05 23:08:30,171 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-05 23:08:30,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 374 events. 214/374 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1347 event pairs, 94 based on Foata normal form. 21/395 useless extension candidates. Maximal degree in co-relation 777. Up to 225 conditions per place. [2022-12-05 23:08:30,174 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 26 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2022-12-05 23:08:30,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 124 flow [2022-12-05 23:08:30,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:08:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:08:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-05 23:08:30,175 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2022-12-05 23:08:30,175 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 3 states and 29 transitions. [2022-12-05 23:08:30,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 124 flow [2022-12-05 23:08:30,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:30,177 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 48 flow [2022-12-05 23:08:30,177 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2022-12-05 23:08:30,177 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -4 predicate places. [2022-12-05 23:08:30,178 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:30,178 INFO L89 Accepts]: Start accepts. Operand has 26 places, 18 transitions, 48 flow [2022-12-05 23:08:30,178 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:30,178 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:30,178 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 18 transitions, 48 flow [2022-12-05 23:08:30,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 18 transitions, 48 flow [2022-12-05 23:08:30,183 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-05 23:08:30,183 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:30,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 18 events. 0/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:08:30,184 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 18 transitions, 48 flow [2022-12-05 23:08:30,184 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-05 23:08:30,226 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:30,228 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-05 23:08:30,228 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 48 flow [2022-12-05 23:08:30,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:30,228 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:30,228 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:30,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:08:30,229 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-05 23:08:30,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:30,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1948856575, now seen corresponding path program 1 times [2022-12-05 23:08:30,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:30,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494540207] [2022-12-05 23:08:30,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:30,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:08:30,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:30,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494540207] [2022-12-05 23:08:30,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494540207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:30,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:30,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:08:30,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654483701] [2022-12-05 23:08:30,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:30,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:08:30,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:30,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:08:30,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:08:30,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:08:30,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 48 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:30,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:30,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:08:30,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:30,856 INFO L130 PetriNetUnfolder]: 199/350 cut-off events. [2022-12-05 23:08:30,856 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-05 23:08:30,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 350 events. 199/350 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1139 event pairs, 83 based on Foata normal form. 9/359 useless extension candidates. Maximal degree in co-relation 766. Up to 210 conditions per place. [2022-12-05 23:08:30,858 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-05 23:08:30,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 25 transitions, 115 flow [2022-12-05 23:08:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:08:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:08:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-05 23:08:30,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2022-12-05 23:08:30,860 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 48 flow. Second operand 3 states and 26 transitions. [2022-12-05 23:08:30,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 25 transitions, 115 flow [2022-12-05 23:08:30,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 109 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:30,861 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 52 flow [2022-12-05 23:08:30,862 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2022-12-05 23:08:30,862 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-05 23:08:30,863 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:30,863 INFO L89 Accepts]: Start accepts. Operand has 27 places, 18 transitions, 52 flow [2022-12-05 23:08:30,863 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:30,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:30,864 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 18 transitions, 52 flow [2022-12-05 23:08:30,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 18 transitions, 52 flow [2022-12-05 23:08:30,868 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-05 23:08:30,869 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:08:30,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 18 events. 0/18 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:08:30,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 18 transitions, 52 flow [2022-12-05 23:08:30,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-05 23:08:30,870 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:30,871 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-05 23:08:30,871 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 52 flow [2022-12-05 23:08:30,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:30,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:30,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:30,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:08:30,872 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-05 23:08:30,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:30,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1884650672, now seen corresponding path program 1 times [2022-12-05 23:08:30,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:30,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371479981] [2022-12-05 23:08:30,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:30,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:08:31,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:31,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371479981] [2022-12-05 23:08:31,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371479981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:31,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:31,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 23:08:31,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105394245] [2022-12-05 23:08:31,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:31,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 23:08:31,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:31,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 23:08:31,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-05 23:08:31,855 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:08:31,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 52 flow. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:31,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:31,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:08:31,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:32,135 INFO L130 PetriNetUnfolder]: 268/478 cut-off events. [2022-12-05 23:08:32,136 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-12-05 23:08:32,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 478 events. 268/478 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1880 event pairs, 11 based on Foata normal form. 6/484 useless extension candidates. Maximal degree in co-relation 1094. Up to 293 conditions per place. [2022-12-05 23:08:32,138 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 37 selfloop transitions, 19 changer transitions 0/56 dead transitions. [2022-12-05 23:08:32,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 56 transitions, 252 flow [2022-12-05 23:08:32,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:08:32,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:08:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-12-05 23:08:32,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2022-12-05 23:08:32,141 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 52 flow. Second operand 7 states and 58 transitions. [2022-12-05 23:08:32,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 56 transitions, 252 flow [2022-12-05 23:08:32,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 56 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:32,143 INFO L231 Difference]: Finished difference. Result has 33 places, 37 transitions, 167 flow [2022-12-05 23:08:32,143 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=167, PETRI_PLACES=33, PETRI_TRANSITIONS=37} [2022-12-05 23:08:32,144 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2022-12-05 23:08:32,144 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:32,144 INFO L89 Accepts]: Start accepts. Operand has 33 places, 37 transitions, 167 flow [2022-12-05 23:08:32,145 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:32,145 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:32,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 37 transitions, 167 flow [2022-12-05 23:08:32,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 37 transitions, 167 flow [2022-12-05 23:08:32,166 INFO L130 PetriNetUnfolder]: 38/127 cut-off events. [2022-12-05 23:08:32,167 INFO L131 PetriNetUnfolder]: For 54/59 co-relation queries the response was YES. [2022-12-05 23:08:32,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 127 events. 38/127 cut-off events. For 54/59 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 578 event pairs, 3 based on Foata normal form. 3/125 useless extension candidates. Maximal degree in co-relation 278. Up to 40 conditions per place. [2022-12-05 23:08:32,168 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 37 transitions, 167 flow [2022-12-05 23:08:32,168 INFO L188 LiptonReduction]: Number of co-enabled transitions 170 [2022-12-05 23:08:32,224 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:32,225 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-05 23:08:32,225 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 37 transitions, 167 flow [2022-12-05 23:08:32,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:32,225 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:32,226 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:32,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:08:32,226 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-05 23:08:32,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:32,226 INFO L85 PathProgramCache]: Analyzing trace with hash 901105394, now seen corresponding path program 2 times [2022-12-05 23:08:32,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:32,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395977388] [2022-12-05 23:08:32,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:32,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:08:33,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:33,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395977388] [2022-12-05 23:08:33,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395977388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:33,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:33,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 23:08:33,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729646966] [2022-12-05 23:08:33,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:33,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 23:08:33,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:33,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 23:08:33,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-05 23:08:33,546 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:08:33,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 37 transitions, 167 flow. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:33,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:33,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:08:33,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:33,854 INFO L130 PetriNetUnfolder]: 228/405 cut-off events. [2022-12-05 23:08:33,854 INFO L131 PetriNetUnfolder]: For 250/250 co-relation queries the response was YES. [2022-12-05 23:08:33,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 405 events. 228/405 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1484 event pairs, 82 based on Foata normal form. 8/413 useless extension candidates. Maximal degree in co-relation 1217. Up to 205 conditions per place. [2022-12-05 23:08:33,857 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 37 selfloop transitions, 12 changer transitions 0/49 dead transitions. [2022-12-05 23:08:33,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 309 flow [2022-12-05 23:08:33,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:08:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:08:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-12-05 23:08:33,859 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37962962962962965 [2022-12-05 23:08:33,859 INFO L175 Difference]: Start difference. First operand has 33 places, 37 transitions, 167 flow. Second operand 6 states and 41 transitions. [2022-12-05 23:08:33,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 309 flow [2022-12-05 23:08:33,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 309 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:08:33,864 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 223 flow [2022-12-05 23:08:33,865 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2022-12-05 23:08:33,866 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2022-12-05 23:08:33,867 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:33,867 INFO L89 Accepts]: Start accepts. Operand has 41 places, 38 transitions, 223 flow [2022-12-05 23:08:33,868 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:33,869 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:33,869 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 38 transitions, 223 flow [2022-12-05 23:08:33,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 38 transitions, 223 flow [2022-12-05 23:08:33,895 INFO L130 PetriNetUnfolder]: 38/128 cut-off events. [2022-12-05 23:08:33,896 INFO L131 PetriNetUnfolder]: For 106/108 co-relation queries the response was YES. [2022-12-05 23:08:33,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 128 events. 38/128 cut-off events. For 106/108 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 566 event pairs, 4 based on Foata normal form. 2/127 useless extension candidates. Maximal degree in co-relation 349. Up to 44 conditions per place. [2022-12-05 23:08:33,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 38 transitions, 223 flow [2022-12-05 23:08:33,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-05 23:08:33,905 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [528] $Ultimate##0-->L804: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_260 256) 0)) (not (= (mod v_~x$w_buff0_used~0_273 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| 0)) (= v_~x$w_buff0~0_156 v_~x$w_buff1~0_144) (= v_~x$w_buff0_used~0_273 1) (= v_~x$r_buff1_thd0~0_97 v_~x$r_buff0_thd0~0_97) (= v_~x$w_buff0_used~0_274 v_~x$w_buff1_used~0_260) (= |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_104 1) (= 2 v_~x$w_buff0~0_155) (= v_~x$r_buff1_thd2~0_93 v_~x$r_buff0_thd2~0_105) (= v_~x$r_buff1_thd1~0_98 v_~x$r_buff0_thd1~0_107)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_156, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_105, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_274} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, 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_144, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_98, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_104, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_273, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-05 23:08:34,402 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] $Ultimate##0-->L756: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~x~0_234 1) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_234, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [528] $Ultimate##0-->L804: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_260 256) 0)) (not (= (mod v_~x$w_buff0_used~0_273 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| 0)) (= v_~x$w_buff0~0_156 v_~x$w_buff1~0_144) (= v_~x$w_buff0_used~0_273 1) (= v_~x$r_buff1_thd0~0_97 v_~x$r_buff0_thd0~0_97) (= v_~x$w_buff0_used~0_274 v_~x$w_buff1_used~0_260) (= |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_104 1) (= 2 v_~x$w_buff0~0_155) (= v_~x$r_buff1_thd2~0_93 v_~x$r_buff0_thd2~0_105) (= v_~x$r_buff1_thd1~0_98 v_~x$r_buff0_thd1~0_107)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_156, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_105, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_274} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, 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_144, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_98, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_104, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_273, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-05 23:08:34,514 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:08:34,515 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 648 [2022-12-05 23:08:34,515 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 219 flow [2022-12-05 23:08:34,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:34,515 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:34,516 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:34,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:08:34,516 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-05 23:08:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:34,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1884319877, now seen corresponding path program 1 times [2022-12-05 23:08:34,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:34,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326045560] [2022-12-05 23:08:34,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:34,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:08:35,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:35,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326045560] [2022-12-05 23:08:35,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326045560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:35,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:35,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:08:35,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252715937] [2022-12-05 23:08:35,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:35,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:08:35,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:35,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:08:35,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:08:35,147 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 23:08:35,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 219 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:35,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:35,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 23:08:35,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:35,518 INFO L130 PetriNetUnfolder]: 283/498 cut-off events. [2022-12-05 23:08:35,519 INFO L131 PetriNetUnfolder]: For 706/706 co-relation queries the response was YES. [2022-12-05 23:08:35,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1777 conditions, 498 events. 283/498 cut-off events. For 706/706 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2001 event pairs, 22 based on Foata normal form. 6/504 useless extension candidates. Maximal degree in co-relation 1758. Up to 282 conditions per place. [2022-12-05 23:08:35,522 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 36 selfloop transitions, 33 changer transitions 0/69 dead transitions. [2022-12-05 23:08:35,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 69 transitions, 516 flow [2022-12-05 23:08:35,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 23:08:35,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 23:08:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-12-05 23:08:35,526 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-05 23:08:35,526 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 219 flow. Second operand 8 states and 64 transitions. [2022-12-05 23:08:35,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 69 transitions, 516 flow [2022-12-05 23:08:35,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 69 transitions, 488 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:35,533 INFO L231 Difference]: Finished difference. Result has 48 places, 55 transitions, 424 flow [2022-12-05 23:08:35,533 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=424, PETRI_PLACES=48, PETRI_TRANSITIONS=55} [2022-12-05 23:08:35,534 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2022-12-05 23:08:35,534 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:35,534 INFO L89 Accepts]: Start accepts. Operand has 48 places, 55 transitions, 424 flow [2022-12-05 23:08:35,535 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:35,535 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:35,535 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 55 transitions, 424 flow [2022-12-05 23:08:35,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 55 transitions, 424 flow [2022-12-05 23:08:35,569 INFO L130 PetriNetUnfolder]: 74/186 cut-off events. [2022-12-05 23:08:35,569 INFO L131 PetriNetUnfolder]: For 371/393 co-relation queries the response was YES. [2022-12-05 23:08:35,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 186 events. 74/186 cut-off events. For 371/393 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 868 event pairs, 5 based on Foata normal form. 12/190 useless extension candidates. Maximal degree in co-relation 656. Up to 87 conditions per place. [2022-12-05 23:08:35,571 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 55 transitions, 424 flow [2022-12-05 23:08:35,571 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-05 23:08:35,616 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [471] L779-->L786: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_38 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_107) v_~x$w_buff1_used~0_106) (= v_~x$r_buff0_thd1~0_43 (ite .cse2 0 v_~x$r_buff0_thd1~0_44)) (= v_~x$r_buff1_thd1~0_37 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_106 256) 0)))) 0 v_~x$r_buff1_thd1~0_38)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_41 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_38, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-05 23:08:35,974 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [539] $Ultimate##0-->L756: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~x~0_234 1) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_234, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] [2022-12-05 23:08:36,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [470] L763-->L779: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_70 256) 0)) (.cse5 (= (mod v_~x$r_buff0_thd1~0_80 256) 0))) (let ((.cse7 (not .cse5)) (.cse10 (and (= 0 (mod v_~x$w_buff1_used~0_199 256)) .cse5)) (.cse3 (and .cse8 .cse5)) (.cse11 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse0 (or .cse10 .cse3 .cse11)) (.cse1 (and .cse7 (not .cse11))) (.cse4 (= (mod v_~x$w_buff1_used~0_198 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_112 256) 0))) (.cse6 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= v_~x$flush_delayed~0_75 0) (= (ite .cse0 v_~x~0_159 (ite .cse1 v_~x$w_buff0~0_104 v_~x$w_buff1~0_101)) v_~__unbuffered_p0_EAX~0_14) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse2 v_~x$mem_tmp~0_56 v_~__unbuffered_p0_EAX~0_14) v_~x~0_157) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_112) (= v_~x$r_buff0_thd1~0_79 (ite .cse2 v_~x$r_buff0_thd1~0_80 (ite (or .cse3 (and .cse4 .cse5) .cse6) v_~x$r_buff0_thd1~0_80 (ite (and .cse7 (not .cse6)) 0 v_~x$r_buff0_thd1~0_80)))) (= (ite .cse2 v_~x$w_buff0_used~0_204 (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse1 0 v_~x$w_buff0_used~0_204))) v_~x$w_buff0_used~0_203) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd1~0_69 (ite .cse2 v_~x$r_buff1_thd1~0_70 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_79 256) 0))) (or (and .cse8 .cse9) .cse6 (and .cse4 .cse9))) v_~x$r_buff1_thd1~0_70 0))) (= v_~x$w_buff1_used~0_198 (ite .cse2 v_~x$w_buff1_used~0_199 (ite (or .cse10 .cse3 .cse6) v_~x$w_buff1_used~0_199 0))) (= v_~x$w_buff1~0_101 v_~x$w_buff1~0_100) (= v_~x$mem_tmp~0_56 v_~x~0_159))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_101, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_70, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_159, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_79, ~x$flush_delayed~0=v_~x$flush_delayed~0_75, ~x$w_buff1~0=v_~x$w_buff1~0_100, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_69, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~x~0=v_~x~0_157} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-05 23:08:36,663 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [482] L847-->L859: Formula: (let ((.cse7 (not (= (mod v_~x$w_buff0_used~0_181 256) 0))) (.cse8 (not (= (mod v_~x$r_buff1_thd2~0_68 256) 0))) (.cse11 (not (= (mod v_~x$r_buff0_thd2~0_73 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_81 256) 0))) (.cse10 (not (= (mod v_~y$r_buff0_thd2~0_55 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_50 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_75 256) 0)) .cse3)) (.cse2 (and .cse4 .cse10)) (.cse5 (and (not (= (mod v_~x$w_buff0_used~0_182 256) 0)) .cse11)) (.cse6 (and .cse8 (not (= (mod v_~x$w_buff1_used~0_175 256) 0)))) (.cse9 (and .cse7 .cse11)) (.cse0 (and .cse10 (not (= (mod v_~y$w_buff0_used~0_82 256) 0))))) (and (= v_~y~0_70 (ite .cse0 v_~y$w_buff0~0_53 (ite .cse1 v_~y$w_buff1~0_48 v_~y~0_71))) (= v_~y$w_buff1_used~0_74 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_75)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_74 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_54 256) 0)))) 0 v_~y$r_buff1_thd2~0_50) v_~y$r_buff1_thd2~0_49) (= v_~y$r_buff0_thd2~0_54 (ite .cse2 0 v_~y$r_buff0_thd2~0_55)) (= (ite .cse5 v_~x$w_buff0~0_93 (ite .cse6 v_~x$w_buff1~0_90 v_~x~0_142)) v_~x~0_141) (= v_~x$r_buff1_thd2~0_67 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_72 256) 0)) .cse7) (and .cse8 (not (= (mod v_~x$w_buff1_used~0_174 256) 0)))) 0 v_~x$r_buff1_thd2~0_68)) (= (ite .cse9 0 v_~x$r_buff0_thd2~0_73) v_~x$r_buff0_thd2~0_72) (= v_~x$w_buff0_used~0_181 (ite .cse5 0 v_~x$w_buff0_used~0_182)) (= (ite (or .cse6 .cse9) 0 v_~x$w_buff1_used~0_175) v_~x$w_buff1_used~0_174) (= v_~y$w_buff0_used~0_81 (ite .cse0 0 v_~y$w_buff0_used~0_82))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_175, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_182, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_50, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, ~y~0=v_~y~0_71, ~x~0=v_~x~0_142, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_81, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_174, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_181, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_54, ~y~0=v_~y~0_70, ~x~0=v_~x~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_74} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~y~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] [2022-12-05 23:08:37,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [469] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_207 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_84 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_74 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_203 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_208 256) 0)) .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_107 (ite .cse1 v_~x$w_buff1~0_104 v_~x~0_164)) v_~x~0_163) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_203) v_~x$w_buff1_used~0_202) (= v_~x$r_buff0_thd1~0_83 (ite .cse2 0 v_~x$r_buff0_thd1~0_84)) (= (ite .cse0 0 v_~x$w_buff0_used~0_208) v_~x$w_buff0_used~0_207) (= v_~x$r_buff1_thd1~0_73 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_83 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_202 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_74))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_84, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_74, ~x~0=v_~x~0_164, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_208} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_83, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_202, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_73, ~x~0=v_~x~0_163, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_207} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-05 23:08:37,424 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:08:37,425 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1891 [2022-12-05 23:08:37,425 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 54 transitions, 442 flow [2022-12-05 23:08:37,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:37,425 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:37,425 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:37,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:08:37,426 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-05 23:08:37,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:37,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1976993349, now seen corresponding path program 2 times [2022-12-05 23:08:37,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:37,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658920230] [2022-12-05 23:08:37,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:37,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:08:38,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:38,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658920230] [2022-12-05 23:08:38,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658920230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:38,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:38,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 23:08:38,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374169316] [2022-12-05 23:08:38,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:38,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 23:08:38,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:38,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 23:08:38,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-05 23:08:38,192 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 23:08:38,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 54 transitions, 442 flow. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:38,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:38,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 23:08:38,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:38,734 INFO L130 PetriNetUnfolder]: 470/827 cut-off events. [2022-12-05 23:08:38,735 INFO L131 PetriNetUnfolder]: For 1921/1921 co-relation queries the response was YES. [2022-12-05 23:08:38,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3538 conditions, 827 events. 470/827 cut-off events. For 1921/1921 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3842 event pairs, 83 based on Foata normal form. 9/836 useless extension candidates. Maximal degree in co-relation 3514. Up to 325 conditions per place. [2022-12-05 23:08:38,740 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 62 selfloop transitions, 33 changer transitions 25/120 dead transitions. [2022-12-05 23:08:38,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 120 transitions, 1126 flow [2022-12-05 23:08:38,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 23:08:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 23:08:38,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-12-05 23:08:38,742 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3894230769230769 [2022-12-05 23:08:38,742 INFO L175 Difference]: Start difference. First operand has 47 places, 54 transitions, 442 flow. Second operand 8 states and 81 transitions. [2022-12-05 23:08:38,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 120 transitions, 1126 flow [2022-12-05 23:08:38,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 120 transitions, 1050 flow, removed 36 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:38,751 INFO L231 Difference]: Finished difference. Result has 56 places, 63 transitions, 598 flow [2022-12-05 23:08:38,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=598, PETRI_PLACES=56, PETRI_TRANSITIONS=63} [2022-12-05 23:08:38,751 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2022-12-05 23:08:38,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:38,752 INFO L89 Accepts]: Start accepts. Operand has 56 places, 63 transitions, 598 flow [2022-12-05 23:08:38,752 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:38,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:38,753 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 63 transitions, 598 flow [2022-12-05 23:08:38,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 63 transitions, 598 flow [2022-12-05 23:08:38,826 INFO L130 PetriNetUnfolder]: 98/228 cut-off events. [2022-12-05 23:08:38,827 INFO L131 PetriNetUnfolder]: For 716/729 co-relation queries the response was YES. [2022-12-05 23:08:38,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 228 events. 98/228 cut-off events. For 716/729 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1041 event pairs, 12 based on Foata normal form. 5/222 useless extension candidates. Maximal degree in co-relation 990. Up to 132 conditions per place. [2022-12-05 23:08:38,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 63 transitions, 598 flow [2022-12-05 23:08:38,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-05 23:08:38,885 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:38,887 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-05 23:08:38,887 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 63 transitions, 598 flow [2022-12-05 23:08:38,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:38,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:38,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:38,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:08:38,888 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-05 23:08:38,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:38,888 INFO L85 PathProgramCache]: Analyzing trace with hash 564875148, now seen corresponding path program 1 times [2022-12-05 23:08:38,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:38,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054386217] [2022-12-05 23:08:38,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:38,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:39,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:08:39,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:39,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054386217] [2022-12-05 23:08:39,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054386217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:39,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:39,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:08:39,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296662726] [2022-12-05 23:08:39,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:39,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:08:39,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:39,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:08:39,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:08:39,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 23:08:39,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 63 transitions, 598 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:39,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:39,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 23:08:39,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:39,803 INFO L130 PetriNetUnfolder]: 352/645 cut-off events. [2022-12-05 23:08:39,803 INFO L131 PetriNetUnfolder]: For 2413/2413 co-relation queries the response was YES. [2022-12-05 23:08:39,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3115 conditions, 645 events. 352/645 cut-off events. For 2413/2413 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2915 event pairs, 146 based on Foata normal form. 11/656 useless extension candidates. Maximal degree in co-relation 3087. Up to 483 conditions per place. [2022-12-05 23:08:39,808 INFO L137 encePairwiseOnDemand]: 12/25 looper letters, 57 selfloop transitions, 7 changer transitions 26/90 dead transitions. [2022-12-05 23:08:39,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 90 transitions, 960 flow [2022-12-05 23:08:39,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:08:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:08:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-12-05 23:08:39,810 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32571428571428573 [2022-12-05 23:08:39,810 INFO L175 Difference]: Start difference. First operand has 55 places, 63 transitions, 598 flow. Second operand 7 states and 57 transitions. [2022-12-05 23:08:39,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 90 transitions, 960 flow [2022-12-05 23:08:39,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 90 transitions, 951 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 23:08:39,819 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 595 flow [2022-12-05 23:08:39,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=595, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2022-12-05 23:08:39,820 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 33 predicate places. [2022-12-05 23:08:39,820 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:39,820 INFO L89 Accepts]: Start accepts. Operand has 63 places, 59 transitions, 595 flow [2022-12-05 23:08:39,822 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:39,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:39,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 59 transitions, 595 flow [2022-12-05 23:08:39,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 59 transitions, 595 flow [2022-12-05 23:08:39,866 INFO L130 PetriNetUnfolder]: 86/200 cut-off events. [2022-12-05 23:08:39,866 INFO L131 PetriNetUnfolder]: For 755/768 co-relation queries the response was YES. [2022-12-05 23:08:39,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 200 events. 86/200 cut-off events. For 755/768 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 874 event pairs, 11 based on Foata normal form. 4/195 useless extension candidates. Maximal degree in co-relation 920. Up to 118 conditions per place. [2022-12-05 23:08:39,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 59 transitions, 595 flow [2022-12-05 23:08:39,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-05 23:08:39,881 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [588] $Ultimate##0-->L763: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_826 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_355 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_351 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_793 256) 0)))) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_827 256) 0)))) (.cse2 (and .cse4 .cse5))) (and (= v_P0Thread1of1ForFork1_~arg.offset_29 |v_P0Thread1of1ForFork1_#in~arg.offset_29|) (= (ite .cse0 v_~x$w_buff0~0_537 (ite .cse1 v_~x$w_buff1~0_516 1)) v_~x~0_751) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_793) v_~x$w_buff1_used~0_792) (= |v_P0Thread1of1ForFork1_#in~arg.base_29| v_P0Thread1of1ForFork1_~arg.base_29) (= v_~x$r_buff1_thd1~0_350 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_792 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_354 256) 0)))) 0 v_~x$r_buff1_thd1~0_351)) (= v_~x$w_buff0_used~0_826 (ite .cse0 0 v_~x$w_buff0_used~0_827)) (= (ite .cse2 0 v_~x$r_buff0_thd1~0_355) v_~x$r_buff0_thd1~0_354)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_537, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_355, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_516, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_793, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_351, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_827} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_537, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_354, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_516, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_792, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_29, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_350, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_29|, ~x~0=v_~x~0_751, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_29, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_826} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, P0Thread1of1ForFork1_~arg.offset, ~x$r_buff1_thd1~0, ~x~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0] and [528] $Ultimate##0-->L804: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_260 256) 0)) (not (= (mod v_~x$w_buff0_used~0_273 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| 0)) (= v_~x$w_buff0~0_156 v_~x$w_buff1~0_144) (= v_~x$w_buff0_used~0_273 1) (= v_~x$r_buff1_thd0~0_97 v_~x$r_buff0_thd0~0_97) (= v_~x$w_buff0_used~0_274 v_~x$w_buff1_used~0_260) (= |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_104 1) (= 2 v_~x$w_buff0~0_155) (= v_~x$r_buff1_thd2~0_93 v_~x$r_buff0_thd2~0_105) (= v_~x$r_buff1_thd1~0_98 v_~x$r_buff0_thd1~0_107)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_156, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_105, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_274} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, 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_144, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_98, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_104, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_273, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-05 23:08:41,075 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:08:41,076 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1256 [2022-12-05 23:08:41,076 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 58 transitions, 595 flow [2022-12-05 23:08:41,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:41,076 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:41,076 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:41,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:08:41,076 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-05 23:08:41,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:41,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1897120808, now seen corresponding path program 1 times [2022-12-05 23:08:41,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:41,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188842558] [2022-12-05 23:08:41,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:41,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:08:41,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:41,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188842558] [2022-12-05 23:08:41,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188842558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:41,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:41,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:08:41,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192677730] [2022-12-05 23:08:41,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:41,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:08:41,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:41,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:08:41,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:08:41,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 23:08:41,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 58 transitions, 595 flow. Second operand has 5 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-05 23:08:41,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:41,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 23:08:41,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:41,774 INFO L130 PetriNetUnfolder]: 323/601 cut-off events. [2022-12-05 23:08:41,774 INFO L131 PetriNetUnfolder]: For 2769/2769 co-relation queries the response was YES. [2022-12-05 23:08:41,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3012 conditions, 601 events. 323/601 cut-off events. For 2769/2769 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2705 event pairs, 68 based on Foata normal form. 18/619 useless extension candidates. Maximal degree in co-relation 2980. Up to 344 conditions per place. [2022-12-05 23:08:41,778 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 48 selfloop transitions, 9 changer transitions 19/76 dead transitions. [2022-12-05 23:08:41,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 76 transitions, 875 flow [2022-12-05 23:08:41,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:08:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:08:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-05 23:08:41,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3384615384615385 [2022-12-05 23:08:41,779 INFO L175 Difference]: Start difference. First operand has 57 places, 58 transitions, 595 flow. Second operand 5 states and 44 transitions. [2022-12-05 23:08:41,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 76 transitions, 875 flow [2022-12-05 23:08:41,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 76 transitions, 809 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-12-05 23:08:41,786 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 518 flow [2022-12-05 23:08:41,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=518, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2022-12-05 23:08:41,787 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2022-12-05 23:08:41,787 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:41,787 INFO L89 Accepts]: Start accepts. Operand has 56 places, 54 transitions, 518 flow [2022-12-05 23:08:41,788 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:41,788 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:41,788 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 54 transitions, 518 flow [2022-12-05 23:08:41,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 518 flow [2022-12-05 23:08:41,818 INFO L130 PetriNetUnfolder]: 51/140 cut-off events. [2022-12-05 23:08:41,818 INFO L131 PetriNetUnfolder]: For 530/542 co-relation queries the response was YES. [2022-12-05 23:08:41,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 140 events. 51/140 cut-off events. For 530/542 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 560 event pairs, 4 based on Foata normal form. 4/140 useless extension candidates. Maximal degree in co-relation 634. Up to 74 conditions per place. [2022-12-05 23:08:41,819 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 54 transitions, 518 flow [2022-12-05 23:08:41,819 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-05 23:08:43,339 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:08:43,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1555 [2022-12-05 23:08:43,342 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 524 flow [2022-12-05 23:08:43,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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-05 23:08:43,343 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:43,343 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:43,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:08:43,343 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-05 23:08:43,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:43,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1016809242, now seen corresponding path program 1 times [2022-12-05 23:08:43,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:43,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782496072] [2022-12-05 23:08:43,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:43,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:08:44,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:44,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782496072] [2022-12-05 23:08:44,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782496072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:44,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:44,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:08:44,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855925858] [2022-12-05 23:08:44,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:44,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:08:44,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:44,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:08:44,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:08:44,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 23:08:44,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 524 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:44,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:44,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 23:08:44,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:44,305 INFO L130 PetriNetUnfolder]: 185/349 cut-off events. [2022-12-05 23:08:44,305 INFO L131 PetriNetUnfolder]: For 1442/1442 co-relation queries the response was YES. [2022-12-05 23:08:44,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1761 conditions, 349 events. 185/349 cut-off events. For 1442/1442 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1331 event pairs, 102 based on Foata normal form. 6/354 useless extension candidates. Maximal degree in co-relation 1732. Up to 340 conditions per place. [2022-12-05 23:08:44,308 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 49 selfloop transitions, 4 changer transitions 1/54 dead transitions. [2022-12-05 23:08:44,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 610 flow [2022-12-05 23:08:44,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:08:44,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:08:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-05 23:08:44,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-05 23:08:44,310 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 524 flow. Second operand 4 states and 28 transitions. [2022-12-05 23:08:44,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 610 flow [2022-12-05 23:08:44,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 582 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-05 23:08:44,316 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 465 flow [2022-12-05 23:08:44,316 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=465, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2022-12-05 23:08:44,317 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2022-12-05 23:08:44,317 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:44,317 INFO L89 Accepts]: Start accepts. Operand has 55 places, 51 transitions, 465 flow [2022-12-05 23:08:44,320 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:44,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:44,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions, 465 flow [2022-12-05 23:08:44,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 465 flow [2022-12-05 23:08:44,347 INFO L130 PetriNetUnfolder]: 47/127 cut-off events. [2022-12-05 23:08:44,347 INFO L131 PetriNetUnfolder]: For 397/399 co-relation queries the response was YES. [2022-12-05 23:08:44,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 127 events. 47/127 cut-off events. For 397/399 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 489 event pairs, 5 based on Foata normal form. 1/125 useless extension candidates. Maximal degree in co-relation 557. Up to 68 conditions per place. [2022-12-05 23:08:44,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 51 transitions, 465 flow [2022-12-05 23:08:44,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-05 23:08:44,372 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [589] $Ultimate##0-->L804: Formula: (and (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_82| 0)) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_830 256) 0)) (not (= (mod v_~x$w_buff1_used~0_796 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_82|) (= v_~x$w_buff0_used~0_831 v_~x$w_buff1_used~0_796) (= v_~x~0_755 1) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_82| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_82|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_42| |v_P1Thread1of1ForFork0_~arg#1.offset_42|) (= v_~x$r_buff0_thd0~0_419 v_~x$r_buff1_thd0~0_412) (= |v_P1Thread1of1ForFork0_~arg#1.base_42| |v_P1Thread1of1ForFork0_#in~arg#1.base_42|) (= v_~x$r_buff0_thd1~0_358 v_~x$r_buff1_thd1~0_354) (= v_~x$w_buff0_used~0_830 1) (= v_~x$w_buff0~0_540 v_~x$w_buff1~0_518) (= v_~x$r_buff0_thd2~0_260 1) (= v_~x$r_buff0_thd2~0_261 v_~x$r_buff1_thd2~0_212) (= v_P0Thread1of1ForFork1_~arg.offset_31 |v_P0Thread1of1ForFork1_#in~arg.offset_31|) (= |v_P0Thread1of1ForFork1_#in~arg.base_31| v_P0Thread1of1ForFork1_~arg.base_31) (= 2 v_~x$w_buff0~0_539)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_540, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_419, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_42|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_358, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_31|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_31|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_261, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_831} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_539, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_419, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_82|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_358, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_42|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_42|, ~x$w_buff1~0=v_~x$w_buff1~0_518, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_212, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_796, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_354, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_82|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_31|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_260, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_412, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_42|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_830, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_42|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_31|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_31, ~x~0=v_~x~0_755} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~x~0] and [469] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_207 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_84 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_74 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_203 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_208 256) 0)) .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_107 (ite .cse1 v_~x$w_buff1~0_104 v_~x~0_164)) v_~x~0_163) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_203) v_~x$w_buff1_used~0_202) (= v_~x$r_buff0_thd1~0_83 (ite .cse2 0 v_~x$r_buff0_thd1~0_84)) (= (ite .cse0 0 v_~x$w_buff0_used~0_208) v_~x$w_buff0_used~0_207) (= v_~x$r_buff1_thd1~0_73 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_83 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_202 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_74))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_84, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_74, ~x~0=v_~x~0_164, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_208} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_83, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_202, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_73, ~x~0=v_~x~0_163, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_207} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-05 23:08:45,229 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-05 23:08:45,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [600] $Ultimate##0-->L763: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_1002 256) 0))) (.cse0 (not (= (mod v_~x$r_buff0_thd1~0_431 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_1004 256) 0))) (let ((.cse2 (and .cse0 (not .cse4))) (.cse3 (and .cse1 .cse0))) (and (= v_~x$r_buff0_thd2~0_300 1) (= v_~x$w_buff0_used~0_1002 (ite .cse0 0 1)) (= v_~x$r_buff0_thd0~0_541 v_~x$r_buff1_thd0~0_524) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_110| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_110|) (= v_~x$r_buff1_thd1~0_428 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_958 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_430 256) 0)))) 0 v_~x$r_buff0_thd1~0_431)) (= (ite .cse0 v_~x$w_buff0~0_647 (ite .cse2 v_~x$w_buff1~0_622 1)) v_~x~0_920) (= 2 v_~x$w_buff0~0_647) (= v_~x$w_buff0~0_648 v_~x$w_buff1~0_622) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_110| 0)) (= v_P0Thread1of1ForFork1_~arg.offset_37 |v_P0Thread1of1ForFork1_#in~arg.offset_37|) (= |v_P0Thread1of1ForFork1_#in~arg.base_37| v_P0Thread1of1ForFork1_~arg.base_37) (= (ite .cse3 0 v_~x$r_buff0_thd1~0_431) v_~x$r_buff0_thd1~0_430) (= (ite .cse4 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_110|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_46| |v_P1Thread1of1ForFork0_~arg#1.offset_46|) (= v_~x$r_buff0_thd2~0_301 v_~x$r_buff1_thd2~0_236) (= |v_P1Thread1of1ForFork0_~arg#1.base_46| |v_P1Thread1of1ForFork0_#in~arg#1.base_46|) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff0_used~0_1004) v_~x$w_buff1_used~0_958)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_648, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_541, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_46|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_431, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_37|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_37|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_301, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_46|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1004} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_647, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_541, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_110|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_430, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_46|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_46|, ~x$w_buff1~0=v_~x$w_buff1~0_622, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_958, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_236, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_110|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_37|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_300, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_524, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_46|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1002, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_46|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_37|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_37, ~x~0=v_~x~0_920} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~x~0] and [481] L831-->L847: Formula: (let ((.cse2 (= (mod v_~x$r_buff1_thd2~0_76 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd2~0_81 256) 0))) (let ((.cse9 (not .cse8)) (.cse10 (and .cse8 (= (mod v_~x$w_buff1_used~0_213 256) 0))) (.cse7 (and .cse8 .cse2)) (.cse11 (= (mod v_~x$w_buff0_used~0_220 256) 0))) (let ((.cse5 (or .cse10 .cse7 .cse11)) (.cse6 (and (not .cse11) .cse9)) (.cse3 (= (mod v_~x$w_buff1_used~0_212 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_118 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_219 256) 0))) (and (= (ite .cse0 v_~x$mem_tmp~0_60 v_~__unbuffered_p1_EBX~0_18) v_~x~0_171) (= v_~x$w_buff1~0_113 v_~x$w_buff1~0_112) (= v_~x$mem_tmp~0_60 v_~x~0_173) (= v_~weak$$choice2~0_118 |v_P1Thread1of1ForFork0_#t~nondet8#1_1|) (= v_~x$flush_delayed~0_83 0) (= v_~x$r_buff1_thd2~0_75 (ite .cse0 v_~x$r_buff1_thd2~0_76 (ite (let ((.cse1 (= (mod v_~x$r_buff0_thd2~0_80 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~x$r_buff1_thd2~0_76 0))) (= |v_P1Thread1of1ForFork0_#t~nondet7#1_1| v_~weak$$choice0~0_28) (= (ite .cse0 v_~x$w_buff0_used~0_220 (ite .cse5 v_~x$w_buff0_used~0_220 (ite .cse6 0 v_~x$w_buff0_used~0_220))) v_~x$w_buff0_used~0_219) (= v_~__unbuffered_p1_EBX~0_18 (ite .cse5 v_~x~0_173 (ite .cse6 v_~x$w_buff0~0_118 v_~x$w_buff1~0_113))) (= (ite .cse0 v_~x$r_buff0_thd2~0_81 (ite (or .cse7 .cse4 (and .cse3 .cse8)) v_~x$r_buff0_thd2~0_81 (ite (and (not .cse4) .cse9) 0 v_~x$r_buff0_thd2~0_81))) v_~x$r_buff0_thd2~0_80) (= v_~x$w_buff0~0_118 v_~x$w_buff0~0_117) (= v_~x$w_buff1_used~0_212 (ite .cse0 v_~x$w_buff1_used~0_213 (ite (or .cse10 .cse7 .cse4) v_~x$w_buff1_used~0_213 0))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_118, ~x$w_buff1~0=v_~x$w_buff1~0_113, P1Thread1of1ForFork0_#t~nondet7#1=|v_P1Thread1of1ForFork0_#t~nondet7#1_1|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_213, P1Thread1of1ForFork0_#t~nondet8#1=|v_P1Thread1of1ForFork0_#t~nondet8#1_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_81, ~x~0=v_~x~0_173, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_220} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_117, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~x$flush_delayed~0=v_~x$flush_delayed~0_83, ~x$w_buff1~0=v_~x$w_buff1~0_112, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_212, ~x$mem_tmp~0=v_~x$mem_tmp~0_60, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_80, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_219, ~weak$$choice0~0=v_~weak$$choice0~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_118, ~x~0=v_~x~0_171} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~nondet8#1, ~x$w_buff0_used~0, ~weak$$choice0~0, P1Thread1of1ForFork0_#t~nondet7#1, ~weak$$choice2~0, ~x~0] [2022-12-05 23:08:45,543 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:08:45,544 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-05 23:08:45,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:08:45,545 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-05 23:08:45,548 INFO L158 Benchmark]: Toolchain (without parser) took 25959.32ms. Allocated memory was 203.4MB in the beginning and 571.5MB in the end (delta: 368.1MB). Free memory was 178.2MB in the beginning and 336.1MB in the end (delta: -157.9MB). Peak memory consumption was 210.7MB. Max. memory is 8.0GB. [2022-12-05 23:08:45,548 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 203.4MB. Free memory is still 180.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:08:45,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 627.90ms. Allocated memory is still 203.4MB. Free memory was 178.2MB in the beginning and 147.8MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-05 23:08:45,548 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.82ms. Allocated memory is still 203.4MB. Free memory was 147.8MB in the beginning and 144.2MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:08:45,549 INFO L158 Benchmark]: Boogie Preprocessor took 57.85ms. Allocated memory is still 203.4MB. Free memory was 144.2MB in the beginning and 141.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:08:45,549 INFO L158 Benchmark]: RCFGBuilder took 950.16ms. Allocated memory was 203.4MB in the beginning and 257.9MB in the end (delta: 54.5MB). Free memory was 141.5MB in the beginning and 215.0MB in the end (delta: -73.4MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. [2022-12-05 23:08:45,549 INFO L158 Benchmark]: TraceAbstraction took 24234.20ms. Allocated memory was 257.9MB in the beginning and 571.5MB in the end (delta: 313.5MB). Free memory was 213.9MB in the beginning and 336.1MB in the end (delta: -122.2MB). Peak memory consumption was 191.8MB. Max. memory is 8.0GB. [2022-12-05 23:08:45,550 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 203.4MB. Free memory is still 180.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 627.90ms. Allocated memory is still 203.4MB. Free memory was 178.2MB in the beginning and 147.8MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 82.82ms. Allocated memory is still 203.4MB. Free memory was 147.8MB in the beginning and 144.2MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.85ms. Allocated memory is still 203.4MB. Free memory was 144.2MB in the beginning and 141.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 950.16ms. Allocated memory was 203.4MB in the beginning and 257.9MB in the end (delta: 54.5MB). Free memory was 141.5MB in the beginning and 215.0MB in the end (delta: -73.4MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. * TraceAbstraction took 24234.20ms. Allocated memory was 257.9MB in the beginning and 571.5MB in the end (delta: 313.5MB). Free memory was 213.9MB in the beginning and 336.1MB in the end (delta: -122.2MB). Peak memory consumption was 191.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9s, 110 PlacesBefore, 30 PlacesAfterwards, 105 TransitionsBefore, 24 TransitionsAfterwards, 1314 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 50 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 84 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1017, independent: 958, independent conditional: 958, independent unconditional: 0, dependent: 59, dependent conditional: 59, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1017, independent: 958, independent conditional: 0, independent unconditional: 958, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1017, independent: 958, independent conditional: 0, independent unconditional: 958, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1017, independent: 958, independent conditional: 0, independent unconditional: 958, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 891, independent: 849, independent conditional: 0, independent unconditional: 849, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 891, independent: 825, independent conditional: 0, independent unconditional: 825, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 514, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 493, dependent conditional: 0, dependent unconditional: 493, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1017, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 891, unknown conditional: 0, unknown unconditional: 891] , Statistics on independence cache: Total cache size (in pairs): 1177, Positive cache size: 1135, Positive conditional cache size: 0, Positive unconditional cache size: 1135, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 28 PlacesBefore, 28 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 81, independent: 55, independent conditional: 2, independent unconditional: 53, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 81, independent: 55, independent conditional: 2, independent unconditional: 53, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 81, independent: 55, independent conditional: 2, independent unconditional: 53, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 76, independent: 53, independent conditional: 2, independent unconditional: 51, dependent: 23, dependent conditional: 7, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 76, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 7, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 182, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 182, dependent conditional: 38, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 81, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 76, unknown conditional: 9, unknown unconditional: 67] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 53, Positive conditional cache size: 2, Positive unconditional cache size: 51, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 25 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 24, independent conditional: 24, 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: 46, independent: 24, independent conditional: 10, independent unconditional: 14, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 24, independent conditional: 10, independent unconditional: 14, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 24, independent conditional: 10, independent unconditional: 14, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 217, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 216, dependent conditional: 13, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 16, independent conditional: 10, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 26, unknown conditional: 2, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 61, Positive conditional cache size: 2, Positive unconditional cache size: 59, Negative cache size: 41, Negative conditional cache size: 9, Negative unconditional cache size: 32, 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, 26 PlacesBefore, 26 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 58, independent: 38, independent conditional: 6, independent unconditional: 32, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 67, Positive conditional cache size: 2, Positive unconditional cache size: 65, Negative cache size: 46, Negative conditional cache size: 9, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 41, independent conditional: 2, independent unconditional: 39, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 19, dependent conditional: 0, dependent unconditional: 19, 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: 60, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 69, Positive conditional cache size: 2, Positive unconditional cache size: 67, Negative cache size: 46, Negative conditional cache size: 9, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 33 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 170 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 82, independent conditional: 82, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 82, independent conditional: 52, independent unconditional: 30, dependent: 14, dependent conditional: 6, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, independent: 82, independent conditional: 36, independent unconditional: 46, dependent: 14, dependent conditional: 6, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, independent: 82, independent conditional: 36, independent unconditional: 46, dependent: 14, dependent conditional: 6, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, independent: 79, independent conditional: 35, independent unconditional: 44, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 72, Positive conditional cache size: 3, Positive unconditional cache size: 69, Negative cache size: 50, Negative conditional cache size: 13, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 41 PlacesBefore, 39 PlacesAfterwards, 38 TransitionsBefore, 36 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 132, independent: 104, independent conditional: 104, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 132, independent: 104, independent conditional: 52, independent unconditional: 52, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 132, independent: 104, independent conditional: 32, independent unconditional: 72, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 132, independent: 104, independent conditional: 32, independent unconditional: 72, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 10, independent conditional: 2, independent unconditional: 8, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 43, dependent conditional: 29, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, independent: 94, independent conditional: 30, independent unconditional: 64, dependent: 25, dependent conditional: 14, dependent unconditional: 11, unknown: 13, unknown conditional: 4, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 91, Positive conditional cache size: 5, Positive unconditional cache size: 86, Negative cache size: 53, Negative conditional cache size: 15, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 48 PlacesBefore, 47 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 210, independent: 169, independent conditional: 95, independent unconditional: 74, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 210, independent: 169, independent conditional: 75, independent unconditional: 94, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 210, independent: 169, independent conditional: 75, independent unconditional: 94, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 5, independent unconditional: 1, 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: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 210, independent: 163, independent conditional: 70, independent unconditional: 93, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 104, Positive conditional cache size: 10, Positive unconditional cache size: 94, Negative cache size: 54, Negative conditional cache size: 15, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 55 PlacesBefore, 55 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 147, independent: 115, independent conditional: 115, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 147, independent: 115, independent conditional: 82, independent unconditional: 33, dependent: 32, dependent conditional: 20, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 157, independent: 115, independent conditional: 67, independent unconditional: 48, dependent: 42, dependent conditional: 30, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 157, independent: 115, independent conditional: 67, independent unconditional: 48, dependent: 42, dependent conditional: 30, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 157, independent: 113, independent conditional: 66, independent unconditional: 47, dependent: 36, dependent conditional: 24, dependent unconditional: 12, unknown: 8, unknown conditional: 7, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 106, Positive conditional cache size: 11, Positive unconditional cache size: 95, Negative cache size: 60, Negative conditional cache size: 21, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 60 PlacesBefore, 57 PlacesAfterwards, 59 TransitionsBefore, 58 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 186, independent conditional: 186, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 244, independent: 186, independent conditional: 150, independent unconditional: 36, dependent: 58, dependent conditional: 34, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 260, independent: 186, independent conditional: 102, independent unconditional: 84, dependent: 74, dependent conditional: 50, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 260, independent: 186, independent conditional: 102, independent unconditional: 84, dependent: 74, dependent conditional: 50, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 260, independent: 182, independent conditional: 100, independent unconditional: 82, dependent: 72, dependent conditional: 48, dependent unconditional: 24, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 122, Positive conditional cache size: 13, Positive unconditional cache size: 109, Negative cache size: 62, Negative conditional cache size: 23, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 55 PlacesBefore, 55 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 211, independent: 161, independent conditional: 161, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 211, independent: 161, independent conditional: 75, independent unconditional: 86, dependent: 50, dependent conditional: 30, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 271, independent: 161, independent conditional: 40, independent unconditional: 121, dependent: 110, dependent conditional: 90, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 271, independent: 161, independent conditional: 40, independent unconditional: 121, dependent: 110, dependent conditional: 90, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 271, independent: 158, independent conditional: 40, independent unconditional: 118, dependent: 104, dependent conditional: 84, dependent unconditional: 20, unknown: 9, unknown conditional: 6, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 129, Positive conditional cache size: 13, Positive unconditional cache size: 116, Negative cache size: 68, Negative conditional cache size: 29, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 55 PlacesBefore, 53 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 140, independent: 95, independent conditional: 95, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 140, independent: 95, independent conditional: 50, independent unconditional: 45, dependent: 45, dependent conditional: 27, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 167, independent: 95, independent conditional: 22, independent unconditional: 73, dependent: 72, dependent conditional: 54, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 167, independent: 95, independent conditional: 22, independent unconditional: 73, dependent: 72, dependent conditional: 54, dependent unconditional: 18, 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: 167, independent: 95, independent conditional: 22, independent unconditional: 73, dependent: 72, dependent conditional: 54, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 131, Positive conditional cache size: 13, Positive unconditional cache size: 118, Negative cache size: 68, Negative conditional cache size: 29, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 1 - 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-05 23:08:45,590 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...