/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:47:58,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:47:58,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:47:58,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:47:58,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:47:58,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:47:58,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:47:58,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:47:58,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:47:58,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:47:58,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:47:58,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:47:58,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:47:58,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:47:58,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:47:58,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:47:58,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:47:58,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:47:58,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:47:58,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:47:58,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:47:58,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:47:58,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:47:58,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:47:58,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:47:58,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:47:58,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:47:58,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:47:58,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:47:58,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:47:58,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:47:58,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:47:58,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:47:58,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:47:58,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:47:58,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:47:58,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:47:58,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:47:58,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:47:58,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:47:58,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:47:58,137 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:47:58,161 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:47:58,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:47:58,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:47:58,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:47:58,163 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:47:58,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:47:58,163 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:47:58,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:47:58,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:47:58,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:47:58,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:47:58,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:47:58,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:47:58,165 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:47:58,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:47:58,165 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:47:58,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:47:58,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:47:58,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:47:58,165 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:47:58,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:47:58,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:47:58,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:47:58,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:47:58,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:47:58,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:47:58,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:47:58,166 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:47:58,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 11:47:58,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:47:58,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:47:58,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:47:58,419 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:47:58,420 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:47:58,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 11:47:59,350 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:47:59,630 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:47:59,631 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 11:47:59,643 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e327248d/286c465f6db34a408403c31dd5c9c08b/FLAG2a66be4b7 [2022-12-13 11:47:59,651 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e327248d/286c465f6db34a408403c31dd5c9c08b [2022-12-13 11:47:59,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:47:59,654 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:47:59,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:47:59,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:47:59,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:47:59,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:47:59" (1/1) ... [2022-12-13 11:47:59,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c8c774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:47:59, skipping insertion in model container [2022-12-13 11:47:59,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:47:59" (1/1) ... [2022-12-13 11:47:59,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:47:59,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:47:59,797 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/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 11:47:59,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:59,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:59,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:59,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:59,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:59,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:59,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:59,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:59,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:59,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:59,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:59,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:59,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:59,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:59,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:59,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:59,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:59,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:59,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:59,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:59,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:59,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:59,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:59,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:59,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:59,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:59,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:59,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:59,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:59,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:59,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:59,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:59,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:47:59,986 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:47:59,996 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/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 11:48:00,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:00,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:00,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:00,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:00,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:00,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:00,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:00,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:00,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:00,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:00,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:00,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:00,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:00,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:00,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:00,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:00,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:00,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:00,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:00,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:00,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:00,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:00,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:00,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:00,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:00,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:00,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:00,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:00,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:00,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:00,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:00,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:00,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:48:00,085 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:48:00,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:00 WrapperNode [2022-12-13 11:48:00,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:48:00,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:48:00,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:48:00,086 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:48:00,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:00" (1/1) ... [2022-12-13 11:48:00,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:00" (1/1) ... [2022-12-13 11:48:00,137 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-13 11:48:00,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:48:00,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:48:00,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:48:00,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:48:00,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:00" (1/1) ... [2022-12-13 11:48:00,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:00" (1/1) ... [2022-12-13 11:48:00,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:00" (1/1) ... [2022-12-13 11:48:00,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:00" (1/1) ... [2022-12-13 11:48:00,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:00" (1/1) ... [2022-12-13 11:48:00,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:00" (1/1) ... [2022-12-13 11:48:00,163 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:00" (1/1) ... [2022-12-13 11:48:00,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:00" (1/1) ... [2022-12-13 11:48:00,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:48:00,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:48:00,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:48:00,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:48:00,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:00" (1/1) ... [2022-12-13 11:48:00,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:48:00,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:48:00,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:48:00,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:48:00,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:48:00,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:48:00,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:48:00,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:48:00,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:48:00,258 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:48:00,258 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:48:00,259 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:48:00,259 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:48:00,259 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:48:00,259 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:48:00,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:48:00,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:48:00,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:48:00,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:48:00,260 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:48:00,403 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:48:00,404 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:48:00,655 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:48:00,753 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:48:00,753 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:48:00,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:48:00 BoogieIcfgContainer [2022-12-13 11:48:00,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:48:00,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:48:00,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:48:00,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:48:00,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:47:59" (1/3) ... [2022-12-13 11:48:00,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1854e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:48:00, skipping insertion in model container [2022-12-13 11:48:00,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:00" (2/3) ... [2022-12-13 11:48:00,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1854e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:48:00, skipping insertion in model container [2022-12-13 11:48:00,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:48:00" (3/3) ... [2022-12-13 11:48:00,760 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 11:48:00,777 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:48:00,777 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:48:00,777 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:48:00,814 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:48:00,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-13 11:48:00,893 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-13 11:48:00,893 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:00,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 11:48:00,897 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-13 11:48:00,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-13 11:48:00,901 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:00,919 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-13 11:48:00,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2022-12-13 11:48:00,948 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-13 11:48:00,949 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:00,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 11:48:00,951 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-13 11:48:00,951 INFO L226 LiptonReduction]: Number of co-enabled transitions 2008 [2022-12-13 11:48:04,963 INFO L241 LiptonReduction]: Total number of compositions: 87 [2022-12-13 11:48:04,983 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:48:04,989 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;@6aeb3675, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:48:04,990 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 11:48:04,991 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 11:48:04,991 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:04,992 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:04,992 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 11:48:04,992 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:48:04,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:04,996 INFO L85 PathProgramCache]: Analyzing trace with hash 494645, now seen corresponding path program 1 times [2022-12-13 11:48:05,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:05,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778620104] [2022-12-13 11:48:05,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:05,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:05,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:05,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:05,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778620104] [2022-12-13 11:48:05,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778620104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:05,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:05,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:48:05,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860799950] [2022-12-13 11:48:05,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:05,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:48:05,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:05,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:48:05,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:48:05,304 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 67 [2022-12-13 11:48:05,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:05,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:05,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 67 [2022-12-13 11:48:05,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:06,470 INFO L130 PetriNetUnfolder]: 9240/14902 cut-off events. [2022-12-13 11:48:06,470 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 11:48:06,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28140 conditions, 14902 events. 9240/14902 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 912. Compared 115907 event pairs, 1220 based on Foata normal form. 0/9416 useless extension candidates. Maximal degree in co-relation 28129. Up to 11165 conditions per place. [2022-12-13 11:48:06,501 INFO L137 encePairwiseOnDemand]: 62/67 looper letters, 36 selfloop transitions, 2 changer transitions 59/109 dead transitions. [2022-12-13 11:48:06,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 109 transitions, 425 flow [2022-12-13 11:48:06,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:48:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:48:06,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-12-13 11:48:06,509 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6965174129353234 [2022-12-13 11:48:06,510 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 143 flow. Second operand 3 states and 140 transitions. [2022-12-13 11:48:06,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 109 transitions, 425 flow [2022-12-13 11:48:06,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 109 transitions, 420 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:48:06,514 INFO L231 Difference]: Finished difference. Result has 73 places, 34 transitions, 78 flow [2022-12-13 11:48:06,515 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=73, PETRI_TRANSITIONS=34} [2022-12-13 11:48:06,517 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -3 predicate places. [2022-12-13 11:48:06,517 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:06,518 INFO L89 Accepts]: Start accepts. Operand has 73 places, 34 transitions, 78 flow [2022-12-13 11:48:06,519 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:06,519 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:06,520 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 34 transitions, 78 flow [2022-12-13 11:48:06,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 78 flow [2022-12-13 11:48:06,523 INFO L130 PetriNetUnfolder]: 0/34 cut-off events. [2022-12-13 11:48:06,524 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:06,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 81 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-13 11:48:06,525 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 78 flow [2022-12-13 11:48:06,525 INFO L226 LiptonReduction]: Number of co-enabled transitions 654 [2022-12-13 11:48:06,617 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:06,618 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 11:48:06,618 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 78 flow [2022-12-13 11:48:06,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:06,619 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:06,619 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:06,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:48:06,619 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:48:06,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:06,619 INFO L85 PathProgramCache]: Analyzing trace with hash 685556431, now seen corresponding path program 1 times [2022-12-13 11:48:06,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:06,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324793318] [2022-12-13 11:48:06,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:06,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:06,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:06,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324793318] [2022-12-13 11:48:06,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324793318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:06,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:06,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:48:06,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800553873] [2022-12-13 11:48:06,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:06,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:48:06,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:06,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:48:06,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:48:06,779 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 11:48:06,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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-13 11:48:06,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:06,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 11:48:06,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:07,295 INFO L130 PetriNetUnfolder]: 4707/7267 cut-off events. [2022-12-13 11:48:07,296 INFO L131 PetriNetUnfolder]: For 221/221 co-relation queries the response was YES. [2022-12-13 11:48:07,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14499 conditions, 7267 events. 4707/7267 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 42934 event pairs, 1515 based on Foata normal form. 0/5925 useless extension candidates. Maximal degree in co-relation 14489. Up to 4471 conditions per place. [2022-12-13 11:48:07,326 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 39 selfloop transitions, 6 changer transitions 2/55 dead transitions. [2022-12-13 11:48:07,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 218 flow [2022-12-13 11:48:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:48:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:48:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-13 11:48:07,328 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2022-12-13 11:48:07,328 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 78 flow. Second operand 3 states and 72 transitions. [2022-12-13 11:48:07,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 218 flow [2022-12-13 11:48:07,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:48:07,329 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 118 flow [2022-12-13 11:48:07,329 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-12-13 11:48:07,330 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -31 predicate places. [2022-12-13 11:48:07,330 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:07,330 INFO L89 Accepts]: Start accepts. Operand has 45 places, 38 transitions, 118 flow [2022-12-13 11:48:07,330 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:07,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:07,331 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 118 flow [2022-12-13 11:48:07,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 118 flow [2022-12-13 11:48:07,344 INFO L130 PetriNetUnfolder]: 48/240 cut-off events. [2022-12-13 11:48:07,344 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2022-12-13 11:48:07,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 240 events. 48/240 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1496 event pairs, 24 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 379. Up to 81 conditions per place. [2022-12-13 11:48:07,346 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 118 flow [2022-12-13 11:48:07,346 INFO L226 LiptonReduction]: Number of co-enabled transitions 710 [2022-12-13 11:48:07,392 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:07,393 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-13 11:48:07,393 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 118 flow [2022-12-13 11:48:07,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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-13 11:48:07,393 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:07,393 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:07,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:48:07,394 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:48:07,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:07,394 INFO L85 PathProgramCache]: Analyzing trace with hash -222589621, now seen corresponding path program 1 times [2022-12-13 11:48:07,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:07,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274062135] [2022-12-13 11:48:07,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:07,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:07,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:07,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274062135] [2022-12-13 11:48:07,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274062135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:07,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:07,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:48:07,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207743048] [2022-12-13 11:48:07,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:07,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:48:07,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:07,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:48:07,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:48:07,569 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2022-12-13 11:48:07,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:07,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:07,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2022-12-13 11:48:07,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:07,959 INFO L130 PetriNetUnfolder]: 2914/4688 cut-off events. [2022-12-13 11:48:07,959 INFO L131 PetriNetUnfolder]: For 1151/1158 co-relation queries the response was YES. [2022-12-13 11:48:07,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10425 conditions, 4688 events. 2914/4688 cut-off events. For 1151/1158 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 27235 event pairs, 1011 based on Foata normal form. 48/3902 useless extension candidates. Maximal degree in co-relation 10413. Up to 3333 conditions per place. [2022-12-13 11:48:07,979 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 33 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-13 11:48:07,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 214 flow [2022-12-13 11:48:07,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:48:07,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:48:07,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-13 11:48:07,980 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2022-12-13 11:48:07,980 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 118 flow. Second operand 3 states and 64 transitions. [2022-12-13 11:48:07,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 214 flow [2022-12-13 11:48:07,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:48:07,984 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 117 flow [2022-12-13 11:48:07,984 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-12-13 11:48:07,984 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -31 predicate places. [2022-12-13 11:48:07,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:07,984 INFO L89 Accepts]: Start accepts. Operand has 45 places, 38 transitions, 117 flow [2022-12-13 11:48:07,985 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:07,985 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:07,985 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 117 flow [2022-12-13 11:48:07,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 117 flow [2022-12-13 11:48:07,998 INFO L130 PetriNetUnfolder]: 39/197 cut-off events. [2022-12-13 11:48:07,999 INFO L131 PetriNetUnfolder]: For 17/21 co-relation queries the response was YES. [2022-12-13 11:48:07,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 197 events. 39/197 cut-off events. For 17/21 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1103 event pairs, 14 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 309. Up to 68 conditions per place. [2022-12-13 11:48:08,000 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 117 flow [2022-12-13 11:48:08,001 INFO L226 LiptonReduction]: Number of co-enabled transitions 706 [2022-12-13 11:48:08,024 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:08,025 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 11:48:08,025 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 117 flow [2022-12-13 11:48:08,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:08,026 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:08,026 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:08,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:48:08,026 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:48:08,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:08,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1690345666, now seen corresponding path program 1 times [2022-12-13 11:48:08,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:08,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067859643] [2022-12-13 11:48:08,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:08,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:08,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:08,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067859643] [2022-12-13 11:48:08,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067859643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:08,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:08,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:48:08,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232511102] [2022-12-13 11:48:08,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:08,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:48:08,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:08,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:48:08,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:48:08,120 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2022-12-13 11:48:08,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:08,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:08,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2022-12-13 11:48:08,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:08,460 INFO L130 PetriNetUnfolder]: 2905/4847 cut-off events. [2022-12-13 11:48:08,460 INFO L131 PetriNetUnfolder]: For 975/1031 co-relation queries the response was YES. [2022-12-13 11:48:08,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10488 conditions, 4847 events. 2905/4847 cut-off events. For 975/1031 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 30051 event pairs, 1515 based on Foata normal form. 18/4025 useless extension candidates. Maximal degree in co-relation 10475. Up to 4218 conditions per place. [2022-12-13 11:48:08,476 INFO L137 encePairwiseOnDemand]: 29/33 looper letters, 36 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2022-12-13 11:48:08,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 241 flow [2022-12-13 11:48:08,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:48:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:48:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-13 11:48:08,477 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6868686868686869 [2022-12-13 11:48:08,477 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 117 flow. Second operand 3 states and 68 transitions. [2022-12-13 11:48:08,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 241 flow [2022-12-13 11:48:08,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 235 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:48:08,478 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 146 flow [2022-12-13 11:48:08,479 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2022-12-13 11:48:08,479 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -30 predicate places. [2022-12-13 11:48:08,479 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:08,479 INFO L89 Accepts]: Start accepts. Operand has 46 places, 41 transitions, 146 flow [2022-12-13 11:48:08,480 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:08,480 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:08,480 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 41 transitions, 146 flow [2022-12-13 11:48:08,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 146 flow [2022-12-13 11:48:08,489 INFO L130 PetriNetUnfolder]: 33/179 cut-off events. [2022-12-13 11:48:08,490 INFO L131 PetriNetUnfolder]: For 39/50 co-relation queries the response was YES. [2022-12-13 11:48:08,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 179 events. 33/179 cut-off events. For 39/50 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 987 event pairs, 13 based on Foata normal form. 1/126 useless extension candidates. Maximal degree in co-relation 310. Up to 60 conditions per place. [2022-12-13 11:48:08,491 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 41 transitions, 146 flow [2022-12-13 11:48:08,491 INFO L226 LiptonReduction]: Number of co-enabled transitions 750 [2022-12-13 11:48:08,500 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:08,506 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 11:48:08,506 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 146 flow [2022-12-13 11:48:08,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:08,506 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:08,506 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:08,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:48:08,506 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:48:08,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:08,507 INFO L85 PathProgramCache]: Analyzing trace with hash 861137212, now seen corresponding path program 1 times [2022-12-13 11:48:08,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:08,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673597023] [2022-12-13 11:48:08,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:08,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:08,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:08,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:08,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673597023] [2022-12-13 11:48:08,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673597023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:08,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:08,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:48:08,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001561252] [2022-12-13 11:48:08,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:08,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:48:08,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:08,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:48:08,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:48:08,642 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 11:48:08,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:08,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:08,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 11:48:08,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:09,097 INFO L130 PetriNetUnfolder]: 4503/7240 cut-off events. [2022-12-13 11:48:09,097 INFO L131 PetriNetUnfolder]: For 2408/2511 co-relation queries the response was YES. [2022-12-13 11:48:09,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16471 conditions, 7240 events. 4503/7240 cut-off events. For 2408/2511 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 46319 event pairs, 1062 based on Foata normal form. 618/5572 useless extension candidates. Maximal degree in co-relation 16457. Up to 5392 conditions per place. [2022-12-13 11:48:09,117 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 72 selfloop transitions, 20 changer transitions 0/104 dead transitions. [2022-12-13 11:48:09,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 104 transitions, 516 flow [2022-12-13 11:48:09,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:48:09,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:48:09,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2022-12-13 11:48:09,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2022-12-13 11:48:09,119 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 146 flow. Second operand 5 states and 120 transitions. [2022-12-13 11:48:09,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 104 transitions, 516 flow [2022-12-13 11:48:09,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 104 transitions, 507 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:48:09,121 INFO L231 Difference]: Finished difference. Result has 52 places, 60 transitions, 291 flow [2022-12-13 11:48:09,121 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=52, PETRI_TRANSITIONS=60} [2022-12-13 11:48:09,122 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -24 predicate places. [2022-12-13 11:48:09,122 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:09,122 INFO L89 Accepts]: Start accepts. Operand has 52 places, 60 transitions, 291 flow [2022-12-13 11:48:09,123 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:09,123 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:09,123 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 60 transitions, 291 flow [2022-12-13 11:48:09,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 60 transitions, 291 flow [2022-12-13 11:48:09,226 INFO L130 PetriNetUnfolder]: 1455/2662 cut-off events. [2022-12-13 11:48:09,227 INFO L131 PetriNetUnfolder]: For 1123/1440 co-relation queries the response was YES. [2022-12-13 11:48:09,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7723 conditions, 2662 events. 1455/2662 cut-off events. For 1123/1440 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 21563 event pairs, 679 based on Foata normal form. 10/1296 useless extension candidates. Maximal degree in co-relation 7708. Up to 2060 conditions per place. [2022-12-13 11:48:09,243 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 60 transitions, 291 flow [2022-12-13 11:48:09,243 INFO L226 LiptonReduction]: Number of co-enabled transitions 1168 [2022-12-13 11:48:09,261 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L843-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_26 256)) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_59) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [468] L765-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_189 (+ v_~__unbuffered_cnt~0_190 1)) (= |v_P0Thread1of1ForFork0_#res#1.base_9| 0) (= |v_P0Thread1of1ForFork0_#res#1.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_190} OutVars{P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_9|, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_189} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, P0Thread1of1ForFork0_#res#1.base, ~__unbuffered_cnt~0] [2022-12-13 11:48:09,286 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L843-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_26 256)) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_59) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [339] L785-->L788: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:48:09,303 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L843-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_26 256)) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_59) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [347] L821-->L824: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:48:09,320 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L843-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_26 256)) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_59) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [467] L765-->P0FINAL: Formula: (and (= v_~__unbuffered_cnt~0_185 (+ v_~__unbuffered_cnt~0_186 1)) (= |v_P0Thread1of1ForFork0_#res#1.base_7| 0) (= |v_P0Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_186} OutVars{P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_7|, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_185} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, P0Thread1of1ForFork0_#res#1.base, ~__unbuffered_cnt~0] [2022-12-13 11:48:09,345 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L843-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_26 256)) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_59) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [407] L785-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-13 11:48:09,369 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L843-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_26 256)) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_59) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [400] L821-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P2Thread1of1ForFork2_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] [2022-12-13 11:48:09,393 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L843-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_26 256)) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_59) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [408] L785-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (= |v_P1Thread1of1ForFork1_#res.base_9| 0) (= |v_P1Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-13 11:48:09,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L843-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_26 256)) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_59) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [412] L821-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res.base_9| 0) (= |v_P2Thread1of1ForFork2_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] [2022-12-13 11:48:09,441 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L843-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_26 256)) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_59) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [332] L765-->L768: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:48:09,495 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:48:09,496 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 374 [2022-12-13 11:48:09,496 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 59 transitions, 321 flow [2022-12-13 11:48:09,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:09,496 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:09,496 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:09,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:48:09,497 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:48:09,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:09,497 INFO L85 PathProgramCache]: Analyzing trace with hash 980679493, now seen corresponding path program 1 times [2022-12-13 11:48:09,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:09,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290126410] [2022-12-13 11:48:09,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:09,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:09,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:09,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290126410] [2022-12-13 11:48:09,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290126410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:09,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:09,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:48:09,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532512490] [2022-12-13 11:48:09,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:09,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:48:09,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:09,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:48:09,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:48:09,610 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2022-12-13 11:48:09,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 59 transitions, 321 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:09,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:09,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2022-12-13 11:48:09,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:10,058 INFO L130 PetriNetUnfolder]: 3188/5665 cut-off events. [2022-12-13 11:48:10,059 INFO L131 PetriNetUnfolder]: For 3398/3453 co-relation queries the response was YES. [2022-12-13 11:48:10,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19702 conditions, 5665 events. 3188/5665 cut-off events. For 3398/3453 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 39819 event pairs, 252 based on Foata normal form. 524/4301 useless extension candidates. Maximal degree in co-relation 19684. Up to 3271 conditions per place. [2022-12-13 11:48:10,075 INFO L137 encePairwiseOnDemand]: 21/42 looper letters, 66 selfloop transitions, 38 changer transitions 15/131 dead transitions. [2022-12-13 11:48:10,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 131 transitions, 875 flow [2022-12-13 11:48:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:48:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:48:10,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2022-12-13 11:48:10,076 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6150793650793651 [2022-12-13 11:48:10,077 INFO L175 Difference]: Start difference. First operand has 51 places, 59 transitions, 321 flow. Second operand 6 states and 155 transitions. [2022-12-13 11:48:10,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 131 transitions, 875 flow [2022-12-13 11:48:10,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 131 transitions, 847 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-13 11:48:10,086 INFO L231 Difference]: Finished difference. Result has 58 places, 78 transitions, 552 flow [2022-12-13 11:48:10,086 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=552, PETRI_PLACES=58, PETRI_TRANSITIONS=78} [2022-12-13 11:48:10,086 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -18 predicate places. [2022-12-13 11:48:10,086 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:10,086 INFO L89 Accepts]: Start accepts. Operand has 58 places, 78 transitions, 552 flow [2022-12-13 11:48:10,087 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:10,087 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:10,087 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 78 transitions, 552 flow [2022-12-13 11:48:10,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 78 transitions, 552 flow [2022-12-13 11:48:10,177 INFO L130 PetriNetUnfolder]: 855/1974 cut-off events. [2022-12-13 11:48:10,177 INFO L131 PetriNetUnfolder]: For 3744/4547 co-relation queries the response was YES. [2022-12-13 11:48:10,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8354 conditions, 1974 events. 855/1974 cut-off events. For 3744/4547 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 17251 event pairs, 157 based on Foata normal form. 1/986 useless extension candidates. Maximal degree in co-relation 8335. Up to 1585 conditions per place. [2022-12-13 11:48:10,190 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 78 transitions, 552 flow [2022-12-13 11:48:10,191 INFO L226 LiptonReduction]: Number of co-enabled transitions 1378 [2022-12-13 11:48:10,568 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:48:10,569 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 483 [2022-12-13 11:48:10,569 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 77 transitions, 544 flow [2022-12-13 11:48:10,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:10,569 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:10,569 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:10,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:48:10,569 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:48:10,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash -2128554313, now seen corresponding path program 1 times [2022-12-13 11:48:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:10,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239895050] [2022-12-13 11:48:10,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:10,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:10,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:10,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239895050] [2022-12-13 11:48:10,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239895050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:10,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:10,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:48:10,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505437043] [2022-12-13 11:48:10,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:10,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:48:10,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:10,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:48:10,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:48:10,684 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2022-12-13 11:48:10,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 77 transitions, 544 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:10,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:10,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2022-12-13 11:48:10,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:11,213 INFO L130 PetriNetUnfolder]: 3404/6037 cut-off events. [2022-12-13 11:48:11,213 INFO L131 PetriNetUnfolder]: For 12093/12638 co-relation queries the response was YES. [2022-12-13 11:48:11,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25391 conditions, 6037 events. 3404/6037 cut-off events. For 12093/12638 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 42337 event pairs, 842 based on Foata normal form. 226/5121 useless extension candidates. Maximal degree in co-relation 25369. Up to 3227 conditions per place. [2022-12-13 11:48:11,237 INFO L137 encePairwiseOnDemand]: 37/42 looper letters, 62 selfloop transitions, 8 changer transitions 44/128 dead transitions. [2022-12-13 11:48:11,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 128 transitions, 1133 flow [2022-12-13 11:48:11,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:48:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:48:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-12-13 11:48:11,238 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6130952380952381 [2022-12-13 11:48:11,238 INFO L175 Difference]: Start difference. First operand has 58 places, 77 transitions, 544 flow. Second operand 4 states and 103 transitions. [2022-12-13 11:48:11,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 128 transitions, 1133 flow [2022-12-13 11:48:11,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 128 transitions, 923 flow, removed 64 selfloop flow, removed 3 redundant places. [2022-12-13 11:48:11,370 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 335 flow [2022-12-13 11:48:11,370 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=335, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2022-12-13 11:48:11,371 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -16 predicate places. [2022-12-13 11:48:11,371 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:11,371 INFO L89 Accepts]: Start accepts. Operand has 60 places, 59 transitions, 335 flow [2022-12-13 11:48:11,372 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:11,372 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:11,372 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 59 transitions, 335 flow [2022-12-13 11:48:11,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 59 transitions, 335 flow [2022-12-13 11:48:11,446 INFO L130 PetriNetUnfolder]: 825/1761 cut-off events. [2022-12-13 11:48:11,446 INFO L131 PetriNetUnfolder]: For 1651/1725 co-relation queries the response was YES. [2022-12-13 11:48:11,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6091 conditions, 1761 events. 825/1761 cut-off events. For 1651/1725 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 13755 event pairs, 186 based on Foata normal form. 1/948 useless extension candidates. Maximal degree in co-relation 6071. Up to 1072 conditions per place. [2022-12-13 11:48:11,456 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 59 transitions, 335 flow [2022-12-13 11:48:11,456 INFO L226 LiptonReduction]: Number of co-enabled transitions 878 [2022-12-13 11:48:11,461 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:11,462 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 11:48:11,462 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 59 transitions, 335 flow [2022-12-13 11:48:11,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:11,462 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:11,462 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:11,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:48:11,462 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:48:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:11,463 INFO L85 PathProgramCache]: Analyzing trace with hash -662032780, now seen corresponding path program 1 times [2022-12-13 11:48:11,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:11,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289602990] [2022-12-13 11:48:11,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:11,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:11,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:11,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289602990] [2022-12-13 11:48:11,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289602990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:11,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:11,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:48:11,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601811629] [2022-12-13 11:48:11,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:11,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:48:11,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:11,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:48:11,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:48:11,577 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 11:48:11,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 59 transitions, 335 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:11,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:11,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 11:48:11,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:12,074 INFO L130 PetriNetUnfolder]: 3721/6776 cut-off events. [2022-12-13 11:48:12,074 INFO L131 PetriNetUnfolder]: For 10131/10508 co-relation queries the response was YES. [2022-12-13 11:48:12,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25462 conditions, 6776 events. 3721/6776 cut-off events. For 10131/10508 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 51083 event pairs, 564 based on Foata normal form. 297/5940 useless extension candidates. Maximal degree in co-relation 25439. Up to 2813 conditions per place. [2022-12-13 11:48:12,094 INFO L137 encePairwiseOnDemand]: 25/33 looper letters, 80 selfloop transitions, 12 changer transitions 40/146 dead transitions. [2022-12-13 11:48:12,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 146 transitions, 1069 flow [2022-12-13 11:48:12,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:48:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:48:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2022-12-13 11:48:12,095 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6565656565656566 [2022-12-13 11:48:12,095 INFO L175 Difference]: Start difference. First operand has 57 places, 59 transitions, 335 flow. Second operand 6 states and 130 transitions. [2022-12-13 11:48:12,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 146 transitions, 1069 flow [2022-12-13 11:48:12,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 146 transitions, 1049 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-13 11:48:12,152 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 371 flow [2022-12-13 11:48:12,152 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2022-12-13 11:48:12,152 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -13 predicate places. [2022-12-13 11:48:12,152 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:12,152 INFO L89 Accepts]: Start accepts. Operand has 63 places, 61 transitions, 371 flow [2022-12-13 11:48:12,153 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:12,153 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:12,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 61 transitions, 371 flow [2022-12-13 11:48:12,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 61 transitions, 371 flow [2022-12-13 11:48:12,266 INFO L130 PetriNetUnfolder]: 1327/2660 cut-off events. [2022-12-13 11:48:12,266 INFO L131 PetriNetUnfolder]: For 2625/2700 co-relation queries the response was YES. [2022-12-13 11:48:12,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9149 conditions, 2660 events. 1327/2660 cut-off events. For 2625/2700 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 21727 event pairs, 310 based on Foata normal form. 1/1418 useless extension candidates. Maximal degree in co-relation 9126. Up to 1705 conditions per place. [2022-12-13 11:48:12,279 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 61 transitions, 371 flow [2022-12-13 11:48:12,279 INFO L226 LiptonReduction]: Number of co-enabled transitions 886 [2022-12-13 11:48:12,288 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:12,289 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 11:48:12,289 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 371 flow [2022-12-13 11:48:12,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:12,289 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:12,289 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:12,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:48:12,289 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:48:12,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:12,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1840309606, now seen corresponding path program 2 times [2022-12-13 11:48:12,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:12,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302544982] [2022-12-13 11:48:12,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:12,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:12,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:12,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302544982] [2022-12-13 11:48:12,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302544982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:12,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:12,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:48:12,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982214470] [2022-12-13 11:48:12,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:12,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:48:12,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:12,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:48:12,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:48:12,414 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 11:48:12,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:12,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:12,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 11:48:12,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:12,752 INFO L130 PetriNetUnfolder]: 2118/4185 cut-off events. [2022-12-13 11:48:12,752 INFO L131 PetriNetUnfolder]: For 3249/3308 co-relation queries the response was YES. [2022-12-13 11:48:12,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15647 conditions, 4185 events. 2118/4185 cut-off events. For 3249/3308 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 31590 event pairs, 128 based on Foata normal form. 575/3306 useless extension candidates. Maximal degree in co-relation 15621. Up to 1792 conditions per place. [2022-12-13 11:48:12,763 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 32 selfloop transitions, 28 changer transitions 39/106 dead transitions. [2022-12-13 11:48:12,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 106 transitions, 789 flow [2022-12-13 11:48:12,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:48:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:48:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2022-12-13 11:48:12,764 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5974025974025974 [2022-12-13 11:48:12,764 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 371 flow. Second operand 7 states and 138 transitions. [2022-12-13 11:48:12,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 106 transitions, 789 flow [2022-12-13 11:48:12,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 729 flow, removed 20 selfloop flow, removed 2 redundant places. [2022-12-13 11:48:12,777 INFO L231 Difference]: Finished difference. Result has 70 places, 50 transitions, 331 flow [2022-12-13 11:48:12,777 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=331, PETRI_PLACES=70, PETRI_TRANSITIONS=50} [2022-12-13 11:48:12,778 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -6 predicate places. [2022-12-13 11:48:12,778 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:12,778 INFO L89 Accepts]: Start accepts. Operand has 70 places, 50 transitions, 331 flow [2022-12-13 11:48:12,779 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:12,779 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:12,779 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 50 transitions, 331 flow [2022-12-13 11:48:12,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 50 transitions, 331 flow [2022-12-13 11:48:12,792 INFO L130 PetriNetUnfolder]: 90/270 cut-off events. [2022-12-13 11:48:12,792 INFO L131 PetriNetUnfolder]: For 300/471 co-relation queries the response was YES. [2022-12-13 11:48:12,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 270 events. 90/270 cut-off events. For 300/471 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 1417 event pairs, 0 based on Foata normal form. 1/143 useless extension candidates. Maximal degree in co-relation 1106. Up to 154 conditions per place. [2022-12-13 11:48:12,794 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 50 transitions, 331 flow [2022-12-13 11:48:12,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 444 [2022-12-13 11:48:13,498 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 11:48:13,498 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 720 [2022-12-13 11:48:13,498 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 315 flow [2022-12-13 11:48:13,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:13,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:13,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:13,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:48:13,499 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:48:13,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash -584301914, now seen corresponding path program 1 times [2022-12-13 11:48:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:13,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109745303] [2022-12-13 11:48:13,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:13,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:14,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:14,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:14,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109745303] [2022-12-13 11:48:14,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109745303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:14,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:14,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:48:14,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894762539] [2022-12-13 11:48:14,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:14,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:48:14,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:14,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:48:14,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:48:14,069 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 26 [2022-12-13 11:48:14,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 315 flow. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:14,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:14,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 26 [2022-12-13 11:48:14,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:14,249 INFO L130 PetriNetUnfolder]: 397/738 cut-off events. [2022-12-13 11:48:14,249 INFO L131 PetriNetUnfolder]: For 3118/3183 co-relation queries the response was YES. [2022-12-13 11:48:14,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3441 conditions, 738 events. 397/738 cut-off events. For 3118/3183 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3703 event pairs, 18 based on Foata normal form. 64/621 useless extension candidates. Maximal degree in co-relation 3412. Up to 409 conditions per place. [2022-12-13 11:48:14,252 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 43 selfloop transitions, 4 changer transitions 31/89 dead transitions. [2022-12-13 11:48:14,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 89 transitions, 744 flow [2022-12-13 11:48:14,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:48:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:48:14,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2022-12-13 11:48:14,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2022-12-13 11:48:14,253 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 315 flow. Second operand 7 states and 98 transitions. [2022-12-13 11:48:14,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 89 transitions, 744 flow [2022-12-13 11:48:14,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 553 flow, removed 39 selfloop flow, removed 16 redundant places. [2022-12-13 11:48:14,258 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 211 flow [2022-12-13 11:48:14,258 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=211, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 11:48:14,258 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -25 predicate places. [2022-12-13 11:48:14,258 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:14,259 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 211 flow [2022-12-13 11:48:14,259 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:14,259 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:14,259 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 211 flow [2022-12-13 11:48:14,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 42 transitions, 211 flow [2022-12-13 11:48:14,269 INFO L130 PetriNetUnfolder]: 90/207 cut-off events. [2022-12-13 11:48:14,269 INFO L131 PetriNetUnfolder]: For 302/302 co-relation queries the response was YES. [2022-12-13 11:48:14,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 207 events. 90/207 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 929 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 602. Up to 109 conditions per place. [2022-12-13 11:48:14,270 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 42 transitions, 211 flow [2022-12-13 11:48:14,270 INFO L226 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-13 11:48:14,913 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [499] $Ultimate##0-->L758: Formula: (and (= v_~z$r_buff0_thd3~0_213 v_~z$r_buff1_thd3~0_218) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_63| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_63|) (= v_~z$w_buff0_used~0_450 v_~z$w_buff1_used~0_394) (= v_~x~0_120 1) (= v_~z$r_buff0_thd2~0_131 v_~z$r_buff1_thd2~0_142) (= v_~z$w_buff0~0_259 1) (= v_~z$r_buff0_thd0~0_146 v_~z$r_buff1_thd0~0_142) (= v_~z$r_buff0_thd1~0_174 1) (= v_~z$w_buff0_used~0_449 1) (= v_~z$r_buff0_thd1~0_175 v_~z$r_buff1_thd1~0_119) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_63| 0)) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_57| |v_P0Thread1of1ForFork0_~arg#1.offset_57|) (= v_~z$w_buff0~0_260 v_~z$w_buff1~0_216) (= |v_P0Thread1of1ForFork0_~arg#1.base_57| |v_P0Thread1of1ForFork0_#in~arg#1.base_57|) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_449 256) 0)) (not (= (mod v_~z$w_buff1_used~0_394 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_63|)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_146, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_57|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_450, ~z$w_buff0~0=v_~z$w_buff0~0_260, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_57|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_213, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_175, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_57|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_449, ~z$w_buff0~0=v_~z$w_buff0~0_259, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_218, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_142, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_394, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_57|, ~z$w_buff1~0=v_~z$w_buff1~0_216, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_57|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_57|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_146, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_142, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_63|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_119, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_213, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_174, ~x~0=v_~x~0_120, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_63|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0_~arg#1.base, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg#1.offset, ~z$r_buff1_thd0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] and [503] $Ultimate##0-->L778: Formula: (and (= v_~y~0_66 v_~__unbuffered_p1_EAX~0_98) (= |v_P1Thread1of1ForFork1_#in~arg.offset_25| v_P1Thread1of1ForFork1_~arg.offset_25) (= 2 v_~x~0_124) (= v_P1Thread1of1ForFork1_~arg.base_25 |v_P1Thread1of1ForFork1_#in~arg.base_25|)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_25|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_25|, ~y~0=v_~y~0_66} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_25, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_25|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_25|, ~y~0=v_~y~0_66, ~x~0=v_~x~0_124} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~x~0] [2022-12-13 11:48:15,087 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:48:15,088 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 830 [2022-12-13 11:48:15,088 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 229 flow [2022-12-13 11:48:15,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:15,089 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:15,089 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:15,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:48:15,089 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:48:15,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:15,089 INFO L85 PathProgramCache]: Analyzing trace with hash -843904599, now seen corresponding path program 1 times [2022-12-13 11:48:15,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:15,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987116514] [2022-12-13 11:48:15,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:15,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:48:15,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:48:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:48:15,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:48:15,194 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:48:15,195 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 11:48:15,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 11:48:15,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 11:48:15,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 11:48:15,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 11:48:15,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 11:48:15,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:48:15,199 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:15,204 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:48:15,204 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:48:15,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:48:15 BasicIcfg [2022-12-13 11:48:15,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:48:15,261 INFO L158 Benchmark]: Toolchain (without parser) took 15606.72ms. Allocated memory was 185.6MB in the beginning and 1.0GB in the end (delta: 856.7MB). Free memory was 160.7MB in the beginning and 585.6MB in the end (delta: -424.9MB). Peak memory consumption was 431.4MB. Max. memory is 8.0GB. [2022-12-13 11:48:15,261 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 185.6MB. Free memory was 162.4MB in the beginning and 162.3MB in the end (delta: 79.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:48:15,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.32ms. Allocated memory is still 185.6MB. Free memory was 160.7MB in the beginning and 134.2MB in the end (delta: 26.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 11:48:15,261 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.68ms. Allocated memory is still 185.6MB. Free memory was 134.2MB in the beginning and 131.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 11:48:15,261 INFO L158 Benchmark]: Boogie Preprocessor took 27.25ms. Allocated memory is still 185.6MB. Free memory was 131.6MB in the beginning and 130.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 11:48:15,261 INFO L158 Benchmark]: RCFGBuilder took 589.01ms. Allocated memory is still 185.6MB. Free memory was 129.5MB in the beginning and 95.4MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-13 11:48:15,261 INFO L158 Benchmark]: TraceAbstraction took 14503.72ms. Allocated memory was 185.6MB in the beginning and 1.0GB in the end (delta: 856.7MB). Free memory was 94.3MB in the beginning and 585.6MB in the end (delta: -491.3MB). Peak memory consumption was 365.4MB. Max. memory is 8.0GB. [2022-12-13 11:48:15,262 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.08ms. Allocated memory is still 185.6MB. Free memory was 162.4MB in the beginning and 162.3MB in the end (delta: 79.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 429.32ms. Allocated memory is still 185.6MB. Free memory was 160.7MB in the beginning and 134.2MB in the end (delta: 26.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.68ms. Allocated memory is still 185.6MB. Free memory was 134.2MB in the beginning and 131.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.25ms. Allocated memory is still 185.6MB. Free memory was 131.6MB in the beginning and 130.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 589.01ms. Allocated memory is still 185.6MB. Free memory was 129.5MB in the beginning and 95.4MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 14503.72ms. Allocated memory was 185.6MB in the beginning and 1.0GB in the end (delta: 856.7MB). Free memory was 94.3MB in the beginning and 585.6MB in the end (delta: -491.3MB). Peak memory consumption was 365.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 115 PlacesBefore, 76 PlacesAfterwards, 107 TransitionsBefore, 67 TransitionsAfterwards, 2008 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 42 ConcurrentYvCompositions, 5 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3321, independent: 3194, independent conditional: 3194, independent unconditional: 0, dependent: 127, dependent conditional: 127, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3321, independent: 3194, independent conditional: 0, independent unconditional: 3194, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3321, independent: 3194, independent conditional: 0, independent unconditional: 3194, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3321, independent: 3194, independent conditional: 0, independent unconditional: 3194, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1894, independent: 1844, independent conditional: 0, independent unconditional: 1844, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1894, independent: 1819, independent conditional: 0, independent unconditional: 1819, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3321, independent: 1350, independent conditional: 0, independent unconditional: 1350, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 1894, unknown conditional: 0, unknown unconditional: 1894] , Statistics on independence cache: Total cache size (in pairs): 3509, Positive cache size: 3459, Positive conditional cache size: 0, Positive unconditional cache size: 3459, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 654 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 330, independent: 292, independent conditional: 292, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 330, independent: 292, independent conditional: 26, independent unconditional: 266, dependent: 38, dependent conditional: 14, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 330, independent: 292, independent conditional: 26, independent unconditional: 266, dependent: 38, dependent conditional: 14, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 330, independent: 292, independent conditional: 26, independent unconditional: 266, dependent: 38, dependent conditional: 14, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 270, independent: 243, independent conditional: 25, independent unconditional: 218, dependent: 27, dependent conditional: 8, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 270, independent: 218, independent conditional: 0, independent unconditional: 218, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 27, dependent conditional: 8, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 66, dependent conditional: 34, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 330, independent: 49, independent conditional: 1, independent unconditional: 48, dependent: 11, dependent conditional: 6, dependent unconditional: 5, unknown: 270, unknown conditional: 33, unknown unconditional: 237] , Statistics on independence cache: Total cache size (in pairs): 270, Positive cache size: 243, Positive conditional cache size: 25, Positive unconditional cache size: 218, Negative cache size: 27, Negative conditional cache size: 8, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 710 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 294, independent: 267, independent conditional: 267, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 294, independent: 267, independent conditional: 27, independent unconditional: 240, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 294, independent: 267, independent conditional: 0, independent unconditional: 267, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 294, independent: 267, independent conditional: 0, independent unconditional: 267, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 46, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 46, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 294, independent: 226, independent conditional: 0, independent unconditional: 226, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 46, unknown conditional: 0, unknown unconditional: 46] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 284, Positive conditional cache size: 25, Positive unconditional cache size: 259, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 706 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 273, independent: 244, independent conditional: 244, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 273, independent: 244, independent conditional: 0, independent unconditional: 244, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 273, independent: 244, independent conditional: 0, independent unconditional: 244, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 273, independent: 244, independent conditional: 0, independent unconditional: 244, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 273, independent: 243, independent conditional: 0, independent unconditional: 243, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 320, Positive cache size: 285, Positive conditional cache size: 25, Positive unconditional cache size: 260, Negative cache size: 35, Negative conditional cache size: 8, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 750 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 318, independent: 287, independent conditional: 287, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 318, independent: 287, independent conditional: 19, independent unconditional: 268, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 318, independent: 287, independent conditional: 0, independent unconditional: 287, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 318, independent: 287, independent conditional: 0, independent unconditional: 287, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 318, independent: 285, independent conditional: 0, independent unconditional: 285, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 323, Positive cache size: 287, Positive conditional cache size: 25, Positive unconditional cache size: 262, Negative cache size: 36, Negative conditional cache size: 8, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 52 PlacesBefore, 51 PlacesAfterwards, 60 TransitionsBefore, 59 TransitionsAfterwards, 1168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 949, independent: 857, independent conditional: 857, independent unconditional: 0, dependent: 92, dependent conditional: 92, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 949, independent: 857, independent conditional: 395, independent unconditional: 462, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 949, independent: 857, independent conditional: 345, independent unconditional: 512, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 949, independent: 857, independent conditional: 345, independent unconditional: 512, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 19, 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: 20, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 949, independent: 838, independent conditional: 326, independent unconditional: 512, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 20, unknown conditional: 19, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 373, Positive cache size: 336, Positive conditional cache size: 50, Positive unconditional cache size: 286, Negative cache size: 37, Negative conditional cache size: 8, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 50, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 58 PlacesBefore, 58 PlacesAfterwards, 78 TransitionsBefore, 77 TransitionsAfterwards, 1378 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 865, independent: 743, independent conditional: 743, independent unconditional: 0, dependent: 122, dependent conditional: 122, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 865, independent: 743, independent conditional: 433, independent unconditional: 310, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 865, independent: 743, independent conditional: 417, independent unconditional: 326, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 865, independent: 743, independent conditional: 417, independent unconditional: 326, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 20, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 865, independent: 722, independent conditional: 397, independent unconditional: 325, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 23, unknown conditional: 20, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 396, Positive cache size: 357, Positive conditional cache size: 70, Positive unconditional cache size: 287, Negative cache size: 39, Negative conditional cache size: 8, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 878 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 294, independent: 255, independent conditional: 255, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 294, independent: 255, independent conditional: 54, independent unconditional: 201, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 294, independent: 255, independent conditional: 33, independent unconditional: 222, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 294, independent: 255, independent conditional: 33, independent unconditional: 222, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 294, independent: 250, independent conditional: 31, independent unconditional: 219, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 362, Positive conditional cache size: 72, Positive unconditional cache size: 290, Negative cache size: 39, Negative conditional cache size: 8, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 886 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 262, independent: 227, independent conditional: 227, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 262, independent: 227, independent conditional: 57, independent unconditional: 170, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 262, independent: 227, independent conditional: 15, independent unconditional: 212, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 262, independent: 227, independent conditional: 15, independent unconditional: 212, dependent: 35, dependent conditional: 0, dependent unconditional: 35, 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: 262, independent: 227, independent conditional: 15, independent unconditional: 212, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 362, Positive conditional cache size: 72, Positive unconditional cache size: 290, Negative cache size: 39, Negative conditional cache size: 8, Negative unconditional cache size: 31, 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.7s, 65 PlacesBefore, 59 PlacesAfterwards, 50 TransitionsBefore, 44 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 435, independent: 373, independent conditional: 373, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 435, independent: 373, independent conditional: 199, independent unconditional: 174, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 435, independent: 373, independent conditional: 190, independent unconditional: 183, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 435, independent: 373, independent conditional: 190, independent unconditional: 183, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 23, independent conditional: 16, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 435, independent: 350, independent conditional: 174, independent unconditional: 176, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 27, unknown conditional: 16, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 489, Positive cache size: 446, Positive conditional cache size: 92, Positive unconditional cache size: 354, Negative cache size: 43, Negative conditional cache size: 8, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 48 PlacesBefore, 45 PlacesAfterwards, 42 TransitionsBefore, 40 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 363, independent: 323, independent conditional: 323, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 363, independent: 323, independent conditional: 263, independent unconditional: 60, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 363, independent: 323, independent conditional: 263, independent unconditional: 60, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 363, independent: 323, independent conditional: 263, independent unconditional: 60, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, independent: 32, independent conditional: 26, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 102, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 363, independent: 291, independent conditional: 237, independent unconditional: 54, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 34, unknown conditional: 26, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 727, Positive cache size: 682, Positive conditional cache size: 118, Positive unconditional cache size: 564, Negative cache size: 45, Negative conditional cache size: 8, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t497; [L839] FCALL, FORK 0 pthread_create(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t497, ((void *)0), P0, ((void *)0))=-1, t497={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t498; [L841] FCALL, FORK 0 pthread_create(&t498, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t498, ((void *)0), P1, ((void *)0))=0, t497={5:0}, t498={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t499; [L843] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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(&t499, ((void *)0), P2, ((void *)0))=1, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 [L757] 1 x = 1 [L774] 1 x = 2 [L777] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 y = 1 [L797] 3 __unbuffered_p2_EAX = y [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L856] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 839]: 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: 843]: 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: 841]: 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, 138 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: 14.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 384 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 384 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 986 IncrementalHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 15 mSDtfsCounter, 986 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=552occurred in iteration=6, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 831 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:48:15,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...