/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/mix038_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:52:34,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:52:34,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:52:34,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:52:34,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:52:34,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:52:34,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:52:34,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:52:34,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:52:34,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:52:34,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:52:34,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:52:34,114 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:52:34,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:52:34,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:52:34,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:52:34,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:52:34,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:52:34,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:52:34,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:52:34,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:52:34,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:52:34,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:52:34,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:52:34,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:52:34,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:52:34,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:52:34,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:52:34,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:52:34,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:52:34,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:52:34,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:52:34,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:52:34,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:52:34,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:52:34,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:52:34,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:52:34,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:52:34,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:52:34,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:52:34,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:52:34,140 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:52:34,169 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:52:34,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:52:34,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:52:34,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:52:34,171 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:52:34,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:52:34,171 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:52:34,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:52:34,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:52:34,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:52:34,172 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:52:34,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:52:34,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:52:34,172 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:52:34,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:52:34,173 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:52:34,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:52:34,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:52:34,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:52:34,173 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:52:34,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:52:34,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:52:34,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:52:34,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:52:34,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:52:34,174 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:52:34,174 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:52:34,174 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:52:34,174 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:52:34,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:52:34,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:52:34,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:52:34,431 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:52:34,431 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:52:34,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 11:52:35,295 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:52:35,526 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:52:35,526 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 11:52:35,541 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3af9c19e/d23d9c5ec44d40909be51351642d971b/FLAG758a0d836 [2022-12-13 11:52:35,550 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3af9c19e/d23d9c5ec44d40909be51351642d971b [2022-12-13 11:52:35,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:52:35,552 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:52:35,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:52:35,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:52:35,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:52:35,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:52:35" (1/1) ... [2022-12-13 11:52:35,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61cf0189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:35, skipping insertion in model container [2022-12-13 11:52:35,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:52:35" (1/1) ... [2022-12-13 11:52:35,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:52:35,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:52:35,684 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/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 11:52:35,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:52:35,871 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:52:35,882 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/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 11:52:35,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:35,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:35,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:52:35,957 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:52:35,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:35 WrapperNode [2022-12-13 11:52:35,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:52:35,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:52:35,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:52:35,958 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:52:35,962 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:52:35" (1/1) ... [2022-12-13 11:52:35,973 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:52:35" (1/1) ... [2022-12-13 11:52:35,993 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-12-13 11:52:35,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:52:35,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:52:35,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:52:35,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:52:36,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:35" (1/1) ... [2022-12-13 11:52:36,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:35" (1/1) ... [2022-12-13 11:52:36,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:35" (1/1) ... [2022-12-13 11:52:36,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:35" (1/1) ... [2022-12-13 11:52:36,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:35" (1/1) ... [2022-12-13 11:52:36,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:35" (1/1) ... [2022-12-13 11:52:36,016 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:35" (1/1) ... [2022-12-13 11:52:36,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:35" (1/1) ... [2022-12-13 11:52:36,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:52:36,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:52:36,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:52:36,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:52:36,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:35" (1/1) ... [2022-12-13 11:52:36,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:52:36,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:52:36,041 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:52:36,047 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:52:36,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:52:36,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:52:36,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:52:36,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:52:36,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:52:36,066 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:52:36,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:52:36,066 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:52:36,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:52:36,066 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:52:36,067 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:52:36,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:52:36,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:52:36,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:52:36,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:52:36,068 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:52:36,180 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:52:36,182 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:52:36,428 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:52:36,601 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:52:36,601 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:52:36,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:52:36 BoogieIcfgContainer [2022-12-13 11:52:36,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:52:36,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:52:36,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:52:36,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:52:36,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:52:35" (1/3) ... [2022-12-13 11:52:36,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37da3c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:52:36, skipping insertion in model container [2022-12-13 11:52:36,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:35" (2/3) ... [2022-12-13 11:52:36,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37da3c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:52:36, skipping insertion in model container [2022-12-13 11:52:36,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:52:36" (3/3) ... [2022-12-13 11:52:36,609 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 11:52:36,626 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:52:36,627 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:52:36,627 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:52:36,669 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:52:36,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-12-13 11:52:36,729 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-13 11:52:36,730 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:36,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 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/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 11:52:36,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-12-13 11:52:36,739 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-12-13 11:52:36,740 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:36,755 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-13 11:52:36,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2022-12-13 11:52:36,780 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-13 11:52:36,780 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:36,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 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/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 11:52:36,783 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-13 11:52:36,783 INFO L226 LiptonReduction]: Number of co-enabled transitions 2096 [2022-12-13 11:52:40,810 INFO L241 LiptonReduction]: Total number of compositions: 87 [2022-12-13 11:52:40,827 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:52:40,832 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;@7be696e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:52:40,832 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 11:52:40,835 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 11:52:40,835 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:40,835 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:40,836 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 11:52:40,836 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:52:40,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:40,841 INFO L85 PathProgramCache]: Analyzing trace with hash 515099, now seen corresponding path program 1 times [2022-12-13 11:52:40,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:40,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469338036] [2022-12-13 11:52:40,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:40,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:41,137 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:52:41,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:41,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469338036] [2022-12-13 11:52:41,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469338036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:41,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:41,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:52:41,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611445315] [2022-12-13 11:52:41,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:41,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:52:41,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:41,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:52:41,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:52:41,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 69 [2022-12-13 11:52:41,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 147 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:52:41,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:41,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 69 [2022-12-13 11:52:41,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:42,469 INFO L130 PetriNetUnfolder]: 10840/17378 cut-off events. [2022-12-13 11:52:42,470 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 11:52:42,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32841 conditions, 17378 events. 10840/17378 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 1025. Compared 136902 event pairs, 1440 based on Foata normal form. 0/10486 useless extension candidates. Maximal degree in co-relation 32830. Up to 13045 conditions per place. [2022-12-13 11:52:42,518 INFO L137 encePairwiseOnDemand]: 63/69 looper letters, 38 selfloop transitions, 2 changer transitions 59/111 dead transitions. [2022-12-13 11:52:42,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 111 transitions, 433 flow [2022-12-13 11:52:42,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:52:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:52:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-12-13 11:52:42,526 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6956521739130435 [2022-12-13 11:52:42,527 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 147 flow. Second operand 3 states and 144 transitions. [2022-12-13 11:52:42,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 111 transitions, 433 flow [2022-12-13 11:52:42,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 111 transitions, 428 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:52:42,531 INFO L231 Difference]: Finished difference. Result has 74 places, 35 transitions, 80 flow [2022-12-13 11:52:42,532 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=74, PETRI_TRANSITIONS=35} [2022-12-13 11:52:42,535 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2022-12-13 11:52:42,535 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:42,536 INFO L89 Accepts]: Start accepts. Operand has 74 places, 35 transitions, 80 flow [2022-12-13 11:52:42,538 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:42,539 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:42,539 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 35 transitions, 80 flow [2022-12-13 11:52:42,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2022-12-13 11:52:42,543 INFO L130 PetriNetUnfolder]: 0/35 cut-off events. [2022-12-13 11:52:42,543 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:42,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 85 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:52:42,545 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 80 flow [2022-12-13 11:52:42,545 INFO L226 LiptonReduction]: Number of co-enabled transitions 692 [2022-12-13 11:52:42,661 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:42,663 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 11:52:42,663 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 80 flow [2022-12-13 11:52:42,663 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:52:42,663 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:42,663 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:42,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:52:42,663 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:52:42,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:42,664 INFO L85 PathProgramCache]: Analyzing trace with hash 5120902, now seen corresponding path program 1 times [2022-12-13 11:52:42,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:42,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768375154] [2022-12-13 11:52:42,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:42,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:42,875 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:52:42,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:42,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768375154] [2022-12-13 11:52:42,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768375154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:42,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:42,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:52:42,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373647856] [2022-12-13 11:52:42,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:42,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:52:42,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:42,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:52:42,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:52:42,877 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 11:52:42,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 80 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:52:42,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:42,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 11:52:42,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:43,402 INFO L130 PetriNetUnfolder]: 5349/8207 cut-off events. [2022-12-13 11:52:43,402 INFO L131 PetriNetUnfolder]: For 250/250 co-relation queries the response was YES. [2022-12-13 11:52:43,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16384 conditions, 8207 events. 5349/8207 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 49087 event pairs, 1737 based on Foata normal form. 0/6457 useless extension candidates. Maximal degree in co-relation 16374. Up to 5005 conditions per place. [2022-12-13 11:52:43,437 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 41 selfloop transitions, 6 changer transitions 2/57 dead transitions. [2022-12-13 11:52:43,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 226 flow [2022-12-13 11:52:43,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:52:43,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:52:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-12-13 11:52:43,439 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2022-12-13 11:52:43,439 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 80 flow. Second operand 3 states and 74 transitions. [2022-12-13 11:52:43,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 226 flow [2022-12-13 11:52:43,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:43,441 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 120 flow [2022-12-13 11:52:43,441 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2022-12-13 11:52:43,442 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -32 predicate places. [2022-12-13 11:52:43,442 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:43,442 INFO L89 Accepts]: Start accepts. Operand has 46 places, 39 transitions, 120 flow [2022-12-13 11:52:43,443 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:43,443 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:43,443 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 120 flow [2022-12-13 11:52:43,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 120 flow [2022-12-13 11:52:43,464 INFO L130 PetriNetUnfolder]: 48/241 cut-off events. [2022-12-13 11:52:43,464 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2022-12-13 11:52:43,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 241 events. 48/241 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1525 event pairs, 24 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 380. Up to 81 conditions per place. [2022-12-13 11:52:43,466 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 39 transitions, 120 flow [2022-12-13 11:52:43,466 INFO L226 LiptonReduction]: Number of co-enabled transitions 750 [2022-12-13 11:52:43,490 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:43,491 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-13 11:52:43,492 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 120 flow [2022-12-13 11:52:43,492 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:52:43,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:43,492 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:43,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:52:43,492 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:52:43,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:43,493 INFO L85 PathProgramCache]: Analyzing trace with hash 158748357, now seen corresponding path program 1 times [2022-12-13 11:52:43,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:43,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123622739] [2022-12-13 11:52:43,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:43,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:43,666 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:52:43,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:43,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123622739] [2022-12-13 11:52:43,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123622739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:43,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:43,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:52:43,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912181819] [2022-12-13 11:52:43,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:43,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:52:43,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:43,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:52:43,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:52:43,673 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 11:52:43,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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:52:43,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:43,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 11:52:43,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:44,110 INFO L130 PetriNetUnfolder]: 3848/5987 cut-off events. [2022-12-13 11:52:44,110 INFO L131 PetriNetUnfolder]: For 1882/1882 co-relation queries the response was YES. [2022-12-13 11:52:44,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13767 conditions, 5987 events. 3848/5987 cut-off events. For 1882/1882 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 33201 event pairs, 1280 based on Foata normal form. 90/4996 useless extension candidates. Maximal degree in co-relation 13755. Up to 2621 conditions per place. [2022-12-13 11:52:44,135 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 47 selfloop transitions, 7 changer transitions 1/63 dead transitions. [2022-12-13 11:52:44,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 292 flow [2022-12-13 11:52:44,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:52:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:52:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 11:52:44,137 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 11:52:44,137 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 120 flow. Second operand 4 states and 85 transitions. [2022-12-13 11:52:44,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 292 flow [2022-12-13 11:52:44,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:44,141 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 154 flow [2022-12-13 11:52:44,141 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2022-12-13 11:52:44,142 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -29 predicate places. [2022-12-13 11:52:44,142 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:44,142 INFO L89 Accepts]: Start accepts. Operand has 49 places, 41 transitions, 154 flow [2022-12-13 11:52:44,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:44,143 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:44,143 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 41 transitions, 154 flow [2022-12-13 11:52:44,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 41 transitions, 154 flow [2022-12-13 11:52:44,157 INFO L130 PetriNetUnfolder]: 39/197 cut-off events. [2022-12-13 11:52:44,157 INFO L131 PetriNetUnfolder]: For 68/78 co-relation queries the response was YES. [2022-12-13 11:52:44,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 197 events. 39/197 cut-off events. For 68/78 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1098 event pairs, 14 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 366. Up to 68 conditions per place. [2022-12-13 11:52:44,159 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 41 transitions, 154 flow [2022-12-13 11:52:44,159 INFO L226 LiptonReduction]: Number of co-enabled transitions 748 [2022-12-13 11:52:44,166 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:44,166 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 11:52:44,167 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 154 flow [2022-12-13 11:52:44,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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:52:44,167 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:44,167 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:44,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:52:44,167 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:52:44,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:44,167 INFO L85 PathProgramCache]: Analyzing trace with hash 552370264, now seen corresponding path program 1 times [2022-12-13 11:52:44,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:44,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772470205] [2022-12-13 11:52:44,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:44,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:44,256 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:52:44,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:44,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772470205] [2022-12-13 11:52:44,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772470205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:44,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:44,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:52:44,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152425323] [2022-12-13 11:52:44,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:44,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:52:44,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:44,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:52:44,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:52:44,258 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 11:52:44,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 154 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:52:44,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:44,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 11:52:44,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:44,679 INFO L130 PetriNetUnfolder]: 3404/5365 cut-off events. [2022-12-13 11:52:44,679 INFO L131 PetriNetUnfolder]: For 3155/3155 co-relation queries the response was YES. [2022-12-13 11:52:44,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13090 conditions, 5365 events. 3404/5365 cut-off events. For 3155/3155 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 31108 event pairs, 664 based on Foata normal form. 10/4536 useless extension candidates. Maximal degree in co-relation 13075. Up to 3201 conditions per place. [2022-12-13 11:52:44,745 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 50 selfloop transitions, 13 changer transitions 0/71 dead transitions. [2022-12-13 11:52:44,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 366 flow [2022-12-13 11:52:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:52:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:52:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-13 11:52:44,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6893939393939394 [2022-12-13 11:52:44,749 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 154 flow. Second operand 4 states and 91 transitions. [2022-12-13 11:52:44,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 366 flow [2022-12-13 11:52:44,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:52:44,753 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 223 flow [2022-12-13 11:52:44,754 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=223, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2022-12-13 11:52:44,755 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -26 predicate places. [2022-12-13 11:52:44,755 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:44,755 INFO L89 Accepts]: Start accepts. Operand has 52 places, 45 transitions, 223 flow [2022-12-13 11:52:44,756 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:44,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:44,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 45 transitions, 223 flow [2022-12-13 11:52:44,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 45 transitions, 223 flow [2022-12-13 11:52:44,767 INFO L130 PetriNetUnfolder]: 33/179 cut-off events. [2022-12-13 11:52:44,767 INFO L131 PetriNetUnfolder]: For 155/183 co-relation queries the response was YES. [2022-12-13 11:52:44,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 179 events. 33/179 cut-off events. For 155/183 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 977 event pairs, 13 based on Foata normal form. 1/127 useless extension candidates. Maximal degree in co-relation 395. Up to 60 conditions per place. [2022-12-13 11:52:44,769 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 45 transitions, 223 flow [2022-12-13 11:52:44,769 INFO L226 LiptonReduction]: Number of co-enabled transitions 800 [2022-12-13 11:52:44,772 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:44,777 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 11:52:44,777 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 223 flow [2022-12-13 11:52:44,778 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:52:44,778 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:44,778 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:44,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:52:44,778 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:52:44,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:44,778 INFO L85 PathProgramCache]: Analyzing trace with hash -56292025, now seen corresponding path program 1 times [2022-12-13 11:52:44,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:44,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079059665] [2022-12-13 11:52:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:44,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:44,881 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:52:44,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:44,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079059665] [2022-12-13 11:52:44,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079059665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:44,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:44,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:52:44,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718728052] [2022-12-13 11:52:44,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:44,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:52:44,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:44,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:52:44,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:52:44,883 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 11:52:44,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:52:44,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:44,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 11:52:44,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:45,230 INFO L130 PetriNetUnfolder]: 3616/5747 cut-off events. [2022-12-13 11:52:45,230 INFO L131 PetriNetUnfolder]: For 3953/4092 co-relation queries the response was YES. [2022-12-13 11:52:45,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14107 conditions, 5747 events. 3616/5747 cut-off events. For 3953/4092 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 34487 event pairs, 1013 based on Foata normal form. 109/4133 useless extension candidates. Maximal degree in co-relation 14089. Up to 5383 conditions per place. [2022-12-13 11:52:45,256 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 44 selfloop transitions, 10 changer transitions 0/69 dead transitions. [2022-12-13 11:52:45,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 419 flow [2022-12-13 11:52:45,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:52:45,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:52:45,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 11:52:45,257 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7070707070707071 [2022-12-13 11:52:45,257 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 223 flow. Second operand 3 states and 70 transitions. [2022-12-13 11:52:45,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 419 flow [2022-12-13 11:52:45,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 417 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 11:52:45,261 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 289 flow [2022-12-13 11:52:45,261 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2022-12-13 11:52:45,261 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -23 predicate places. [2022-12-13 11:52:45,262 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:45,262 INFO L89 Accepts]: Start accepts. Operand has 55 places, 54 transitions, 289 flow [2022-12-13 11:52:45,262 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:45,262 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:45,262 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 54 transitions, 289 flow [2022-12-13 11:52:45,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 289 flow [2022-12-13 11:52:45,333 INFO L130 PetriNetUnfolder]: 816/1722 cut-off events. [2022-12-13 11:52:45,333 INFO L131 PetriNetUnfolder]: For 562/604 co-relation queries the response was YES. [2022-12-13 11:52:45,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3709 conditions, 1722 events. 816/1722 cut-off events. For 562/604 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 13825 event pairs, 382 based on Foata normal form. 3/946 useless extension candidates. Maximal degree in co-relation 3691. Up to 1267 conditions per place. [2022-12-13 11:52:45,345 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 54 transitions, 289 flow [2022-12-13 11:52:45,345 INFO L226 LiptonReduction]: Number of co-enabled transitions 974 [2022-12-13 11:52:45,355 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:45,356 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 11:52:45,356 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 289 flow [2022-12-13 11:52:45,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:52:45,356 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:45,356 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:52:45,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:52:45,357 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:52:45,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:45,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1095923880, now seen corresponding path program 1 times [2022-12-13 11:52:45,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:45,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414791505] [2022-12-13 11:52:45,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:45,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:45,458 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:52:45,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:45,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414791505] [2022-12-13 11:52:45,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414791505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:45,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:45,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:52:45,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057776908] [2022-12-13 11:52:45,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:45,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:52:45,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:45,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:52:45,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:52:45,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 11:52:45,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 289 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:45,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:45,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 11:52:45,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:45,733 INFO L130 PetriNetUnfolder]: 1745/3223 cut-off events. [2022-12-13 11:52:45,733 INFO L131 PetriNetUnfolder]: For 2127/2156 co-relation queries the response was YES. [2022-12-13 11:52:45,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9876 conditions, 3223 events. 1745/3223 cut-off events. For 2127/2156 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20874 event pairs, 252 based on Foata normal form. 251/2517 useless extension candidates. Maximal degree in co-relation 9855. Up to 2179 conditions per place. [2022-12-13 11:52:45,748 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 55 selfloop transitions, 19 changer transitions 0/89 dead transitions. [2022-12-13 11:52:45,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 89 transitions, 591 flow [2022-12-13 11:52:45,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:52:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:52:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-12-13 11:52:45,750 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2022-12-13 11:52:45,750 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 289 flow. Second operand 4 states and 96 transitions. [2022-12-13 11:52:45,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 89 transitions, 591 flow [2022-12-13 11:52:45,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 89 transitions, 581 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:52:45,756 INFO L231 Difference]: Finished difference. Result has 58 places, 63 transitions, 391 flow [2022-12-13 11:52:45,756 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=58, PETRI_TRANSITIONS=63} [2022-12-13 11:52:45,757 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -20 predicate places. [2022-12-13 11:52:45,758 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:45,758 INFO L89 Accepts]: Start accepts. Operand has 58 places, 63 transitions, 391 flow [2022-12-13 11:52:45,758 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:45,759 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:45,759 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 63 transitions, 391 flow [2022-12-13 11:52:45,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 63 transitions, 391 flow [2022-12-13 11:52:45,809 INFO L130 PetriNetUnfolder]: 432/1149 cut-off events. [2022-12-13 11:52:45,809 INFO L131 PetriNetUnfolder]: For 478/652 co-relation queries the response was YES. [2022-12-13 11:52:45,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3480 conditions, 1149 events. 432/1149 cut-off events. For 478/652 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 9247 event pairs, 76 based on Foata normal form. 12/672 useless extension candidates. Maximal degree in co-relation 3460. Up to 841 conditions per place. [2022-12-13 11:52:45,818 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 63 transitions, 391 flow [2022-12-13 11:52:45,818 INFO L226 LiptonReduction]: Number of co-enabled transitions 972 [2022-12-13 11:52:45,825 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:45,826 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-13 11:52:45,826 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 63 transitions, 391 flow [2022-12-13 11:52:45,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:45,826 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:45,826 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:52:45,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:52:45,826 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:52:45,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:45,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1896419106, now seen corresponding path program 1 times [2022-12-13 11:52:45,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:45,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506828705] [2022-12-13 11:52:45,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:45,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:45,983 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:52:45,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:45,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506828705] [2022-12-13 11:52:45,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506828705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:45,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:45,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:52:45,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458150956] [2022-12-13 11:52:45,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:45,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:52:45,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:45,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:52:45,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:52:45,986 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 11:52:45,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:52:45,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:45,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 11:52:45,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:46,287 INFO L130 PetriNetUnfolder]: 2357/4325 cut-off events. [2022-12-13 11:52:46,287 INFO L131 PetriNetUnfolder]: For 5761/6254 co-relation queries the response was YES. [2022-12-13 11:52:46,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15749 conditions, 4325 events. 2357/4325 cut-off events. For 5761/6254 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 29400 event pairs, 604 based on Foata normal form. 355/3985 useless extension candidates. Maximal degree in co-relation 15726. Up to 2228 conditions per place. [2022-12-13 11:52:46,304 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 62 selfloop transitions, 9 changer transitions 13/98 dead transitions. [2022-12-13 11:52:46,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 98 transitions, 732 flow [2022-12-13 11:52:46,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:52:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:52:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 11:52:46,305 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6439393939393939 [2022-12-13 11:52:46,305 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 391 flow. Second operand 4 states and 85 transitions. [2022-12-13 11:52:46,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 98 transitions, 732 flow [2022-12-13 11:52:46,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 98 transitions, 670 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:46,312 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 350 flow [2022-12-13 11:52:46,313 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=350, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2022-12-13 11:52:46,313 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -18 predicate places. [2022-12-13 11:52:46,313 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:46,313 INFO L89 Accepts]: Start accepts. Operand has 60 places, 60 transitions, 350 flow [2022-12-13 11:52:46,314 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:46,314 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:46,314 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 60 transitions, 350 flow [2022-12-13 11:52:46,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 60 transitions, 350 flow [2022-12-13 11:52:46,371 INFO L130 PetriNetUnfolder]: 570/1386 cut-off events. [2022-12-13 11:52:46,371 INFO L131 PetriNetUnfolder]: For 858/912 co-relation queries the response was YES. [2022-12-13 11:52:46,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3708 conditions, 1386 events. 570/1386 cut-off events. For 858/912 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 11150 event pairs, 104 based on Foata normal form. 13/774 useless extension candidates. Maximal degree in co-relation 3687. Up to 1027 conditions per place. [2022-12-13 11:52:46,379 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 60 transitions, 350 flow [2022-12-13 11:52:46,380 INFO L226 LiptonReduction]: Number of co-enabled transitions 872 [2022-12-13 11:52:46,390 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:46,390 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-13 11:52:46,391 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 350 flow [2022-12-13 11:52:46,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:52:46,391 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:46,391 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:52:46,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:52:46,391 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:52:46,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:46,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1282279666, now seen corresponding path program 1 times [2022-12-13 11:52:46,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:46,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076373566] [2022-12-13 11:52:46,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:46,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:46,528 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:52:46,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:46,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076373566] [2022-12-13 11:52:46,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076373566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:46,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:46,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:52:46,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629054936] [2022-12-13 11:52:46,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:46,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:52:46,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:46,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:52:46,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:52:46,530 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2022-12-13 11:52:46,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 350 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:52:46,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:46,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2022-12-13 11:52:46,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:46,927 INFO L130 PetriNetUnfolder]: 2938/5550 cut-off events. [2022-12-13 11:52:46,927 INFO L131 PetriNetUnfolder]: For 6516/6992 co-relation queries the response was YES. [2022-12-13 11:52:46,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18095 conditions, 5550 events. 2938/5550 cut-off events. For 6516/6992 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 42948 event pairs, 743 based on Foata normal form. 353/4889 useless extension candidates. Maximal degree in co-relation 18071. Up to 2887 conditions per place. [2022-12-13 11:52:46,945 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 60 selfloop transitions, 2 changer transitions 20/102 dead transitions. [2022-12-13 11:52:46,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 102 transitions, 720 flow [2022-12-13 11:52:46,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:52:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:52:46,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-13 11:52:46,946 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 11:52:46,946 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 350 flow. Second operand 4 states and 88 transitions. [2022-12-13 11:52:46,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 102 transitions, 720 flow [2022-12-13 11:52:46,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 102 transitions, 684 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 11:52:46,954 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 328 flow [2022-12-13 11:52:46,954 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=328, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2022-12-13 11:52:46,954 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -16 predicate places. [2022-12-13 11:52:46,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:46,954 INFO L89 Accepts]: Start accepts. Operand has 62 places, 60 transitions, 328 flow [2022-12-13 11:52:46,955 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:46,955 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:46,955 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 60 transitions, 328 flow [2022-12-13 11:52:46,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 60 transitions, 328 flow [2022-12-13 11:52:47,067 INFO L130 PetriNetUnfolder]: 1063/2387 cut-off events. [2022-12-13 11:52:47,068 INFO L131 PetriNetUnfolder]: For 1485/1622 co-relation queries the response was YES. [2022-12-13 11:52:47,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6414 conditions, 2387 events. 1063/2387 cut-off events. For 1485/1622 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 20917 event pairs, 203 based on Foata normal form. 17/1305 useless extension candidates. Maximal degree in co-relation 6393. Up to 1837 conditions per place. [2022-12-13 11:52:47,080 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 60 transitions, 328 flow [2022-12-13 11:52:47,080 INFO L226 LiptonReduction]: Number of co-enabled transitions 870 [2022-12-13 11:52:47,147 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:52:47,148 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-13 11:52:47,149 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 334 flow [2022-12-13 11:52:47,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:52:47,149 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:47,150 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:52:47,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:52:47,150 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:52:47,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:47,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1548438354, now seen corresponding path program 2 times [2022-12-13 11:52:47,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:47,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170936694] [2022-12-13 11:52:47,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:47,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:47,317 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:52:47,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:47,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170936694] [2022-12-13 11:52:47,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170936694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:47,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:47,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:52:47,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79967734] [2022-12-13 11:52:47,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:47,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:52:47,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:47,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:52:47,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:52:47,318 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 11:52:47,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 334 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:52:47,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:47,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 11:52:47,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:47,569 INFO L130 PetriNetUnfolder]: 1730/3366 cut-off events. [2022-12-13 11:52:47,570 INFO L131 PetriNetUnfolder]: For 2086/2103 co-relation queries the response was YES. [2022-12-13 11:52:47,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10942 conditions, 3366 events. 1730/3366 cut-off events. For 2086/2103 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 23881 event pairs, 137 based on Foata normal form. 449/2538 useless extension candidates. Maximal degree in co-relation 10918. Up to 1558 conditions per place. [2022-12-13 11:52:47,580 INFO L137 encePairwiseOnDemand]: 24/35 looper letters, 32 selfloop transitions, 28 changer transitions 19/86 dead transitions. [2022-12-13 11:52:47,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 86 transitions, 608 flow [2022-12-13 11:52:47,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:52:47,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:52:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2022-12-13 11:52:47,581 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6114285714285714 [2022-12-13 11:52:47,581 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 334 flow. Second operand 5 states and 107 transitions. [2022-12-13 11:52:47,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 86 transitions, 608 flow [2022-12-13 11:52:47,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 86 transitions, 589 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 11:52:47,587 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 314 flow [2022-12-13 11:52:47,588 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=314, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2022-12-13 11:52:47,588 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -14 predicate places. [2022-12-13 11:52:47,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:47,588 INFO L89 Accepts]: Start accepts. Operand has 64 places, 50 transitions, 314 flow [2022-12-13 11:52:47,589 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:47,589 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:47,589 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 50 transitions, 314 flow [2022-12-13 11:52:47,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 50 transitions, 314 flow [2022-12-13 11:52:47,601 INFO L130 PetriNetUnfolder]: 90/270 cut-off events. [2022-12-13 11:52:47,601 INFO L131 PetriNetUnfolder]: For 213/390 co-relation queries the response was YES. [2022-12-13 11:52:47,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 270 events. 90/270 cut-off events. For 213/390 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 955. Up to 181 conditions per place. [2022-12-13 11:52:47,603 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 50 transitions, 314 flow [2022-12-13 11:52:47,603 INFO L226 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-13 11:52:48,590 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 11:52:48,591 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1003 [2022-12-13 11:52:48,591 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 298 flow [2022-12-13 11:52:48,591 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:52:48,591 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:48,591 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:52:48,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:52:48,592 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:52:48,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:48,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1149348066, now seen corresponding path program 1 times [2022-12-13 11:52:48,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:48,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669940998] [2022-12-13 11:52:48,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:48,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:49,045 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:52:49,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:49,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669940998] [2022-12-13 11:52:49,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669940998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:49,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:49,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:52:49,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867203988] [2022-12-13 11:52:49,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:49,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:52:49,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:49,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:52:49,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:52:49,046 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 26 [2022-12-13 11:52:49,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 298 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:52:49,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:49,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 26 [2022-12-13 11:52:49,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:49,261 INFO L130 PetriNetUnfolder]: 397/738 cut-off events. [2022-12-13 11:52:49,261 INFO L131 PetriNetUnfolder]: For 1570/1640 co-relation queries the response was YES. [2022-12-13 11:52:49,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3146 conditions, 738 events. 397/738 cut-off events. For 1570/1640 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3697 event pairs, 18 based on Foata normal form. 64/621 useless extension candidates. Maximal degree in co-relation 3122. Up to 436 conditions per place. [2022-12-13 11:52:49,265 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 42 selfloop transitions, 5 changer transitions 31/89 dead transitions. [2022-12-13 11:52:49,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 89 transitions, 719 flow [2022-12-13 11:52:49,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:52:49,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 11:52:49,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2022-12-13 11:52:49,267 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5048076923076923 [2022-12-13 11:52:49,267 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 298 flow. Second operand 8 states and 105 transitions. [2022-12-13 11:52:49,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 89 transitions, 719 flow [2022-12-13 11:52:49,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 89 transitions, 554 flow, removed 36 selfloop flow, removed 12 redundant places. [2022-12-13 11:52:49,272 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 212 flow [2022-12-13 11:52:49,273 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=212, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 11:52:49,273 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -27 predicate places. [2022-12-13 11:52:49,273 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:49,273 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 212 flow [2022-12-13 11:52:49,274 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:49,274 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:49,274 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 212 flow [2022-12-13 11:52:49,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 42 transitions, 212 flow [2022-12-13 11:52:49,286 INFO L130 PetriNetUnfolder]: 90/207 cut-off events. [2022-12-13 11:52:49,286 INFO L131 PetriNetUnfolder]: For 322/325 co-relation queries the response was YES. [2022-12-13 11:52:49,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 207 events. 90/207 cut-off events. For 322/325 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 942 event pairs, 0 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 629. Up to 109 conditions per place. [2022-12-13 11:52:49,288 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 42 transitions, 212 flow [2022-12-13 11:52:49,288 INFO L226 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-13 11:52:49,313 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [510] $Ultimate##0-->L760: Formula: (and (= v_~a$w_buff0_used~0_391 v_~a$w_buff1_used~0_333) (= v_~a$r_buff0_thd2~0_151 v_~a$r_buff1_thd2~0_153) (= v_~a$w_buff0_used~0_390 1) (= v_~a$w_buff0~0_213 1) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_44| 0)) (= v_~x~0_132 1) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_44| (ite (not (and (not (= (mod v_~a$w_buff0_used~0_390 256) 0)) (not (= (mod v_~a$w_buff1_used~0_333 256) 0)))) 1 0)) (= v_~a$r_buff0_thd0~0_102 v_~a$r_buff1_thd0~0_108) (= v_~a$r_buff0_thd1~0_140 1) (= v_~a$r_buff0_thd1~0_141 v_~a$r_buff1_thd1~0_94) (= |v_P0Thread1of1ForFork1_~arg#1.offset_38| |v_P0Thread1of1ForFork1_#in~arg#1.offset_38|) (= v_~a$r_buff0_thd3~0_176 v_~a$r_buff1_thd3~0_176) (= v_~a$w_buff0~0_214 v_~a$w_buff1~0_185) (= |v_P0Thread1of1ForFork1_~arg#1.base_38| |v_P0Thread1of1ForFork1_#in~arg#1.base_38|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_44| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_44|)) InVars {P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_38|, ~a$w_buff0~0=v_~a$w_buff0~0_214, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_151, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_176, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_391, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_141, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_38|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_102} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_38|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_94, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_176, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_153, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_151, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_176, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_390, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_140, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_38|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_102, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_38|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_38|, ~a$w_buff1~0=v_~a$w_buff1~0_185, ~a$w_buff0~0=v_~a$w_buff0~0_213, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_44|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_108, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_333, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_44|, ~x~0=v_~x~0_132} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x~0] and [509] $Ultimate##0-->L780: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg.base_19| v_P1Thread1of1ForFork2_~arg.base_19) (= 2 v_~x~0_130) (= |v_P1Thread1of1ForFork2_#in~arg.offset_19| v_P1Thread1of1ForFork2_~arg.offset_19) (= v_~y~0_47 v_~__unbuffered_p1_EAX~0_102)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~y~0=v_~y~0_47} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_19, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_102, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~y~0=v_~y~0_47, ~x~0=v_~x~0_130} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EAX~0, ~x~0] [2022-12-13 11:52:50,191 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L760-->L770: Formula: (let ((.cse1 (not (= (mod v_~a$w_buff0_used~0_471 256) 0))) (.cse2 (not (= (mod v_~a$r_buff1_thd1~0_133 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_186 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_472 256) 0)))) (.cse4 (and (not (= (mod v_~a$w_buff1_used~0_408 256) 0)) .cse2)) (.cse0 (and .cse5 .cse1))) (and (= v_~a$r_buff0_thd1~0_185 (ite .cse0 0 v_~a$r_buff0_thd1~0_186)) (= (ite (or (and .cse1 (not (= (mod v_~a$r_buff0_thd1~0_185 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_407 256) 0)) .cse2)) 0 v_~a$r_buff1_thd1~0_133) v_~a$r_buff1_thd1~0_132) (= v_~a~0_338 (ite .cse3 v_~a$w_buff0~0_261 (ite .cse4 v_~a$w_buff1~0_226 v_~a~0_339))) (= (ite .cse3 0 v_~a$w_buff0_used~0_472) v_~a$w_buff0_used~0_471) (= v_~__unbuffered_cnt~0_473 (+ v_~__unbuffered_cnt~0_474 1)) (= (ite (or .cse4 .cse0) 0 v_~a$w_buff1_used~0_408) v_~a$w_buff1_used~0_407)))) InVars {~a~0=v_~a~0_339, ~a$w_buff1~0=v_~a$w_buff1~0_226, ~a$w_buff0~0=v_~a$w_buff0~0_261, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_133, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_472, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_474, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_186, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_408} OutVars{~a~0=v_~a~0_338, ~a$w_buff1~0=v_~a$w_buff1~0_226, ~a$w_buff0~0=v_~a$w_buff0~0_261, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_132, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_471, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_473, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_185, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_407} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~__unbuffered_cnt~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0] and [514] L848-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_424 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd0~0_115 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_109 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_425 256) 0)))) (.cse0 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_366 256) 0)))) (.cse1 (and .cse5 .cse3))) (and (= v_~main$tmp_guard1~0_100 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_106 0) (= v_~__unbuffered_p2_EBX~0_121 0) (= v_~__unbuffered_p2_EAX~0_108 1) (= 2 v_~x~0_136))) 1 0) 0) 0 1)) (= v_~main$tmp_guard0~0_98 (ite (= (ite (= v_~__unbuffered_cnt~0_471 3) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_71| 0)) (= (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_366) v_~a$w_buff1_used~0_365) (= (mod v_~main$tmp_guard0~0_98 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|) (= (ite .cse2 0 v_~a$w_buff0_used~0_425) v_~a$w_buff0_used~0_424) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_71| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_89| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_83| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_89|) (= (ite (or (and .cse3 (not (= (mod v_~a$r_buff0_thd0~0_108 256) 0))) (and (not (= 0 (mod v_~a$w_buff1_used~0_365 256))) .cse4)) 0 v_~a$r_buff1_thd0~0_115) v_~a$r_buff1_thd0~0_114) (= v_~a~0_298 (ite .cse2 v_~a$w_buff0~0_235 (ite .cse0 v_~a$w_buff1~0_205 v_~a~0_299))) (= (mod v_~main$tmp_guard1~0_100 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_83|) (= v_~a$r_buff0_thd0~0_108 (ite .cse1 0 v_~a$r_buff0_thd0~0_109))))) InVars {~a~0=v_~a~0_299, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_121, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, ~a$w_buff1~0=v_~a$w_buff1~0_205, ~a$w_buff0~0=v_~a$w_buff0~0_235, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_115, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_425, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_471, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_109, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_366, ~x~0=v_~x~0_136} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_89|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_121, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_79|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_93|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_424, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_100, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_108, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_98, ~a~0=v_~a~0_298, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_83|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, ~a$w_buff1~0=v_~a$w_buff1~0_205, ~a$w_buff0~0=v_~a$w_buff0~0_235, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_71|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_114, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_471, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_365, ~x~0=v_~x~0_136, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:52:50,500 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [517] L760-->P0EXIT: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_475 256) 0))) (.cse4 (not (= 0 (mod v_~a$r_buff1_thd1~0_137 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_190 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_476 256) 0)) .cse5)) (.cse0 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_412 256) 0)))) (.cse1 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_412) v_~a$w_buff1_used~0_411) (= v_~__unbuffered_cnt~0_477 (+ v_~__unbuffered_cnt~0_478 1)) (= (ite .cse2 0 v_~a$w_buff0_used~0_476) v_~a$w_buff0_used~0_475) (= (ite .cse2 v_~a$w_buff0~0_263 (ite .cse0 v_~a$w_buff1~0_228 v_~a~0_343)) v_~a~0_342) (= |v_P0Thread1of1ForFork1_#res#1.offset_65| 0) (= |v_P0Thread1of1ForFork1_#res#1.base_65| 0) (= v_~a$r_buff0_thd1~0_189 (ite .cse1 0 v_~a$r_buff0_thd1~0_190)) (= v_~a$r_buff1_thd1~0_136 (ite (or (and .cse3 (not (= 0 (mod v_~a$r_buff0_thd1~0_189 256)))) (and .cse4 (not (= (mod v_~a$w_buff1_used~0_411 256) 0)))) 0 v_~a$r_buff1_thd1~0_137))))) InVars {~a~0=v_~a~0_343, ~a$w_buff1~0=v_~a$w_buff1~0_228, ~a$w_buff0~0=v_~a$w_buff0~0_263, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_137, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_476, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_478, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_190, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_412} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_65|, ~a~0=v_~a~0_342, ~a$w_buff1~0=v_~a$w_buff1~0_228, ~a$w_buff0~0=v_~a$w_buff0~0_263, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_136, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_65|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_475, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_477, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_189, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_411} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, ~a~0, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res#1.base, ~a$w_buff0_used~0, ~__unbuffered_cnt~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0] and [514] L848-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_424 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd0~0_115 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_109 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_425 256) 0)))) (.cse0 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_366 256) 0)))) (.cse1 (and .cse5 .cse3))) (and (= v_~main$tmp_guard1~0_100 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_106 0) (= v_~__unbuffered_p2_EBX~0_121 0) (= v_~__unbuffered_p2_EAX~0_108 1) (= 2 v_~x~0_136))) 1 0) 0) 0 1)) (= v_~main$tmp_guard0~0_98 (ite (= (ite (= v_~__unbuffered_cnt~0_471 3) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_71| 0)) (= (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_366) v_~a$w_buff1_used~0_365) (= (mod v_~main$tmp_guard0~0_98 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|) (= (ite .cse2 0 v_~a$w_buff0_used~0_425) v_~a$w_buff0_used~0_424) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_71| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_89| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_83| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_89|) (= (ite (or (and .cse3 (not (= (mod v_~a$r_buff0_thd0~0_108 256) 0))) (and (not (= 0 (mod v_~a$w_buff1_used~0_365 256))) .cse4)) 0 v_~a$r_buff1_thd0~0_115) v_~a$r_buff1_thd0~0_114) (= v_~a~0_298 (ite .cse2 v_~a$w_buff0~0_235 (ite .cse0 v_~a$w_buff1~0_205 v_~a~0_299))) (= (mod v_~main$tmp_guard1~0_100 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_83|) (= v_~a$r_buff0_thd0~0_108 (ite .cse1 0 v_~a$r_buff0_thd0~0_109))))) InVars {~a~0=v_~a~0_299, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_121, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, ~a$w_buff1~0=v_~a$w_buff1~0_205, ~a$w_buff0~0=v_~a$w_buff0~0_235, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_115, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_425, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_471, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_109, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_366, ~x~0=v_~x~0_136} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_89|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_121, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_79|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_93|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_424, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_100, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_108, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_98, ~a~0=v_~a~0_298, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_83|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, ~a$w_buff1~0=v_~a$w_buff1~0_205, ~a$w_buff0~0=v_~a$w_buff0~0_235, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_71|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_114, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_471, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_365, ~x~0=v_~x~0_136, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:52:50,811 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [518] L760-->P0FINAL: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_479 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_194 256) 0))) (.cse4 (not (= 0 (mod v_~a$r_buff1_thd1~0_141 256))))) (let ((.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_416 256) 0)))) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_480 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5))) (and (= v_~__unbuffered_cnt~0_481 (+ v_~__unbuffered_cnt~0_482 1)) (= (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_416) v_~a$w_buff1_used~0_415) (= v_~a~0_346 (ite .cse2 v_~a$w_buff0~0_265 (ite .cse1 v_~a$w_buff1~0_230 v_~a~0_347))) (= v_~a$w_buff0_used~0_479 (ite .cse2 0 v_~a$w_buff0_used~0_480)) (= (ite (or (and (not (= 0 (mod v_~a$r_buff0_thd1~0_193 256))) .cse3) (and (not (= (mod v_~a$w_buff1_used~0_415 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_141) v_~a$r_buff1_thd1~0_140) (= |v_P0Thread1of1ForFork1_#res#1.offset_67| 0) (= |v_P0Thread1of1ForFork1_#res#1.base_67| 0) (= (ite .cse0 0 v_~a$r_buff0_thd1~0_194) v_~a$r_buff0_thd1~0_193)))) InVars {~a~0=v_~a~0_347, ~a$w_buff1~0=v_~a$w_buff1~0_230, ~a$w_buff0~0=v_~a$w_buff0~0_265, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_141, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_480, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_482, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_194, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_416} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_67|, ~a~0=v_~a~0_346, ~a$w_buff1~0=v_~a$w_buff1~0_230, ~a$w_buff0~0=v_~a$w_buff0~0_265, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_140, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_67|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_479, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_481, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_193, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_415} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, ~a~0, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res#1.base, ~a$w_buff0_used~0, ~__unbuffered_cnt~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0] and [514] L848-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_424 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd0~0_115 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_109 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_425 256) 0)))) (.cse0 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_366 256) 0)))) (.cse1 (and .cse5 .cse3))) (and (= v_~main$tmp_guard1~0_100 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_106 0) (= v_~__unbuffered_p2_EBX~0_121 0) (= v_~__unbuffered_p2_EAX~0_108 1) (= 2 v_~x~0_136))) 1 0) 0) 0 1)) (= v_~main$tmp_guard0~0_98 (ite (= (ite (= v_~__unbuffered_cnt~0_471 3) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_71| 0)) (= (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_366) v_~a$w_buff1_used~0_365) (= (mod v_~main$tmp_guard0~0_98 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|) (= (ite .cse2 0 v_~a$w_buff0_used~0_425) v_~a$w_buff0_used~0_424) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_71| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_89| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_83| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_89|) (= (ite (or (and .cse3 (not (= (mod v_~a$r_buff0_thd0~0_108 256) 0))) (and (not (= 0 (mod v_~a$w_buff1_used~0_365 256))) .cse4)) 0 v_~a$r_buff1_thd0~0_115) v_~a$r_buff1_thd0~0_114) (= v_~a~0_298 (ite .cse2 v_~a$w_buff0~0_235 (ite .cse0 v_~a$w_buff1~0_205 v_~a~0_299))) (= (mod v_~main$tmp_guard1~0_100 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_83|) (= v_~a$r_buff0_thd0~0_108 (ite .cse1 0 v_~a$r_buff0_thd0~0_109))))) InVars {~a~0=v_~a~0_299, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_121, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, ~a$w_buff1~0=v_~a$w_buff1~0_205, ~a$w_buff0~0=v_~a$w_buff0~0_235, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_115, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_425, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_471, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_109, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_366, ~x~0=v_~x~0_136} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_89|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_121, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_79|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_93|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_424, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_100, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_108, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_98, ~a~0=v_~a~0_298, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_83|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, ~a$w_buff1~0=v_~a$w_buff1~0_205, ~a$w_buff0~0=v_~a$w_buff0~0_235, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_71|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_114, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_471, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_365, ~x~0=v_~x~0_136, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:52:51,194 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:52:51,195 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1922 [2022-12-13 11:52:51,195 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 230 flow [2022-12-13 11:52:51,195 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:52:51,195 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:51,195 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:51,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:52:51,196 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:52:51,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:51,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1593866054, now seen corresponding path program 1 times [2022-12-13 11:52:51,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:51,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228519616] [2022-12-13 11:52:51,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:51,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:52:51,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:52:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:52:51,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:52:51,297 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:52:51,298 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 11:52:51,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 11:52:51,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 11:52:51,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 11:52:51,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 11:52:51,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 11:52:51,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:52:51,299 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:51,305 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:52:51,305 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:52:51,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:52:51 BasicIcfg [2022-12-13 11:52:51,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:52:51,364 INFO L158 Benchmark]: Toolchain (without parser) took 15811.84ms. Allocated memory was 190.8MB in the beginning and 740.3MB in the end (delta: 549.5MB). Free memory was 164.4MB in the beginning and 305.0MB in the end (delta: -140.6MB). Peak memory consumption was 409.4MB. Max. memory is 8.0GB. [2022-12-13 11:52:51,364 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory was 167.1MB in the beginning and 167.1MB in the end (delta: 92.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:52:51,365 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.11ms. Allocated memory is still 190.8MB. Free memory was 164.4MB in the beginning and 137.4MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 11:52:51,365 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.12ms. Allocated memory is still 190.8MB. Free memory was 137.4MB in the beginning and 135.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:52:51,365 INFO L158 Benchmark]: Boogie Preprocessor took 24.32ms. Allocated memory is still 190.8MB. Free memory was 135.0MB in the beginning and 132.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:52:51,365 INFO L158 Benchmark]: RCFGBuilder took 583.59ms. Allocated memory is still 190.8MB. Free memory was 132.9MB in the beginning and 144.8MB in the end (delta: -12.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-13 11:52:51,365 INFO L158 Benchmark]: TraceAbstraction took 14759.32ms. Allocated memory was 190.8MB in the beginning and 740.3MB in the end (delta: 549.5MB). Free memory was 143.8MB in the beginning and 305.0MB in the end (delta: -161.2MB). Peak memory consumption was 388.8MB. Max. memory is 8.0GB. [2022-12-13 11:52:51,366 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory was 167.1MB in the beginning and 167.1MB in the end (delta: 92.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 404.11ms. Allocated memory is still 190.8MB. Free memory was 164.4MB in the beginning and 137.4MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.12ms. Allocated memory is still 190.8MB. Free memory was 137.4MB in the beginning and 135.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.32ms. Allocated memory is still 190.8MB. Free memory was 135.0MB in the beginning and 132.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 583.59ms. Allocated memory is still 190.8MB. Free memory was 132.9MB in the beginning and 144.8MB in the end (delta: -12.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 14759.32ms. Allocated memory was 190.8MB in the beginning and 740.3MB in the end (delta: 549.5MB). Free memory was 143.8MB in the beginning and 305.0MB in the end (delta: -161.2MB). Peak memory consumption was 388.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 117 PlacesBefore, 78 PlacesAfterwards, 109 TransitionsBefore, 69 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 43 ConcurrentYvCompositions, 3 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4453, independent: 4320, independent conditional: 4320, independent unconditional: 0, dependent: 133, dependent conditional: 133, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4453, independent: 4320, independent conditional: 0, independent unconditional: 4320, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4453, independent: 4320, independent conditional: 0, independent unconditional: 4320, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4453, independent: 4320, independent conditional: 0, independent unconditional: 4320, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2217, independent: 2175, independent conditional: 0, independent unconditional: 2175, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2217, independent: 2146, independent conditional: 0, independent unconditional: 2146, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 207, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4453, independent: 2145, independent conditional: 0, independent unconditional: 2145, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 2217, unknown conditional: 0, unknown unconditional: 2217] , Statistics on independence cache: Total cache size (in pairs): 4387, Positive cache size: 4345, Positive conditional cache size: 0, Positive unconditional cache size: 4345, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 324, independent: 286, independent conditional: 286, 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: 324, independent: 286, independent conditional: 23, independent unconditional: 263, dependent: 38, dependent conditional: 7, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 324, independent: 286, independent conditional: 23, independent unconditional: 263, dependent: 38, dependent conditional: 7, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 324, independent: 286, independent conditional: 23, independent unconditional: 263, dependent: 38, dependent conditional: 7, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 276, independent: 248, independent conditional: 21, independent unconditional: 227, dependent: 28, dependent conditional: 5, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 276, independent: 217, independent conditional: 0, independent unconditional: 217, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 28, dependent conditional: 5, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 112, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 91, dependent conditional: 23, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 324, independent: 38, independent conditional: 2, independent unconditional: 36, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 276, unknown conditional: 26, unknown unconditional: 250] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 248, Positive conditional cache size: 21, Positive unconditional cache size: 227, Negative cache size: 28, Negative conditional cache size: 5, Negative unconditional cache size: 23, 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, 45 PlacesBefore, 45 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 750 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 268, independent: 241, independent conditional: 241, 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: 268, independent: 241, independent conditional: 27, independent unconditional: 214, 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: 268, independent: 241, independent conditional: 0, independent unconditional: 241, 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: 268, independent: 241, independent conditional: 0, independent unconditional: 241, 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: 33, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 33, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 268, independent: 213, independent conditional: 0, independent unconditional: 213, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 33, unknown conditional: 0, unknown unconditional: 33] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 276, Positive conditional cache size: 21, Positive unconditional cache size: 255, Negative cache size: 33, Negative conditional cache size: 5, Negative unconditional cache size: 28, 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, 48 PlacesBefore, 48 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 748 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 273, independent: 241, independent conditional: 241, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 273, independent: 241, independent conditional: 13, independent unconditional: 228, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 273, independent: 241, independent conditional: 0, independent unconditional: 241, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 273, independent: 241, independent conditional: 0, independent unconditional: 241, dependent: 32, dependent conditional: 0, dependent unconditional: 32, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 273, independent: 239, independent conditional: 0, independent unconditional: 239, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 312, Positive cache size: 278, Positive conditional cache size: 21, Positive unconditional cache size: 257, Negative cache size: 34, Negative conditional cache size: 5, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 800 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 305, independent: 270, independent conditional: 270, 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: 305, independent: 270, independent conditional: 42, independent unconditional: 228, 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: 305, independent: 270, independent conditional: 0, independent unconditional: 270, 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: 305, independent: 270, independent conditional: 0, independent unconditional: 270, 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: 305, independent: 270, independent conditional: 0, independent unconditional: 270, 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): 312, Positive cache size: 278, Positive conditional cache size: 21, Positive unconditional cache size: 257, Negative cache size: 34, Negative conditional cache size: 5, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 974 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 200, independent: 167, independent conditional: 167, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 200, independent: 167, independent conditional: 32, independent unconditional: 135, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 200, independent: 167, independent conditional: 9, independent unconditional: 158, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 200, independent: 167, independent conditional: 9, independent unconditional: 158, dependent: 33, dependent conditional: 0, dependent unconditional: 33, 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: 200, independent: 167, independent conditional: 9, independent unconditional: 158, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 312, Positive cache size: 278, Positive conditional cache size: 21, Positive unconditional cache size: 257, Negative cache size: 34, Negative conditional cache size: 5, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 972 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 283, independent: 240, independent conditional: 240, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 283, independent: 240, independent conditional: 35, independent unconditional: 205, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 283, independent: 240, independent conditional: 9, independent unconditional: 231, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 283, independent: 240, independent conditional: 9, independent unconditional: 231, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 283, independent: 232, independent conditional: 9, independent unconditional: 223, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 320, Positive cache size: 286, Positive conditional cache size: 21, Positive unconditional cache size: 265, Negative cache size: 34, Negative conditional cache size: 5, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 872 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 334, independent: 293, independent conditional: 293, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 334, independent: 293, independent conditional: 84, independent unconditional: 209, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 334, independent: 293, independent conditional: 63, independent unconditional: 230, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 334, independent: 293, independent conditional: 63, independent unconditional: 230, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 334, independent: 291, independent conditional: 63, independent unconditional: 228, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 322, Positive cache size: 288, Positive conditional cache size: 21, Positive unconditional cache size: 267, Negative cache size: 34, Negative conditional cache size: 5, Negative unconditional cache size: 29, 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.1s, 62 PlacesBefore, 62 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 870 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 520, independent: 448, independent conditional: 448, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 520, independent: 448, independent conditional: 90, independent unconditional: 358, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 520, independent: 448, independent conditional: 54, independent unconditional: 394, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 520, independent: 448, independent conditional: 54, independent unconditional: 394, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 520, independent: 444, independent conditional: 54, independent unconditional: 390, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 326, Positive conditional cache size: 23, Positive unconditional cache size: 303, Negative cache size: 34, Negative conditional cache size: 5, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 61 PlacesBefore, 55 PlacesAfterwards, 50 TransitionsBefore, 44 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 419, independent: 357, independent conditional: 357, 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: 419, independent: 357, independent conditional: 221, independent unconditional: 136, 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: 419, independent: 357, independent conditional: 210, independent unconditional: 147, 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: 419, independent: 357, independent conditional: 210, independent unconditional: 147, 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: 28, independent: 24, independent conditional: 18, independent unconditional: 6, 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: 28, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 419, independent: 333, independent conditional: 192, independent unconditional: 141, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 28, unknown conditional: 18, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 427, Positive cache size: 389, Positive conditional cache size: 43, Positive unconditional cache size: 346, Negative cache size: 38, Negative conditional cache size: 5, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 48 PlacesBefore, 45 PlacesAfterwards, 42 TransitionsBefore, 37 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 350, independent: 310, independent conditional: 310, 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: 350, independent: 310, independent conditional: 250, 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: 356, independent: 310, independent conditional: 250, independent unconditional: 60, dependent: 46, dependent conditional: 6, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 356, independent: 310, independent conditional: 250, independent unconditional: 60, dependent: 46, dependent conditional: 6, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 47, independent: 39, independent conditional: 33, independent unconditional: 6, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 47, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, independent: 118, independent conditional: 118, independent unconditional: 0, dependent: 71, dependent conditional: 56, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 356, independent: 271, independent conditional: 217, independent unconditional: 54, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 47, unknown conditional: 39, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 697, Positive cache size: 651, Positive conditional cache size: 76, Positive unconditional cache size: 575, Negative cache size: 46, Negative conditional cache size: 11, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [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; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1001; [L844] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1001, ((void *)0), P0, ((void *)0))=-3, t1001={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1002; [L846] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1002, ((void *)0), P1, ((void *)0))=-2, t1001={5:0}, t1002={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1003; [L848] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1003, ((void *)0), P2, ((void *)0))=-1, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 [L759] 1 x = 1 [L776] 1 x = 2 [L779] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L796] 3 y = 1 [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, x=2, y=1, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, x=2, y=1, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=0, x=2, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=0, x=2, y=1, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=0, x=2, y=1, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 848]: 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: 844]: 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, 141 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.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 333 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 333 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 779 IncrementalHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 17 mSDtfsCounter, 779 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=6, InterpolantAutomatonStates: 42, 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, 762 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:52:51,402 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...