/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/mix028_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:57:52,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:57:52,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:57:52,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:57:52,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:57:52,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:57:52,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:57:52,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:57:52,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:57:52,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:57:52,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:57:52,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:57:52,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:57:52,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:57:52,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:57:52,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:57:52,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:57:52,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:57:52,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:57:52,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:57:52,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:57:52,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:57:52,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:57:52,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:57:52,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:57:52,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:57:52,909 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:57:52,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:57:52,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:57:52,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:57:52,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:57:52,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:57:52,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:57:52,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:57:52,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:57:52,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:57:52,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:57:52,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:57:52,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:57:52,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:57:52,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:57:52,917 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 22:57:52,943 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:57:52,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:57:52,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:57:52,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:57:52,945 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:57:52,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:57:52,946 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:57:52,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:57:52,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:57:52,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:57:52,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:57:52,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:57:52,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:57:52,948 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:57:52,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:57:52,948 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:57:52,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:57:52,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:57:52,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:57:52,949 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:57:52,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:57:52,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:57:52,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:57:52,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:57:52,949 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:57:52,949 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:57:52,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:57:52,950 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:57:52,950 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 22:57:53,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:57:53,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:57:53,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:57:53,244 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:57:53,245 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:57:53,246 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2022-12-05 22:57:54,362 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:57:54,704 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:57:54,704 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2022-12-05 22:57:54,718 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e738a728/bbec2d90bda445b7aa6f13abf31fceac/FLAG2daaf68d1 [2022-12-05 22:57:54,728 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e738a728/bbec2d90bda445b7aa6f13abf31fceac [2022-12-05 22:57:54,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:57:54,732 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:57:54,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:57:54,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:57:54,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:57:54,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:57:54" (1/1) ... [2022-12-05 22:57:54,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223a2413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:54, skipping insertion in model container [2022-12-05 22:57:54,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:57:54" (1/1) ... [2022-12-05 22:57:54,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:57:54,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:57:54,965 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/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-05 22:57:55,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:57:55,207 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:57:55,220 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/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-05 22:57:55,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:57:55,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:57:55,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:57:55,325 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:57:55,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:55 WrapperNode [2022-12-05 22:57:55,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:57:55,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:57:55,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:57:55,327 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:57:55,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:55" (1/1) ... [2022-12-05 22:57:55,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:55" (1/1) ... [2022-12-05 22:57:55,395 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-05 22:57:55,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:57:55,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:57:55,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:57:55,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:57:55,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:55" (1/1) ... [2022-12-05 22:57:55,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:55" (1/1) ... [2022-12-05 22:57:55,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:55" (1/1) ... [2022-12-05 22:57:55,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:55" (1/1) ... [2022-12-05 22:57:55,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:55" (1/1) ... [2022-12-05 22:57:55,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:55" (1/1) ... [2022-12-05 22:57:55,431 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:55" (1/1) ... [2022-12-05 22:57:55,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:55" (1/1) ... [2022-12-05 22:57:55,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:57:55,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:57:55,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:57:55,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:57:55,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:55" (1/1) ... [2022-12-05 22:57:55,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:57:55,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:57:55,484 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 22:57:55,511 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 22:57:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:57:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:57:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:57:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:57:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:57:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 22:57:55,529 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 22:57:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 22:57:55,530 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 22:57:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 22:57:55,530 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 22:57:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:57:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:57:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:57:55,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:57:55,532 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 22:57:55,707 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:57:55,709 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:57:56,120 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:57:56,287 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:57:56,292 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 22:57:56,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:57:56 BoogieIcfgContainer [2022-12-05 22:57:56,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:57:56,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:57:56,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:57:56,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:57:56,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:57:54" (1/3) ... [2022-12-05 22:57:56,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdddc06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:57:56, skipping insertion in model container [2022-12-05 22:57:56,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:57:55" (2/3) ... [2022-12-05 22:57:56,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdddc06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:57:56, skipping insertion in model container [2022-12-05 22:57:56,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:57:56" (3/3) ... [2022-12-05 22:57:56,304 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_power.opt_pso.opt_rmo.opt.i [2022-12-05 22:57:56,317 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:57:56,317 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 22:57:56,317 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:57:56,361 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:57:56,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 233 flow [2022-12-05 22:57:56,452 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-05 22:57:56,452 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:57:56,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-05 22:57:56,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 233 flow [2022-12-05 22:57:56,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2022-12-05 22:57:56,461 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:57:56,481 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-05 22:57:56,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 221 flow [2022-12-05 22:57:56,526 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-05 22:57:56,526 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:57:56,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-05 22:57:56,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-05 22:57:56,532 INFO L188 LiptonReduction]: Number of co-enabled transitions 1994 [2022-12-05 22:58:01,054 INFO L203 LiptonReduction]: Total number of compositions: 82 [2022-12-05 22:58:01,068 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:58:01,074 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;@2fa51ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:58:01,074 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 22:58:01,077 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-05 22:58:01,078 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:58:01,078 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:58:01,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 22:58:01,079 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:58:01,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:58:01,084 INFO L85 PathProgramCache]: Analyzing trace with hash 448585874, now seen corresponding path program 1 times [2022-12-05 22:58:01,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:58:01,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569553355] [2022-12-05 22:58:01,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:58:01,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:58:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:58:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:58:01,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:58:01,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569553355] [2022-12-05 22:58:01,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569553355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:58:01,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:58:01,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:58:01,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508166581] [2022-12-05 22:58:01,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:58:01,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:58:01,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:58:01,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:58:01,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:58:01,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-05 22:58:01,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:01,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:58:01,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-05 22:58:01,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:58:01,756 INFO L130 PetriNetUnfolder]: 1023/1606 cut-off events. [2022-12-05 22:58:01,757 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 22:58:01,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3181 conditions, 1606 events. 1023/1606 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8001 event pairs, 280 based on Foata normal form. 0/1441 useless extension candidates. Maximal degree in co-relation 3170. Up to 1228 conditions per place. [2022-12-05 22:58:01,768 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 29 selfloop transitions, 2 changer transitions 6/41 dead transitions. [2022-12-05 22:58:01,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 168 flow [2022-12-05 22:58:01,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:58:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:58:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-05 22:58:01,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-05 22:58:01,780 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 54 transitions. [2022-12-05 22:58:01,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 168 flow [2022-12-05 22:58:01,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 22:58:01,785 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 56 flow [2022-12-05 22:58:01,786 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2022-12-05 22:58:01,789 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-05 22:58:01,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:58:01,790 INFO L89 Accepts]: Start accepts. Operand has 35 places, 23 transitions, 56 flow [2022-12-05 22:58:01,793 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:58:01,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:58:01,793 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 23 transitions, 56 flow [2022-12-05 22:58:01,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 56 flow [2022-12-05 22:58:01,799 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-05 22:58:01,799 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:58:01,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 22:58:01,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 56 flow [2022-12-05 22:58:01,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-05 22:58:02,140 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:58:02,144 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 354 [2022-12-05 22:58:02,144 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2022-12-05 22:58:02,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:02,144 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:58:02,144 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:58:02,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:58:02,149 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:58:02,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:58:02,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1106249742, now seen corresponding path program 1 times [2022-12-05 22:58:02,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:58:02,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635693827] [2022-12-05 22:58:02,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:58:02,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:58:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:58:02,615 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 22:58:02,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:58:02,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635693827] [2022-12-05 22:58:02,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635693827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:58:02,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:58:02,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:58:02,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91273377] [2022-12-05 22:58:02,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:58:02,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:58:02,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:58:02,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:58:02,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:58:02,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-05 22:58:02,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:02,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:58:02,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-05 22:58:02,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:58:02,942 INFO L130 PetriNetUnfolder]: 1433/2124 cut-off events. [2022-12-05 22:58:02,942 INFO L131 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2022-12-05 22:58:02,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4434 conditions, 2124 events. 1433/2124 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8791 event pairs, 429 based on Foata normal form. 70/2194 useless extension candidates. Maximal degree in co-relation 4424. Up to 1392 conditions per place. [2022-12-05 22:58:02,953 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 34 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2022-12-05 22:58:02,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 42 transitions, 180 flow [2022-12-05 22:58:02,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:58:02,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:58:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-05 22:58:02,956 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 22:58:02,956 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 4 states and 44 transitions. [2022-12-05 22:58:02,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 42 transitions, 180 flow [2022-12-05 22:58:02,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:58:02,958 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 110 flow [2022-12-05 22:58:02,958 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2022-12-05 22:58:02,958 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-05 22:58:02,958 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:58:02,959 INFO L89 Accepts]: Start accepts. Operand has 35 places, 28 transitions, 110 flow [2022-12-05 22:58:02,959 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:58:02,959 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:58:02,959 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 28 transitions, 110 flow [2022-12-05 22:58:02,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 28 transitions, 110 flow [2022-12-05 22:58:02,986 INFO L130 PetriNetUnfolder]: 122/232 cut-off events. [2022-12-05 22:58:02,987 INFO L131 PetriNetUnfolder]: For 35/40 co-relation queries the response was YES. [2022-12-05 22:58:02,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 232 events. 122/232 cut-off events. For 35/40 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1036 event pairs, 60 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 520. Up to 179 conditions per place. [2022-12-05 22:58:02,989 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 28 transitions, 110 flow [2022-12-05 22:58:02,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-05 22:58:03,027 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [335] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [435] L832-->L839: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_134 256) 0))) (.cse2 (not (= 0 (mod v_~x$w_buff0_used~0_278 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_135 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_279 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_245 256) 0))))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_245) v_~x$w_buff1_used~0_244) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| 0)) (= v_~x$r_buff0_thd0~0_134 (ite .cse1 0 v_~x$r_buff0_thd0~0_135)) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_134 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_244 256) 0)))) 0 v_~x$r_buff1_thd0~0_134) v_~x$r_buff1_thd0~0_133) (= v_~x$w_buff0_used~0_278 (ite .cse4 0 v_~x$w_buff0_used~0_279)) (= (ite .cse4 v_~x$w_buff0~0_155 (ite .cse0 v_~x$w_buff1~0_127 v_~x~0_205)) v_~x~0_204)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_135, ~x$w_buff1~0=v_~x$w_buff1~0_127, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_245, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_134, ~x~0=v_~x~0_205, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_279, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_25|, ~x$w_buff1~0=v_~x$w_buff1~0_127, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_244, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_133, ~x~0=v_~x~0_204, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_278, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-05 22:58:03,114 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [335] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [343] L796-->L799: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] [2022-12-05 22:58:03,123 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [335] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [328] L747-->L754: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_115 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_101 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= v_~x$r_buff0_thd1~0_19 (ite .cse1 0 v_~x$r_buff0_thd1~0_20)) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_101) v_~x$w_buff1_used~0_100) (= v_~x~0_77 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse2 v_~x$w_buff1~0_42 v_~x~0_78))) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_100 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_19 256) 0)))) 0 v_~x$r_buff1_thd1~0_18) v_~x$r_buff1_thd1~0_17)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~x~0=v_~x~0_78, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_17, ~x~0=v_~x~0_77, ~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 22:58:03,220 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [335] L773-->L776: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [344] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_79 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_78 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_18)) (= v_~x$w_buff1_used~0_78 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_79)) (= v_~x~0_59 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse4 v_~x$w_buff1~0_34 v_~x~0_60)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_34, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_34, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-05 22:58:03,369 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:58:03,370 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 412 [2022-12-05 22:58:03,370 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 112 flow [2022-12-05 22:58:03,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:03,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:58:03,371 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:58:03,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 22:58:03,371 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:58:03,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:58:03,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2036321072, now seen corresponding path program 1 times [2022-12-05 22:58:03,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:58:03,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286145733] [2022-12-05 22:58:03,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:58:03,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:58:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:58:03,788 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 22:58:03,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:58:03,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286145733] [2022-12-05 22:58:03,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286145733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:58:03,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:58:03,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:58:03,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516930284] [2022-12-05 22:58:03,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:58:03,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:58:03,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:58:03,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:58:03,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:58:03,790 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-05 22:58:03,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:03,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:58:03,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-05 22:58:03,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:58:04,056 INFO L130 PetriNetUnfolder]: 1121/1684 cut-off events. [2022-12-05 22:58:04,056 INFO L131 PetriNetUnfolder]: For 945/1143 co-relation queries the response was YES. [2022-12-05 22:58:04,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4544 conditions, 1684 events. 1121/1684 cut-off events. For 945/1143 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7611 event pairs, 363 based on Foata normal form. 32/1660 useless extension candidates. Maximal degree in co-relation 4531. Up to 1502 conditions per place. [2022-12-05 22:58:04,067 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 33 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2022-12-05 22:58:04,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 216 flow [2022-12-05 22:58:04,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:58:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:58:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-05 22:58:04,069 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5679012345679012 [2022-12-05 22:58:04,069 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 112 flow. Second operand 3 states and 46 transitions. [2022-12-05 22:58:04,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 216 flow [2022-12-05 22:58:04,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:58:04,071 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 129 flow [2022-12-05 22:58:04,072 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2022-12-05 22:58:04,072 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2022-12-05 22:58:04,072 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:58:04,072 INFO L89 Accepts]: Start accepts. Operand has 36 places, 29 transitions, 129 flow [2022-12-05 22:58:04,073 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:58:04,073 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:58:04,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 129 flow [2022-12-05 22:58:04,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 129 flow [2022-12-05 22:58:04,111 INFO L130 PetriNetUnfolder]: 178/322 cut-off events. [2022-12-05 22:58:04,111 INFO L131 PetriNetUnfolder]: For 218/234 co-relation queries the response was YES. [2022-12-05 22:58:04,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 322 events. 178/322 cut-off events. For 218/234 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1500 event pairs, 85 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 776. Up to 247 conditions per place. [2022-12-05 22:58:04,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 129 flow [2022-12-05 22:58:04,114 INFO L188 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-05 22:58:04,118 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:58:04,119 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-05 22:58:04,119 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 129 flow [2022-12-05 22:58:04,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:04,119 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:58:04,119 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:58:04,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 22:58:04,119 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:58:04,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:58:04,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1298527393, now seen corresponding path program 1 times [2022-12-05 22:58:04,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:58:04,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439319500] [2022-12-05 22:58:04,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:58:04,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:58:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:58:04,541 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 22:58:04,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:58:04,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439319500] [2022-12-05 22:58:04,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439319500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:58:04,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:58:04,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:58:04,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57252167] [2022-12-05 22:58:04,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:58:04,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:58:04,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:58:04,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:58:04,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:58:04,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-05 22:58:04,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:04,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:58:04,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-05 22:58:04,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:58:04,887 INFO L130 PetriNetUnfolder]: 1129/1700 cut-off events. [2022-12-05 22:58:04,888 INFO L131 PetriNetUnfolder]: For 1314/1530 co-relation queries the response was YES. [2022-12-05 22:58:04,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4890 conditions, 1700 events. 1129/1700 cut-off events. For 1314/1530 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7636 event pairs, 327 based on Foata normal form. 53/1707 useless extension candidates. Maximal degree in co-relation 4875. Up to 1419 conditions per place. [2022-12-05 22:58:04,897 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 42 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2022-12-05 22:58:04,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 317 flow [2022-12-05 22:58:04,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:58:04,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:58:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-05 22:58:04,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-05 22:58:04,903 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 129 flow. Second operand 4 states and 63 transitions. [2022-12-05 22:58:04,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 317 flow [2022-12-05 22:58:04,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:58:04,907 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 186 flow [2022-12-05 22:58:04,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2022-12-05 22:58:04,909 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2022-12-05 22:58:04,909 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:58:04,909 INFO L89 Accepts]: Start accepts. Operand has 39 places, 34 transitions, 186 flow [2022-12-05 22:58:04,910 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:58:04,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:58:04,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 186 flow [2022-12-05 22:58:04,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 186 flow [2022-12-05 22:58:04,958 INFO L130 PetriNetUnfolder]: 191/344 cut-off events. [2022-12-05 22:58:04,958 INFO L131 PetriNetUnfolder]: For 403/442 co-relation queries the response was YES. [2022-12-05 22:58:04,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 344 events. 191/344 cut-off events. For 403/442 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1612 event pairs, 78 based on Foata normal form. 3/322 useless extension candidates. Maximal degree in co-relation 994. Up to 254 conditions per place. [2022-12-05 22:58:04,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 34 transitions, 186 flow [2022-12-05 22:58:04,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-05 22:58:05,337 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:58:05,338 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 429 [2022-12-05 22:58:05,338 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 192 flow [2022-12-05 22:58:05,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:05,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:58:05,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:58:05,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 22:58:05,339 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:58:05,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:58:05,339 INFO L85 PathProgramCache]: Analyzing trace with hash 687315275, now seen corresponding path program 1 times [2022-12-05 22:58:05,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:58:05,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743799060] [2022-12-05 22:58:05,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:58:05,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:58:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:58:05,716 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 22:58:05,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:58:05,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743799060] [2022-12-05 22:58:05,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743799060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:58:05,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:58:05,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:58:05,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940777551] [2022-12-05 22:58:05,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:58:05,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:58:05,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:58:05,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:58:05,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:58:05,722 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 22:58:05,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 192 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 22:58:05,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:58:05,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 22:58:05,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:58:06,157 INFO L130 PetriNetUnfolder]: 1748/2593 cut-off events. [2022-12-05 22:58:06,157 INFO L131 PetriNetUnfolder]: For 2785/2785 co-relation queries the response was YES. [2022-12-05 22:58:06,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8192 conditions, 2593 events. 1748/2593 cut-off events. For 2785/2785 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 11764 event pairs, 497 based on Foata normal form. 28/2621 useless extension candidates. Maximal degree in co-relation 8175. Up to 1655 conditions per place. [2022-12-05 22:58:06,173 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 60 selfloop transitions, 18 changer transitions 0/78 dead transitions. [2022-12-05 22:58:06,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 78 transitions, 507 flow [2022-12-05 22:58:06,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:58:06,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:58:06,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-05 22:58:06,175 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5103448275862069 [2022-12-05 22:58:06,175 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 192 flow. Second operand 5 states and 74 transitions. [2022-12-05 22:58:06,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 78 transitions, 507 flow [2022-12-05 22:58:06,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 78 transitions, 490 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 22:58:06,179 INFO L231 Difference]: Finished difference. Result has 43 places, 46 transitions, 307 flow [2022-12-05 22:58:06,179 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=43, PETRI_TRANSITIONS=46} [2022-12-05 22:58:06,180 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-05 22:58:06,180 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:58:06,180 INFO L89 Accepts]: Start accepts. Operand has 43 places, 46 transitions, 307 flow [2022-12-05 22:58:06,181 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:58:06,181 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:58:06,181 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 46 transitions, 307 flow [2022-12-05 22:58:06,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 46 transitions, 307 flow [2022-12-05 22:58:06,254 INFO L130 PetriNetUnfolder]: 253/492 cut-off events. [2022-12-05 22:58:06,255 INFO L131 PetriNetUnfolder]: For 947/986 co-relation queries the response was YES. [2022-12-05 22:58:06,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1803 conditions, 492 events. 253/492 cut-off events. For 947/986 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2588 event pairs, 67 based on Foata normal form. 14/492 useless extension candidates. Maximal degree in co-relation 1787. Up to 340 conditions per place. [2022-12-05 22:58:06,259 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 46 transitions, 307 flow [2022-12-05 22:58:06,259 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-05 22:58:06,265 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:58:06,266 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-05 22:58:06,266 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 46 transitions, 307 flow [2022-12-05 22:58:06,266 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 22:58:06,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:58:06,267 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:58:06,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 22:58:06,267 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:58:06,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:58:06,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1373580532, now seen corresponding path program 1 times [2022-12-05 22:58:06,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:58:06,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314473393] [2022-12-05 22:58:06,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:58:06,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:58:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:58:06,408 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 22:58:06,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:58:06,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314473393] [2022-12-05 22:58:06,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314473393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:58:06,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:58:06,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:58:06,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640913432] [2022-12-05 22:58:06,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:58:06,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:58:06,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:58:06,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:58:06,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:58:06,410 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-05 22:58:06,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 46 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 22:58:06,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:58:06,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-05 22:58:06,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:58:06,789 INFO L130 PetriNetUnfolder]: 1857/2901 cut-off events. [2022-12-05 22:58:06,789 INFO L131 PetriNetUnfolder]: For 6710/6730 co-relation queries the response was YES. [2022-12-05 22:58:06,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10456 conditions, 2901 events. 1857/2901 cut-off events. For 6710/6730 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 14939 event pairs, 685 based on Foata normal form. 109/2972 useless extension candidates. Maximal degree in co-relation 10437. Up to 1381 conditions per place. [2022-12-05 22:58:06,806 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 42 selfloop transitions, 7 changer transitions 11/65 dead transitions. [2022-12-05 22:58:06,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 65 transitions, 518 flow [2022-12-05 22:58:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:58:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:58:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-05 22:58:06,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5402298850574713 [2022-12-05 22:58:06,808 INFO L175 Difference]: Start difference. First operand has 43 places, 46 transitions, 307 flow. Second operand 3 states and 47 transitions. [2022-12-05 22:58:06,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 65 transitions, 518 flow [2022-12-05 22:58:06,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 500 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-12-05 22:58:06,816 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 268 flow [2022-12-05 22:58:06,817 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2022-12-05 22:58:06,819 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2022-12-05 22:58:06,819 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:58:06,819 INFO L89 Accepts]: Start accepts. Operand has 46 places, 41 transitions, 268 flow [2022-12-05 22:58:06,820 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:58:06,820 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:58:06,820 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 41 transitions, 268 flow [2022-12-05 22:58:06,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 268 flow [2022-12-05 22:58:06,887 INFO L130 PetriNetUnfolder]: 274/550 cut-off events. [2022-12-05 22:58:06,888 INFO L131 PetriNetUnfolder]: For 1435/1485 co-relation queries the response was YES. [2022-12-05 22:58:06,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1986 conditions, 550 events. 274/550 cut-off events. For 1435/1485 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3033 event pairs, 92 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 1968. Up to 367 conditions per place. [2022-12-05 22:58:06,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 41 transitions, 268 flow [2022-12-05 22:58:06,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-05 22:58:06,898 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [454] L773-->L806: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd3~0_112 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_433 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_114 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_434 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_394 256) 0))))) (and (= v_~x$w_buff0_used~0_433 (ite .cse0 0 v_~x$w_buff0_used~0_434)) (= (ite .cse0 v_~x$w_buff0~0_256 (ite .cse1 v_~x$w_buff1~0_224 v_~x~0_358)) v_~x~0_357) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_114) v_~x$r_buff0_thd3~0_113) (= v_~y~0_93 1) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_113 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_393 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_112) v_~x$r_buff1_thd3~0_111) (= v_~x$w_buff1_used~0_393 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_394))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_256, ~x$w_buff1~0=v_~x$w_buff1~0_224, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_112, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_394, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_114, ~x~0=v_~x~0_358, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_434} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_256, ~x$w_buff1~0=v_~x$w_buff1~0_224, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_111, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_393, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_113, ~y~0=v_~y~0_93, ~x~0=v_~x~0_357, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_433} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~y~0, ~x~0, ~x$w_buff0_used~0] and [414] $Ultimate##0-->L793: Formula: (and (= v_~y~0_33 2) (= v_P2Thread1of1ForFork2_~arg.base_5 |v_P2Thread1of1ForFork2_#in~arg.base_5|) (= |v_P2Thread1of1ForFork2_#in~arg.offset_5| v_P2Thread1of1ForFork2_~arg.offset_5)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_5, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_5, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_33} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~y~0] [2022-12-05 22:58:07,003 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] L773-->L799: Formula: (and (= v_~y~0_89 1) (= v_~__unbuffered_p2_EBX~0_61 v_~z~0_31)) InVars {~z~0=v_~z~0_31} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ~z~0=v_~z~0_31, ~y~0=v_~y~0_89} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y~0] and [414] $Ultimate##0-->L793: Formula: (and (= v_~y~0_33 2) (= v_P2Thread1of1ForFork2_~arg.base_5 |v_P2Thread1of1ForFork2_#in~arg.base_5|) (= |v_P2Thread1of1ForFork2_#in~arg.offset_5| v_P2Thread1of1ForFork2_~arg.offset_5)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_5, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_5, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_33} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~y~0] [2022-12-05 22:58:07,030 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:58:07,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-05 22:58:07,031 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 278 flow [2022-12-05 22:58:07,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 22:58:07,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:58:07,031 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:58:07,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 22:58:07,031 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:58:07,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:58:07,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1804029175, now seen corresponding path program 2 times [2022-12-05 22:58:07,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:58:07,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093458949] [2022-12-05 22:58:07,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:58:07,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:58:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:58:07,405 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 22:58:07,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:58:07,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093458949] [2022-12-05 22:58:07,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093458949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:58:07,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:58:07,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:58:07,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448898780] [2022-12-05 22:58:07,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:58:07,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:58:07,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:58:07,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:58:07,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:58:07,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-05 22:58:07,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 22:58:07,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:58:07,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-05 22:58:07,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:58:07,792 INFO L130 PetriNetUnfolder]: 1389/2222 cut-off events. [2022-12-05 22:58:07,793 INFO L131 PetriNetUnfolder]: For 5003/5020 co-relation queries the response was YES. [2022-12-05 22:58:07,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8290 conditions, 2222 events. 1389/2222 cut-off events. For 5003/5020 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 11089 event pairs, 436 based on Foata normal form. 11/2222 useless extension candidates. Maximal degree in co-relation 8269. Up to 1781 conditions per place. [2022-12-05 22:58:07,806 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 52 selfloop transitions, 15 changer transitions 1/71 dead transitions. [2022-12-05 22:58:07,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 531 flow [2022-12-05 22:58:07,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:58:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:58:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-05 22:58:07,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5481481481481482 [2022-12-05 22:58:07,808 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 278 flow. Second operand 5 states and 74 transitions. [2022-12-05 22:58:07,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 531 flow [2022-12-05 22:58:07,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 526 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:58:07,814 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 311 flow [2022-12-05 22:58:07,814 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=311, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2022-12-05 22:58:07,815 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2022-12-05 22:58:07,815 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:58:07,815 INFO L89 Accepts]: Start accepts. Operand has 50 places, 43 transitions, 311 flow [2022-12-05 22:58:07,816 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:58:07,816 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:58:07,816 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 43 transitions, 311 flow [2022-12-05 22:58:07,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 43 transitions, 311 flow [2022-12-05 22:58:07,874 INFO L130 PetriNetUnfolder]: 238/511 cut-off events. [2022-12-05 22:58:07,875 INFO L131 PetriNetUnfolder]: For 1312/1357 co-relation queries the response was YES. [2022-12-05 22:58:07,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1961 conditions, 511 events. 238/511 cut-off events. For 1312/1357 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2923 event pairs, 111 based on Foata normal form. 1/481 useless extension candidates. Maximal degree in co-relation 1941. Up to 328 conditions per place. [2022-12-05 22:58:07,882 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 43 transitions, 311 flow [2022-12-05 22:58:07,882 INFO L188 LiptonReduction]: Number of co-enabled transitions 340 [2022-12-05 22:58:07,886 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:58:07,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-05 22:58:07,889 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 311 flow [2022-12-05 22:58:07,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 22:58:07,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:58:07,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:58:07,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 22:58:07,889 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:58:07,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:58:07,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1615701237, now seen corresponding path program 1 times [2022-12-05 22:58:07,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:58:07,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708066868] [2022-12-05 22:58:07,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:58:07,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:58:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:58:08,482 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 22:58:08,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:58:08,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708066868] [2022-12-05 22:58:08,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708066868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:58:08,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:58:08,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 22:58:08,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570670640] [2022-12-05 22:58:08,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:58:08,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:58:08,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:58:08,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:58:08,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:58:08,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 22:58:08,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 311 flow. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:08,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:58:08,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 22:58:08,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:58:09,028 INFO L130 PetriNetUnfolder]: 2152/3274 cut-off events. [2022-12-05 22:58:09,028 INFO L131 PetriNetUnfolder]: For 8016/8016 co-relation queries the response was YES. [2022-12-05 22:58:09,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12637 conditions, 3274 events. 2152/3274 cut-off events. For 8016/8016 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 15998 event pairs, 363 based on Foata normal form. 22/3296 useless extension candidates. Maximal degree in co-relation 12614. Up to 2307 conditions per place. [2022-12-05 22:58:09,055 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 58 selfloop transitions, 26 changer transitions 2/86 dead transitions. [2022-12-05 22:58:09,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 86 transitions, 698 flow [2022-12-05 22:58:09,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:58:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:58:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-05 22:58:09,058 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-05 22:58:09,058 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 311 flow. Second operand 5 states and 70 transitions. [2022-12-05 22:58:09,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 86 transitions, 698 flow [2022-12-05 22:58:09,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 86 transitions, 682 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 22:58:09,067 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 493 flow [2022-12-05 22:58:09,067 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=493, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2022-12-05 22:58:09,068 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2022-12-05 22:58:09,069 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:58:09,069 INFO L89 Accepts]: Start accepts. Operand has 55 places, 54 transitions, 493 flow [2022-12-05 22:58:09,070 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:58:09,071 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:58:09,071 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 54 transitions, 493 flow [2022-12-05 22:58:09,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 493 flow [2022-12-05 22:58:09,174 INFO L130 PetriNetUnfolder]: 356/715 cut-off events. [2022-12-05 22:58:09,174 INFO L131 PetriNetUnfolder]: For 2463/2524 co-relation queries the response was YES. [2022-12-05 22:58:09,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3404 conditions, 715 events. 356/715 cut-off events. For 2463/2524 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4098 event pairs, 50 based on Foata normal form. 4/710 useless extension candidates. Maximal degree in co-relation 3380. Up to 476 conditions per place. [2022-12-05 22:58:09,182 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 54 transitions, 493 flow [2022-12-05 22:58:09,182 INFO L188 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-05 22:58:09,193 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:58:09,195 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-05 22:58:09,195 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 493 flow [2022-12-05 22:58:09,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:09,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:58:09,196 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:58:09,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 22:58:09,196 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:58:09,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:58:09,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1582159454, now seen corresponding path program 1 times [2022-12-05 22:58:09,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:58:09,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566996880] [2022-12-05 22:58:09,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:58:09,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:58:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:58:09,639 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 22:58:09,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:58:09,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566996880] [2022-12-05 22:58:09,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566996880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:58:09,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:58:09,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:58:09,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042092413] [2022-12-05 22:58:09,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:58:09,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:58:09,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:58:09,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:58:09,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:58:09,641 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-05 22:58:09,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 493 flow. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:09,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:58:09,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-05 22:58:09,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:58:10,162 INFO L130 PetriNetUnfolder]: 1870/3001 cut-off events. [2022-12-05 22:58:10,163 INFO L131 PetriNetUnfolder]: For 12735/12773 co-relation queries the response was YES. [2022-12-05 22:58:10,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13887 conditions, 3001 events. 1870/3001 cut-off events. For 12735/12773 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16151 event pairs, 376 based on Foata normal form. 47/2992 useless extension candidates. Maximal degree in co-relation 13860. Up to 2023 conditions per place. [2022-12-05 22:58:10,180 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 57 selfloop transitions, 23 changer transitions 4/90 dead transitions. [2022-12-05 22:58:10,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 90 transitions, 901 flow [2022-12-05 22:58:10,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:58:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:58:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-05 22:58:10,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2022-12-05 22:58:10,182 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 493 flow. Second operand 5 states and 73 transitions. [2022-12-05 22:58:10,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 90 transitions, 901 flow [2022-12-05 22:58:10,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 90 transitions, 824 flow, removed 29 selfloop flow, removed 2 redundant places. [2022-12-05 22:58:10,197 INFO L231 Difference]: Finished difference. Result has 58 places, 60 transitions, 574 flow [2022-12-05 22:58:10,198 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=574, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2022-12-05 22:58:10,198 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2022-12-05 22:58:10,198 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:58:10,198 INFO L89 Accepts]: Start accepts. Operand has 58 places, 60 transitions, 574 flow [2022-12-05 22:58:10,199 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:58:10,199 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:58:10,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 60 transitions, 574 flow [2022-12-05 22:58:10,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 574 flow [2022-12-05 22:58:10,268 INFO L130 PetriNetUnfolder]: 343/685 cut-off events. [2022-12-05 22:58:10,269 INFO L131 PetriNetUnfolder]: For 2589/2627 co-relation queries the response was YES. [2022-12-05 22:58:10,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3421 conditions, 685 events. 343/685 cut-off events. For 2589/2627 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3925 event pairs, 68 based on Foata normal form. 4/680 useless extension candidates. Maximal degree in co-relation 3395. Up to 477 conditions per place. [2022-12-05 22:58:10,277 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 60 transitions, 574 flow [2022-12-05 22:58:10,277 INFO L188 LiptonReduction]: Number of co-enabled transitions 406 [2022-12-05 22:58:10,281 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:58:10,282 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-05 22:58:10,282 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 574 flow [2022-12-05 22:58:10,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:10,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:58:10,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:58:10,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 22:58:10,283 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:58:10,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:58:10,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1235992100, now seen corresponding path program 1 times [2022-12-05 22:58:10,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:58:10,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076368815] [2022-12-05 22:58:10,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:58:10,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:58:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:58:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:58:10,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:58:10,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076368815] [2022-12-05 22:58:10,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076368815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:58:10,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:58:10,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:58:10,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694899716] [2022-12-05 22:58:10,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:58:10,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:58:10,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:58:10,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:58:10,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:58:10,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2022-12-05 22:58:10,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 574 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 22:58:10,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:58:10,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2022-12-05 22:58:10,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:58:10,841 INFO L130 PetriNetUnfolder]: 1295/2259 cut-off events. [2022-12-05 22:58:10,841 INFO L131 PetriNetUnfolder]: For 14906/15142 co-relation queries the response was YES. [2022-12-05 22:58:10,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10574 conditions, 2259 events. 1295/2259 cut-off events. For 14906/15142 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 13643 event pairs, 217 based on Foata normal form. 427/2632 useless extension candidates. Maximal degree in co-relation 10545. Up to 1190 conditions per place. [2022-12-05 22:58:10,854 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 101 selfloop transitions, 7 changer transitions 31/150 dead transitions. [2022-12-05 22:58:10,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 150 transitions, 1729 flow [2022-12-05 22:58:10,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:58:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:58:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-12-05 22:58:10,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-05 22:58:10,856 INFO L175 Difference]: Start difference. First operand has 58 places, 60 transitions, 574 flow. Second operand 5 states and 80 transitions. [2022-12-05 22:58:10,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 150 transitions, 1729 flow [2022-12-05 22:58:10,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 150 transitions, 1639 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-05 22:58:10,867 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 586 flow [2022-12-05 22:58:10,867 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=586, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2022-12-05 22:58:10,868 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 24 predicate places. [2022-12-05 22:58:10,868 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:58:10,868 INFO L89 Accepts]: Start accepts. Operand has 62 places, 64 transitions, 586 flow [2022-12-05 22:58:10,869 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:58:10,869 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:58:10,869 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 64 transitions, 586 flow [2022-12-05 22:58:10,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 64 transitions, 586 flow [2022-12-05 22:58:10,966 INFO L130 PetriNetUnfolder]: 434/938 cut-off events. [2022-12-05 22:58:10,967 INFO L131 PetriNetUnfolder]: For 4676/4934 co-relation queries the response was YES. [2022-12-05 22:58:10,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4372 conditions, 938 events. 434/938 cut-off events. For 4676/4934 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6307 event pairs, 129 based on Foata normal form. 93/977 useless extension candidates. Maximal degree in co-relation 4343. Up to 465 conditions per place. [2022-12-05 22:58:10,979 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 64 transitions, 586 flow [2022-12-05 22:58:10,979 INFO L188 LiptonReduction]: Number of co-enabled transitions 540 [2022-12-05 22:58:11,682 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [424] L828-3-->L832: Formula: (and (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_63) 1 0) 0) 0 1) v_~main$tmp_guard0~0_24) (= (mod v_~main$tmp_guard0~0_24 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [427] L783-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res#1.offset_13| 0) (= |v_P1Thread1of1ForFork1_#res#1.base_13| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_13|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res#1.offset] [2022-12-05 22:58:11,714 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [424] L828-3-->L832: Formula: (and (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_63) 1 0) 0) 0 1) v_~main$tmp_guard0~0_24) (= (mod v_~main$tmp_guard0~0_24 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [447] L754-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_97 (+ v_~__unbuffered_cnt~0_98 1)) (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= |v_P0Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-05 22:58:11,746 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:58:11,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 879 [2022-12-05 22:58:11,747 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 588 flow [2022-12-05 22:58:11,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 22:58:11,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:58:11,748 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:58:11,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 22:58:11,748 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:58:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:58:11,748 INFO L85 PathProgramCache]: Analyzing trace with hash -242099031, now seen corresponding path program 1 times [2022-12-05 22:58:11,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:58:11,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626254842] [2022-12-05 22:58:11,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:58:11,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:58:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:58:11,888 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 22:58:11,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:58:11,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626254842] [2022-12-05 22:58:11,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626254842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:58:11,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:58:11,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:58:11,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001370006] [2022-12-05 22:58:11,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:58:11,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:58:11,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:58:11,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:58:11,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:58:11,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-05 22:58:11,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 588 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 22:58:11,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:58:11,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-05 22:58:11,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:58:12,178 INFO L130 PetriNetUnfolder]: 708/1359 cut-off events. [2022-12-05 22:58:12,179 INFO L131 PetriNetUnfolder]: For 9372/9544 co-relation queries the response was YES. [2022-12-05 22:58:12,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6954 conditions, 1359 events. 708/1359 cut-off events. For 9372/9544 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7971 event pairs, 73 based on Foata normal form. 202/1526 useless extension candidates. Maximal degree in co-relation 6922. Up to 544 conditions per place. [2022-12-05 22:58:12,187 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 81 selfloop transitions, 12 changer transitions 37/141 dead transitions. [2022-12-05 22:58:12,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 141 transitions, 1561 flow [2022-12-05 22:58:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:58:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:58:12,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2022-12-05 22:58:12,188 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6217948717948718 [2022-12-05 22:58:12,188 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 588 flow. Second operand 6 states and 97 transitions. [2022-12-05 22:58:12,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 141 transitions, 1561 flow [2022-12-05 22:58:12,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 141 transitions, 1545 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-05 22:58:12,197 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 591 flow [2022-12-05 22:58:12,198 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=591, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2022-12-05 22:58:12,198 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 30 predicate places. [2022-12-05 22:58:12,198 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:58:12,198 INFO L89 Accepts]: Start accepts. Operand has 68 places, 63 transitions, 591 flow [2022-12-05 22:58:12,199 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:58:12,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:58:12,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 63 transitions, 591 flow [2022-12-05 22:58:12,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 63 transitions, 591 flow [2022-12-05 22:58:12,252 INFO L130 PetriNetUnfolder]: 168/522 cut-off events. [2022-12-05 22:58:12,252 INFO L131 PetriNetUnfolder]: For 3139/3436 co-relation queries the response was YES. [2022-12-05 22:58:12,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2578 conditions, 522 events. 168/522 cut-off events. For 3139/3436 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3561 event pairs, 20 based on Foata normal form. 44/551 useless extension candidates. Maximal degree in co-relation 2545. Up to 262 conditions per place. [2022-12-05 22:58:12,259 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 63 transitions, 591 flow [2022-12-05 22:58:12,259 INFO L188 LiptonReduction]: Number of co-enabled transitions 466 [2022-12-05 22:58:12,320 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:58:12,321 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-05 22:58:12,321 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 562 flow [2022-12-05 22:58:12,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 22:58:12,321 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:58:12,321 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:58:12,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 22:58:12,321 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:58:12,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:58:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash -202249994, now seen corresponding path program 1 times [2022-12-05 22:58:12,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:58:12,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936285139] [2022-12-05 22:58:12,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:58:12,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:58:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:58:12,488 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 22:58:12,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:58:12,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936285139] [2022-12-05 22:58:12,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936285139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:58:12,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:58:12,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 22:58:12,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711873295] [2022-12-05 22:58:12,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:58:12,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:58:12,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:58:12,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:58:12,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:58:12,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2022-12-05 22:58:12,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 562 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:12,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:58:12,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2022-12-05 22:58:12,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:58:12,686 INFO L130 PetriNetUnfolder]: 416/840 cut-off events. [2022-12-05 22:58:12,686 INFO L131 PetriNetUnfolder]: For 5775/5832 co-relation queries the response was YES. [2022-12-05 22:58:12,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4462 conditions, 840 events. 416/840 cut-off events. For 5775/5832 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4570 event pairs, 62 based on Foata normal form. 60/891 useless extension candidates. Maximal degree in co-relation 4426. Up to 344 conditions per place. [2022-12-05 22:58:12,692 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 61 selfloop transitions, 13 changer transitions 33/116 dead transitions. [2022-12-05 22:58:12,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 116 transitions, 1304 flow [2022-12-05 22:58:12,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 22:58:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 22:58:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2022-12-05 22:58:12,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2022-12-05 22:58:12,694 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 562 flow. Second operand 8 states and 97 transitions. [2022-12-05 22:58:12,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 116 transitions, 1304 flow [2022-12-05 22:58:12,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 116 transitions, 1221 flow, removed 29 selfloop flow, removed 4 redundant places. [2022-12-05 22:58:12,707 INFO L231 Difference]: Finished difference. Result has 74 places, 52 transitions, 455 flow [2022-12-05 22:58:12,708 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=455, PETRI_PLACES=74, PETRI_TRANSITIONS=52} [2022-12-05 22:58:12,708 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2022-12-05 22:58:12,708 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:58:12,708 INFO L89 Accepts]: Start accepts. Operand has 74 places, 52 transitions, 455 flow [2022-12-05 22:58:12,710 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:58:12,710 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:58:12,710 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 52 transitions, 455 flow [2022-12-05 22:58:12,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 52 transitions, 455 flow [2022-12-05 22:58:12,737 INFO L130 PetriNetUnfolder]: 88/274 cut-off events. [2022-12-05 22:58:12,738 INFO L131 PetriNetUnfolder]: For 1426/1468 co-relation queries the response was YES. [2022-12-05 22:58:12,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 274 events. 88/274 cut-off events. For 1426/1468 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1484 event pairs, 6 based on Foata normal form. 25/298 useless extension candidates. Maximal degree in co-relation 1204. Up to 135 conditions per place. [2022-12-05 22:58:12,741 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 52 transitions, 455 flow [2022-12-05 22:58:12,741 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-05 22:58:12,871 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [327] L744-->L747: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [375] $Ultimate##0-->L773: Formula: (and (= v_~x$r_buff1_thd0~0_77 v_~x$r_buff0_thd0~0_81) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff1_thd1~0_41 v_~x$r_buff0_thd1~0_41) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~x$r_buff0_thd2~0_48 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_179 256) 0)) (not (= (mod v_~x$w_buff1_used~0_154 256) 0)))) 1 0)) (= v_~x$w_buff0_used~0_180 v_~x$w_buff1_used~0_154) (= v_~x$w_buff0_used~0_179 1) (= v_~x$r_buff1_thd2~0_35 v_~x$r_buff0_thd2~0_49) (= v_~x$w_buff0~0_96 v_~x$w_buff1~0_82) (= v_~x$r_buff1_thd3~0_39 v_~x$r_buff0_thd3~0_41) (= 2 v_~x$w_buff0~0_95)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_96, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_81, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_41, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_81, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_82, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_39, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_35, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_41, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_41, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_48, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_179, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] [2022-12-05 22:58:12,968 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [461] L828-3-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.offset_19|) (= |v_P0Thread1of1ForFork0_#res.base_19| 0) (= (ite (= (ite (= v_~__unbuffered_cnt~0_154 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_54) (= v_~__unbuffered_cnt~0_153 (+ v_~__unbuffered_cnt~0_154 1)) (= (mod v_~main$tmp_guard0~0_54 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_154} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_19|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_49|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_61|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ULTIMATE.start_main_#t~nondet8#1, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [427] L783-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res#1.offset_13| 0) (= |v_P1Thread1of1ForFork1_#res#1.base_13| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_13|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res#1.offset] [2022-12-05 23:04:35,179 WARN L233 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 1124 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-05 23:08:14,579 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 23:08:14,580 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 601872 [2022-12-05 23:08:14,580 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 425 flow [2022-12-05 23:08:14,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:14,580 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:14,580 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:14,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:08:14,580 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:08:14,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:14,581 INFO L85 PathProgramCache]: Analyzing trace with hash 870123860, now seen corresponding path program 1 times [2022-12-05 23:08:14,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:14,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158107416] [2022-12-05 23:08:14,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:14,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:14,738 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:14,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:14,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158107416] [2022-12-05 23:08:14,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158107416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:14,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:14,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:08:14,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216631775] [2022-12-05 23:08:14,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:14,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:08:14,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:14,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:08:14,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:08:14,740 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-05 23:08:14,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 425 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:14,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:14,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-05 23:08:14,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:14,875 INFO L130 PetriNetUnfolder]: 392/771 cut-off events. [2022-12-05 23:08:14,875 INFO L131 PetriNetUnfolder]: For 3485/3496 co-relation queries the response was YES. [2022-12-05 23:08:14,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3953 conditions, 771 events. 392/771 cut-off events. For 3485/3496 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3998 event pairs, 48 based on Foata normal form. 1/762 useless extension candidates. Maximal degree in co-relation 3916. Up to 408 conditions per place. [2022-12-05 23:08:14,879 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 37 selfloop transitions, 1 changer transitions 44/86 dead transitions. [2022-12-05 23:08:14,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 86 transitions, 942 flow [2022-12-05 23:08:14,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:08:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:08:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-05 23:08:14,880 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2022-12-05 23:08:14,880 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 425 flow. Second operand 4 states and 50 transitions. [2022-12-05 23:08:14,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 86 transitions, 942 flow [2022-12-05 23:08:14,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 818 flow, removed 32 selfloop flow, removed 12 redundant places. [2022-12-05 23:08:14,889 INFO L231 Difference]: Finished difference. Result has 58 places, 34 transitions, 253 flow [2022-12-05 23:08:14,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=58, PETRI_TRANSITIONS=34} [2022-12-05 23:08:14,889 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2022-12-05 23:08:14,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:14,890 INFO L89 Accepts]: Start accepts. Operand has 58 places, 34 transitions, 253 flow [2022-12-05 23:08:14,891 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:14,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:14,891 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 34 transitions, 253 flow [2022-12-05 23:08:14,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 34 transitions, 253 flow [2022-12-05 23:08:14,902 INFO L130 PetriNetUnfolder]: 31/96 cut-off events. [2022-12-05 23:08:14,902 INFO L131 PetriNetUnfolder]: For 314/325 co-relation queries the response was YES. [2022-12-05 23:08:14,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 96 events. 31/96 cut-off events. For 314/325 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 337 event pairs, 5 based on Foata normal form. 9/104 useless extension candidates. Maximal degree in co-relation 353. Up to 42 conditions per place. [2022-12-05 23:08:14,903 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 34 transitions, 253 flow [2022-12-05 23:08:14,903 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-05 23:08:15,374 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 23:08:15,375 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 485 [2022-12-05 23:08:15,375 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 32 transitions, 263 flow [2022-12-05 23:08:15,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:08:15,375 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:15,375 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:15,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:08:15,375 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:08:15,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:15,376 INFO L85 PathProgramCache]: Analyzing trace with hash -756720371, now seen corresponding path program 1 times [2022-12-05 23:08:15,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:15,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006110126] [2022-12-05 23:08:15,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:15,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:08:15,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:08:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:08:15,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:08:15,489 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:08:15,490 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 23:08:15,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 23:08:15,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 23:08:15,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 23:08:15,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 23:08:15,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 23:08:15,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 23:08:15,492 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:15,497 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:08:15,497 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:08:15,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:08:15 BasicIcfg [2022-12-05 23:08:15,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:08:15,578 INFO L158 Benchmark]: Toolchain (without parser) took 620846.88ms. Allocated memory was 182.5MB in the beginning and 1.1GB in the end (delta: 871.4MB). Free memory was 157.1MB in the beginning and 644.7MB in the end (delta: -487.6MB). Peak memory consumption was 385.3MB. Max. memory is 8.0GB. [2022-12-05 23:08:15,579 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:08:15,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 592.99ms. Allocated memory is still 182.5MB. Free memory was 156.7MB in the beginning and 130.1MB in the end (delta: 26.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 23:08:15,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.26ms. Allocated memory is still 182.5MB. Free memory was 130.1MB in the beginning and 127.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:08:15,583 INFO L158 Benchmark]: Boogie Preprocessor took 37.97ms. Allocated memory is still 182.5MB. Free memory was 127.4MB in the beginning and 125.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:08:15,583 INFO L158 Benchmark]: RCFGBuilder took 845.38ms. Allocated memory is still 182.5MB. Free memory was 125.7MB in the beginning and 134.3MB in the end (delta: -8.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-05 23:08:15,583 INFO L158 Benchmark]: TraceAbstraction took 619278.86ms. Allocated memory was 182.5MB in the beginning and 1.1GB in the end (delta: 871.4MB). Free memory was 133.8MB in the beginning and 644.7MB in the end (delta: -511.0MB). Peak memory consumption was 361.4MB. Max. memory is 8.0GB. [2022-12-05 23:08:15,586 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.12ms. Allocated memory is still 182.5MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 592.99ms. Allocated memory is still 182.5MB. Free memory was 156.7MB in the beginning and 130.1MB in the end (delta: 26.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.26ms. Allocated memory is still 182.5MB. Free memory was 130.1MB in the beginning and 127.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.97ms. Allocated memory is still 182.5MB. Free memory was 127.4MB in the beginning and 125.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 845.38ms. Allocated memory is still 182.5MB. Free memory was 125.7MB in the beginning and 134.3MB in the end (delta: -8.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 619278.86ms. Allocated memory was 182.5MB in the beginning and 1.1GB in the end (delta: 871.4MB). Free memory was 133.8MB in the beginning and 644.7MB in the end (delta: -511.0MB). Peak memory consumption was 361.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 114 PlacesBefore, 38 PlacesAfterwards, 106 TransitionsBefore, 29 TransitionsAfterwards, 1994 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 41 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1490, independent: 1433, independent conditional: 1433, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1490, independent: 1433, independent conditional: 0, independent unconditional: 1433, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1490, independent: 1433, independent conditional: 0, independent unconditional: 1433, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1490, independent: 1433, independent conditional: 0, independent unconditional: 1433, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1182, independent: 1148, independent conditional: 0, independent unconditional: 1148, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1182, independent: 1134, independent conditional: 0, independent unconditional: 1134, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 240, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 228, dependent conditional: 0, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1490, independent: 285, independent conditional: 0, independent unconditional: 285, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 1182, unknown conditional: 0, unknown unconditional: 1182] , Statistics on independence cache: Total cache size (in pairs): 1696, Positive cache size: 1662, Positive conditional cache size: 0, Positive unconditional cache size: 1662, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, 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.3s, 32 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 238, independent: 189, independent conditional: 189, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 238, independent: 189, independent conditional: 22, independent unconditional: 167, dependent: 49, dependent conditional: 6, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 238, independent: 189, independent conditional: 22, independent unconditional: 167, dependent: 49, dependent conditional: 6, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 238, independent: 189, independent conditional: 22, independent unconditional: 167, dependent: 49, dependent conditional: 6, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 126, independent: 102, independent conditional: 12, independent unconditional: 90, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 126, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 124, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 119, dependent conditional: 11, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 238, independent: 87, independent conditional: 10, independent unconditional: 77, dependent: 25, dependent conditional: 4, dependent unconditional: 21, unknown: 126, unknown conditional: 14, unknown unconditional: 112] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 103, Positive conditional cache size: 12, Positive unconditional cache size: 91, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 35 PlacesBefore, 34 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 206, independent: 181, independent conditional: 181, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 206, independent: 181, independent conditional: 10, independent unconditional: 171, dependent: 25, dependent conditional: 4, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 206, independent: 181, independent conditional: 7, independent unconditional: 174, dependent: 25, dependent conditional: 3, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 206, independent: 181, independent conditional: 7, independent unconditional: 174, dependent: 25, dependent conditional: 3, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 18, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 206, independent: 166, independent conditional: 7, independent unconditional: 159, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 18, unknown conditional: 2, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 133, Positive conditional cache size: 12, Positive unconditional cache size: 121, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 65, independent: 58, independent conditional: 10, independent unconditional: 48, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 58, independent conditional: 6, independent unconditional: 52, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, independent: 58, independent conditional: 6, independent unconditional: 52, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 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] ], Cache Queries: [ total: 65, independent: 58, independent conditional: 6, independent unconditional: 52, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 133, Positive conditional cache size: 12, Positive unconditional cache size: 121, Negative cache size: 28, Negative conditional cache size: 4, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 39 PlacesBefore, 39 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 186, independent: 170, independent conditional: 170, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 186, independent: 170, independent conditional: 58, independent unconditional: 112, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 188, independent: 170, independent conditional: 44, independent unconditional: 126, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 188, independent: 170, independent conditional: 44, independent unconditional: 126, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 188, independent: 164, independent conditional: 38, independent unconditional: 126, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 146, Positive conditional cache size: 18, Positive unconditional cache size: 128, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 198, independent: 184, independent conditional: 184, 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: 198, independent: 184, independent conditional: 68, independent unconditional: 116, 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: 198, independent: 184, independent conditional: 50, independent unconditional: 134, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198, independent: 184, independent conditional: 50, independent unconditional: 134, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 2, independent unconditional: 11, 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: 13, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ 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] ], Cache Queries: [ total: 198, independent: 171, independent conditional: 48, independent unconditional: 123, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 13, unknown conditional: 2, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 159, Positive conditional cache size: 20, Positive unconditional cache size: 139, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 46 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 243, independent: 225, independent conditional: 225, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 243, independent: 225, independent conditional: 98, independent unconditional: 127, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 243, independent: 225, independent conditional: 56, independent unconditional: 169, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 243, independent: 225, independent conditional: 56, independent unconditional: 169, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 243, independent: 219, independent conditional: 56, independent unconditional: 163, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 171, Positive conditional cache size: 20, Positive unconditional cache size: 151, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 125, independent: 116, independent conditional: 44, independent unconditional: 72, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125, independent: 116, independent conditional: 31, independent unconditional: 85, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125, independent: 116, independent conditional: 31, independent unconditional: 85, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 125, independent: 115, independent conditional: 31, independent unconditional: 84, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 172, Positive conditional cache size: 20, Positive unconditional cache size: 152, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 219, independent: 203, independent conditional: 203, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 219, independent: 203, independent conditional: 89, independent unconditional: 114, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 219, independent: 203, independent conditional: 59, independent unconditional: 144, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 219, independent: 203, independent conditional: 59, independent unconditional: 144, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 219, independent: 201, independent conditional: 58, independent unconditional: 143, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 174, Positive conditional cache size: 21, Positive unconditional cache size: 153, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 406 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 221, independent: 200, independent conditional: 200, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 221, independent: 200, independent conditional: 78, independent unconditional: 122, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 221, independent: 200, independent conditional: 48, independent unconditional: 152, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 221, independent: 200, independent conditional: 48, independent unconditional: 152, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 221, independent: 200, independent conditional: 48, independent unconditional: 152, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 174, Positive conditional cache size: 21, Positive unconditional cache size: 153, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 62 PlacesBefore, 62 PlacesAfterwards, 64 TransitionsBefore, 63 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 285, independent: 275, independent conditional: 275, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 285, independent: 275, independent conditional: 181, independent unconditional: 94, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 285, independent: 275, independent conditional: 135, independent unconditional: 140, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 285, independent: 275, independent conditional: 135, independent unconditional: 140, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 8, independent unconditional: 4, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 285, independent: 263, independent conditional: 127, independent unconditional: 136, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 12, unknown conditional: 8, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 193, Positive conditional cache size: 29, Positive unconditional cache size: 164, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 46, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 68 PlacesBefore, 68 PlacesAfterwards, 63 TransitionsBefore, 60 TransitionsAfterwards, 466 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 295, independent: 280, independent conditional: 280, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 295, independent: 280, independent conditional: 175, independent unconditional: 105, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 295, independent: 280, independent conditional: 127, independent unconditional: 153, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 295, independent: 280, independent conditional: 127, independent unconditional: 153, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 295, independent: 264, independent conditional: 111, independent unconditional: 153, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 209, Positive conditional cache size: 45, Positive unconditional cache size: 164, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 601.8s, 73 PlacesBefore, 65 PlacesAfterwards, 52 TransitionsBefore, 46 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, independent: 155, independent conditional: 155, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 163, independent: 155, independent conditional: 99, independent unconditional: 56, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163, independent: 155, independent conditional: 62, independent unconditional: 93, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 155, independent conditional: 62, independent unconditional: 93, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 163, independent: 144, independent conditional: 51, independent unconditional: 93, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 275, Positive cache size: 246, Positive conditional cache size: 57, Positive unconditional cache size: 189, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 37, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 55 PlacesBefore, 53 PlacesAfterwards, 34 TransitionsBefore, 32 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 26, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 46, independent conditional: 20, independent unconditional: 26, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 20, independent unconditional: 26, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 45, independent conditional: 19, independent unconditional: 26, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 345, Positive cache size: 316, Positive conditional cache size: 69, Positive unconditional cache size: 247, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t748; [L824] FCALL, FORK 0 pthread_create(&t748, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t748, ((void *)0), P0, ((void *)0))=-3, t748={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t749; [L826] FCALL, FORK 0 pthread_create(&t749, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t749, ((void *)0), P1, ((void *)0))=-2, t748={5:0}, t749={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L827] 0 pthread_t t750; [L828] FCALL, FORK 0 pthread_create(&t750, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t750, ((void *)0), P2, ((void *)0))=-1, t748={5:0}, t749={6:0}, t750={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L798] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L743] 1 z = 1 [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L801] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L802] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L804] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 x$flush_delayed = weak$$choice2 [L844] 0 x$mem_tmp = x [L845] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L846] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L847] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L848] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L849] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L851] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L853] 0 x = x$flush_delayed ? x$mem_tmp : x [L854] 0 x$flush_delayed = (_Bool)0 [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 619.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 377 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 377 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1113 IncrementalHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 25 mSDtfsCounter, 1113 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=11, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 1453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 23:08:15,626 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...