/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/safe012_pso.oepc_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:38:46,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:38:46,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:38:46,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:38:46,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:38:46,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:38:46,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:38:46,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:38:46,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:38:46,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:38:46,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:38:46,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:38:46,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:38:46,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:38:46,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:38:46,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:38:46,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:38:46,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:38:46,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:38:46,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:38:46,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:38:46,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:38:46,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:38:46,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:38:46,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:38:46,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:38:46,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:38:46,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:38:46,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:38:46,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:38:46,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:38:46,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:38:46,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:38:46,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:38:46,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:38:46,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:38:46,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:38:46,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:38:46,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:38:46,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:38:46,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:38:46,153 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:38:46,179 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:38:46,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:38:46,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:38:46,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:38:46,181 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:38:46,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:38:46,181 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:38:46,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:38:46,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:38:46,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:38:46,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:38:46,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:38:46,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:38:46,183 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:38:46,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:38:46,183 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:38:46,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:38:46,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:38:46,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:38:46,183 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:38:46,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:38:46,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:38:46,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:38:46,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:38:46,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:38:46,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:38:46,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:38:46,184 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:38:46,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:38:46,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:38:46,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:38:46,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:38:46,484 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:38:46,487 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:38:46,488 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2022-12-06 06:38:47,496 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:38:47,730 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:38:47,730 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2022-12-06 06:38:47,743 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94d37f421/04247b7bc1994cdd9dfa571073d872cc/FLAG124c92807 [2022-12-06 06:38:47,755 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94d37f421/04247b7bc1994cdd9dfa571073d872cc [2022-12-06 06:38:47,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:38:47,758 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:38:47,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:38:47,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:38:47,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:38:47,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:38:47" (1/1) ... [2022-12-06 06:38:47,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fcabfcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:47, skipping insertion in model container [2022-12-06 06:38:47,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:38:47" (1/1) ... [2022-12-06 06:38:47,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:38:47,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:38:47,921 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/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2022-12-06 06:38:48,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:38:48,147 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:38:48,157 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/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2022-12-06 06:38:48,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:48,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:48,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:38:48,248 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:38:48,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:48 WrapperNode [2022-12-06 06:38:48,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:38:48,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:38:48,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:38:48,250 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:38:48,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:48" (1/1) ... [2022-12-06 06:38:48,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:48" (1/1) ... [2022-12-06 06:38:48,312 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-06 06:38:48,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:38:48,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:38:48,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:38:48,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:38:48,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:48" (1/1) ... [2022-12-06 06:38:48,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:48" (1/1) ... [2022-12-06 06:38:48,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:48" (1/1) ... [2022-12-06 06:38:48,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:48" (1/1) ... [2022-12-06 06:38:48,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:48" (1/1) ... [2022-12-06 06:38:48,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:48" (1/1) ... [2022-12-06 06:38:48,343 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:48" (1/1) ... [2022-12-06 06:38:48,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:48" (1/1) ... [2022-12-06 06:38:48,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:38:48,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:38:48,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:38:48,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:38:48,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:48" (1/1) ... [2022-12-06 06:38:48,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:38:48,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:38:48,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:38:48,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:38:48,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:38:48,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:38:48,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:38:48,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:38:48,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:38:48,429 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:38:48,429 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:38:48,429 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:38:48,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:38:48,430 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:38:48,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:38:48,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:38:48,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:38:48,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:38:48,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:38:48,431 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:38:48,563 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:38:48,565 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:38:48,781 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:38:48,880 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:38:48,880 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:38:48,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:38:48 BoogieIcfgContainer [2022-12-06 06:38:48,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:38:48,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:38:48,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:38:48,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:38:48,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:38:47" (1/3) ... [2022-12-06 06:38:48,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7e634d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:38:48, skipping insertion in model container [2022-12-06 06:38:48,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:48" (2/3) ... [2022-12-06 06:38:48,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7e634d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:38:48, skipping insertion in model container [2022-12-06 06:38:48,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:38:48" (3/3) ... [2022-12-06 06:38:48,896 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2022-12-06 06:38:48,910 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:38:48,910 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:38:48,910 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:38:48,962 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:38:48,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 06:38:49,039 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 06:38:49,039 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:38:49,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:38:49,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 06:38:49,048 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-06 06:38:49,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:49,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 06:38:49,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-06 06:38:49,095 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 06:38:49,096 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:38:49,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:38:49,099 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 06:38:49,099 INFO L188 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-06 06:38:52,836 INFO L203 LiptonReduction]: Total number of compositions: 83 [2022-12-06 06:38:52,847 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:38:52,851 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;@51641f8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:38:52,851 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:38:52,854 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 06:38:52,854 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:38:52,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:52,854 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:38:52,855 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:52,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:52,858 INFO L85 PathProgramCache]: Analyzing trace with hash 440892574, now seen corresponding path program 1 times [2022-12-06 06:38:52,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:52,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235750500] [2022-12-06 06:38:52,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:52,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:53,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:53,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235750500] [2022-12-06 06:38:53,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235750500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:53,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:53,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:38:53,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302421353] [2022-12-06 06:38:53,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:53,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:38:53,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:53,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:38:53,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:38:53,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:38:53,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:53,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:53,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:38:53,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:53,434 INFO L130 PetriNetUnfolder]: 879/1440 cut-off events. [2022-12-06 06:38:53,434 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 06:38:53,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2807 conditions, 1440 events. 879/1440 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7244 event pairs, 144 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 2796. Up to 1060 conditions per place. [2022-12-06 06:38:53,446 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 27 selfloop transitions, 2 changer transitions 6/37 dead transitions. [2022-12-06 06:38:53,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 156 flow [2022-12-06 06:38:53,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:38:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:38:53,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 06:38:53,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-06 06:38:53,458 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 46 transitions. [2022-12-06 06:38:53,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 156 flow [2022-12-06 06:38:53,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:38:53,462 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 50 flow [2022-12-06 06:38:53,464 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2022-12-06 06:38:53,466 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-06 06:38:53,466 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:53,467 INFO L89 Accepts]: Start accepts. Operand has 32 places, 20 transitions, 50 flow [2022-12-06 06:38:53,469 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:53,469 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:53,469 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 20 transitions, 50 flow [2022-12-06 06:38:53,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-06 06:38:53,474 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 06:38:53,474 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:38:53,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:38:53,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-06 06:38:53,474 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 06:38:53,560 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:53,561 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 06:38:53,561 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-06 06:38:53,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:53,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:53,562 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:53,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:38:53,562 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:53,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:53,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2145675422, now seen corresponding path program 1 times [2022-12-06 06:38:53,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:53,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319212725] [2022-12-06 06:38:53,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:53,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:53,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:53,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319212725] [2022-12-06 06:38:53,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319212725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:53,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:53,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:38:53,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462028270] [2022-12-06 06:38:53,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:53,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:38:53,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:53,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:38:53,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:38:53,765 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:38:53,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:53,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:53,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:38:53,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:53,865 INFO L130 PetriNetUnfolder]: 556/899 cut-off events. [2022-12-06 06:38:53,866 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-12-06 06:38:53,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1865 conditions, 899 events. 556/899 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4088 event pairs, 160 based on Foata normal form. 4/902 useless extension candidates. Maximal degree in co-relation 1855. Up to 815 conditions per place. [2022-12-06 06:38:53,871 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 26 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-06 06:38:53,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 136 flow [2022-12-06 06:38:53,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:38:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:38:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 06:38:53,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 06:38:53,873 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 3 states and 36 transitions. [2022-12-06 06:38:53,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 136 flow [2022-12-06 06:38:53,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:38:53,874 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2022-12-06 06:38:53,874 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2022-12-06 06:38:53,874 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2022-12-06 06:38:53,874 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:53,874 INFO L89 Accepts]: Start accepts. Operand has 30 places, 22 transitions, 65 flow [2022-12-06 06:38:53,875 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:53,875 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:53,875 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 22 transitions, 65 flow [2022-12-06 06:38:53,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 65 flow [2022-12-06 06:38:53,879 INFO L130 PetriNetUnfolder]: 3/32 cut-off events. [2022-12-06 06:38:53,879 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:38:53,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 32 events. 3/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 61 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2022-12-06 06:38:53,880 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 65 flow [2022-12-06 06:38:53,880 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 06:38:53,936 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:53,937 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-06 06:38:53,938 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2022-12-06 06:38:53,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:53,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:53,939 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:53,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:38:53,939 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:53,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:53,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2091430240, now seen corresponding path program 1 times [2022-12-06 06:38:53,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:53,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190087944] [2022-12-06 06:38:53,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:53,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:54,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:54,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190087944] [2022-12-06 06:38:54,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190087944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:54,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:54,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:38:54,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110499228] [2022-12-06 06:38:54,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:54,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:38:54,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:54,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:38:54,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:38:54,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:38:54,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:54,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:54,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:38:54,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:54,438 INFO L130 PetriNetUnfolder]: 817/1238 cut-off events. [2022-12-06 06:38:54,438 INFO L131 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2022-12-06 06:38:54,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2767 conditions, 1238 events. 817/1238 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5396 event pairs, 93 based on Foata normal form. 20/1256 useless extension candidates. Maximal degree in co-relation 2756. Up to 673 conditions per place. [2022-12-06 06:38:54,445 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 42 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2022-12-06 06:38:54,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 51 transitions, 233 flow [2022-12-06 06:38:54,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:38:54,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:38:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-06 06:38:54,448 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-06 06:38:54,448 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 5 states and 56 transitions. [2022-12-06 06:38:54,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 51 transitions, 233 flow [2022-12-06 06:38:54,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 51 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:38:54,449 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 117 flow [2022-12-06 06:38:54,449 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2022-12-06 06:38:54,450 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2022-12-06 06:38:54,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:54,451 INFO L89 Accepts]: Start accepts. Operand has 36 places, 27 transitions, 117 flow [2022-12-06 06:38:54,452 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:54,452 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:54,452 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 27 transitions, 117 flow [2022-12-06 06:38:54,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 27 transitions, 117 flow [2022-12-06 06:38:54,461 INFO L130 PetriNetUnfolder]: 9/52 cut-off events. [2022-12-06 06:38:54,461 INFO L131 PetriNetUnfolder]: For 25/34 co-relation queries the response was YES. [2022-12-06 06:38:54,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 52 events. 9/52 cut-off events. For 25/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 146 event pairs, 1 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 115. Up to 17 conditions per place. [2022-12-06 06:38:54,462 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 27 transitions, 117 flow [2022-12-06 06:38:54,462 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-06 06:38:54,464 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:54,465 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 06:38:54,465 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 117 flow [2022-12-06 06:38:54,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:54,466 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:54,466 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:54,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:38:54,466 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:54,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:54,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2091430116, now seen corresponding path program 1 times [2022-12-06 06:38:54,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:54,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500055536] [2022-12-06 06:38:54,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:54,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:54,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:54,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500055536] [2022-12-06 06:38:54,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500055536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:54,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:54,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:38:54,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99038692] [2022-12-06 06:38:54,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:54,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:38:54,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:54,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:38:54,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:38:54,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:38:54,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:54,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:54,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:38:54,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:54,677 INFO L130 PetriNetUnfolder]: 615/984 cut-off events. [2022-12-06 06:38:54,678 INFO L131 PetriNetUnfolder]: For 724/724 co-relation queries the response was YES. [2022-12-06 06:38:54,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 984 events. 615/984 cut-off events. For 724/724 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4456 event pairs, 147 based on Foata normal form. 12/989 useless extension candidates. Maximal degree in co-relation 2690. Up to 807 conditions per place. [2022-12-06 06:38:54,683 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 31 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2022-12-06 06:38:54,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 213 flow [2022-12-06 06:38:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:38:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:38:54,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 06:38:54,684 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-06 06:38:54,684 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 117 flow. Second operand 3 states and 37 transitions. [2022-12-06 06:38:54,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 213 flow [2022-12-06 06:38:54,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:38:54,687 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 128 flow [2022-12-06 06:38:54,687 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-12-06 06:38:54,687 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2022-12-06 06:38:54,687 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:54,687 INFO L89 Accepts]: Start accepts. Operand has 38 places, 27 transitions, 128 flow [2022-12-06 06:38:54,688 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:54,688 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:54,688 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 128 flow [2022-12-06 06:38:54,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 128 flow [2022-12-06 06:38:54,693 INFO L130 PetriNetUnfolder]: 6/43 cut-off events. [2022-12-06 06:38:54,693 INFO L131 PetriNetUnfolder]: For 32/37 co-relation queries the response was YES. [2022-12-06 06:38:54,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 43 events. 6/43 cut-off events. For 32/37 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 111 event pairs, 1 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 94. Up to 13 conditions per place. [2022-12-06 06:38:54,694 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 128 flow [2022-12-06 06:38:54,694 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-06 06:38:54,695 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:54,695 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 06:38:54,696 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 128 flow [2022-12-06 06:38:54,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:54,696 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:54,696 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:54,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:38:54,696 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:54,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:54,696 INFO L85 PathProgramCache]: Analyzing trace with hash -409830714, now seen corresponding path program 1 times [2022-12-06 06:38:54,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:54,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065887988] [2022-12-06 06:38:54,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:54,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:54,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:54,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065887988] [2022-12-06 06:38:54,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065887988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:54,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:54,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:38:54,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591536001] [2022-12-06 06:38:54,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:54,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:38:54,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:54,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:38:54,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:38:54,832 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:38:54,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:54,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:54,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:38:54,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:54,942 INFO L130 PetriNetUnfolder]: 597/970 cut-off events. [2022-12-06 06:38:54,942 INFO L131 PetriNetUnfolder]: For 1006/1006 co-relation queries the response was YES. [2022-12-06 06:38:54,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2731 conditions, 970 events. 597/970 cut-off events. For 1006/1006 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4277 event pairs, 135 based on Foata normal form. 8/974 useless extension candidates. Maximal degree in co-relation 2714. Up to 703 conditions per place. [2022-12-06 06:38:54,948 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 27 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 06:38:54,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 208 flow [2022-12-06 06:38:54,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:38:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:38:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 06:38:54,950 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 06:38:54,950 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 128 flow. Second operand 3 states and 33 transitions. [2022-12-06 06:38:54,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 208 flow [2022-12-06 06:38:54,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:38:54,954 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 134 flow [2022-12-06 06:38:54,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2022-12-06 06:38:54,956 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2022-12-06 06:38:54,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:54,957 INFO L89 Accepts]: Start accepts. Operand has 39 places, 27 transitions, 134 flow [2022-12-06 06:38:54,957 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:54,957 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:54,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 27 transitions, 134 flow [2022-12-06 06:38:54,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 27 transitions, 134 flow [2022-12-06 06:38:54,962 INFO L130 PetriNetUnfolder]: 5/38 cut-off events. [2022-12-06 06:38:54,962 INFO L131 PetriNetUnfolder]: For 37/43 co-relation queries the response was YES. [2022-12-06 06:38:54,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 38 events. 5/38 cut-off events. For 37/43 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 87. Up to 11 conditions per place. [2022-12-06 06:38:54,963 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 27 transitions, 134 flow [2022-12-06 06:38:54,963 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-06 06:38:54,965 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:54,967 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 06:38:54,967 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 134 flow [2022-12-06 06:38:54,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:54,967 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:54,967 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:54,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:38:54,967 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:54,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:54,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1119107384, now seen corresponding path program 1 times [2022-12-06 06:38:54,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:54,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001633997] [2022-12-06 06:38:54,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:54,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:55,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:55,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001633997] [2022-12-06 06:38:55,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001633997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:55,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:55,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:38:55,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856884379] [2022-12-06 06:38:55,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:55,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:38:55,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:55,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:38:55,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:38:55,091 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:38:55,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:55,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:55,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:38:55,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:55,248 INFO L130 PetriNetUnfolder]: 895/1376 cut-off events. [2022-12-06 06:38:55,248 INFO L131 PetriNetUnfolder]: For 1747/1747 co-relation queries the response was YES. [2022-12-06 06:38:55,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3762 conditions, 1376 events. 895/1376 cut-off events. For 1747/1747 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6085 event pairs, 232 based on Foata normal form. 48/1420 useless extension candidates. Maximal degree in co-relation 3744. Up to 543 conditions per place. [2022-12-06 06:38:55,253 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 28 selfloop transitions, 3 changer transitions 11/43 dead transitions. [2022-12-06 06:38:55,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 258 flow [2022-12-06 06:38:55,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:38:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:38:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 06:38:55,255 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-06 06:38:55,255 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 134 flow. Second operand 4 states and 42 transitions. [2022-12-06 06:38:55,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 258 flow [2022-12-06 06:38:55,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:38:55,258 INFO L231 Difference]: Finished difference. Result has 42 places, 20 transitions, 94 flow [2022-12-06 06:38:55,258 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=42, PETRI_TRANSITIONS=20} [2022-12-06 06:38:55,258 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2022-12-06 06:38:55,258 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:55,258 INFO L89 Accepts]: Start accepts. Operand has 42 places, 20 transitions, 94 flow [2022-12-06 06:38:55,259 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:55,259 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:55,259 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 20 transitions, 94 flow [2022-12-06 06:38:55,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 20 transitions, 94 flow [2022-12-06 06:38:55,262 INFO L130 PetriNetUnfolder]: 1/22 cut-off events. [2022-12-06 06:38:55,262 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-06 06:38:55,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 22 events. 1/22 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 1 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 54. Up to 6 conditions per place. [2022-12-06 06:38:55,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 20 transitions, 94 flow [2022-12-06 06:38:55,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 06:38:55,293 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [437] $Ultimate##0-->L807: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_21 |v_P2Thread1of1ForFork1_#in~arg.offset_21|) (= v_~z~0_40 1) (= v_P2Thread1of1ForFork1_~arg.base_21 |v_P2Thread1of1ForFork1_#in~arg.base_21|) (= v_~y~0_36 v_~__unbuffered_p2_EAX~0_57)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_36} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_21, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_57, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_40, ~y~0=v_~y~0_36} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] and [352] $Ultimate##0-->L747: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~__unbuffered_p0_EAX~0_4 v_~z~0_4)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~z~0=v_~z~0_4} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~z~0=v_~z~0_4, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_~arg.base] [2022-12-06 06:38:55,368 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:38:55,368 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-06 06:38:55,369 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 18 transitions, 84 flow [2022-12-06 06:38:55,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:55,369 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:55,369 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:55,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:38:55,369 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:55,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:55,372 INFO L85 PathProgramCache]: Analyzing trace with hash -2090652884, now seen corresponding path program 1 times [2022-12-06 06:38:55,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:55,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883498108] [2022-12-06 06:38:55,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:55,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:55,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:55,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883498108] [2022-12-06 06:38:55,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883498108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:55,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:55,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:38:55,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636074114] [2022-12-06 06:38:55,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:55,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:38:55,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:55,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:38:55,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:38:55,482 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 06:38:55,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 18 transitions, 84 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:55,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:55,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 06:38:55,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:55,588 INFO L130 PetriNetUnfolder]: 408/637 cut-off events. [2022-12-06 06:38:55,589 INFO L131 PetriNetUnfolder]: For 1694/1694 co-relation queries the response was YES. [2022-12-06 06:38:55,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1872 conditions, 637 events. 408/637 cut-off events. For 1694/1694 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2375 event pairs, 46 based on Foata normal form. 15/652 useless extension candidates. Maximal degree in co-relation 1852. Up to 358 conditions per place. [2022-12-06 06:38:55,592 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 35 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2022-12-06 06:38:55,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 251 flow [2022-12-06 06:38:55,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:38:55,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:38:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-06 06:38:55,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2022-12-06 06:38:55,594 INFO L175 Difference]: Start difference. First operand has 38 places, 18 transitions, 84 flow. Second operand 5 states and 43 transitions. [2022-12-06 06:38:55,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 251 flow [2022-12-06 06:38:55,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 41 transitions, 186 flow, removed 19 selfloop flow, removed 12 redundant places. [2022-12-06 06:38:55,598 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 88 flow [2022-12-06 06:38:55,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-12-06 06:38:55,599 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-06 06:38:55,599 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:55,599 INFO L89 Accepts]: Start accepts. Operand has 32 places, 22 transitions, 88 flow [2022-12-06 06:38:55,599 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:55,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:55,600 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 22 transitions, 88 flow [2022-12-06 06:38:55,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 22 transitions, 88 flow [2022-12-06 06:38:55,604 INFO L130 PetriNetUnfolder]: 3/32 cut-off events. [2022-12-06 06:38:55,604 INFO L131 PetriNetUnfolder]: For 12/17 co-relation queries the response was YES. [2022-12-06 06:38:55,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 32 events. 3/32 cut-off events. For 12/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 82 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 65. Up to 10 conditions per place. [2022-12-06 06:38:55,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 22 transitions, 88 flow [2022-12-06 06:38:55,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 06:38:55,609 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:55,611 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 06:38:55,611 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 88 flow [2022-12-06 06:38:55,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:55,611 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:55,612 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:55,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:38:55,612 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:55,612 INFO L85 PathProgramCache]: Analyzing trace with hash -385732678, now seen corresponding path program 1 times [2022-12-06 06:38:55,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:55,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241806591] [2022-12-06 06:38:55,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:55,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:55,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:55,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241806591] [2022-12-06 06:38:55,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241806591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:55,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:55,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:38:55,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122821287] [2022-12-06 06:38:55,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:55,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:38:55,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:55,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:38:55,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:38:55,705 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 06:38:55,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 88 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:55,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:55,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 06:38:55,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:55,811 INFO L130 PetriNetUnfolder]: 463/734 cut-off events. [2022-12-06 06:38:55,812 INFO L131 PetriNetUnfolder]: For 468/468 co-relation queries the response was YES. [2022-12-06 06:38:55,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 734 events. 463/734 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2879 event pairs, 199 based on Foata normal form. 30/764 useless extension candidates. Maximal degree in co-relation 1864. Up to 307 conditions per place. [2022-12-06 06:38:55,814 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 23 selfloop transitions, 3 changer transitions 10/36 dead transitions. [2022-12-06 06:38:55,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 190 flow [2022-12-06 06:38:55,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:38:55,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:38:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 06:38:55,816 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2022-12-06 06:38:55,816 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 88 flow. Second operand 4 states and 37 transitions. [2022-12-06 06:38:55,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 190 flow [2022-12-06 06:38:55,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:38:55,818 INFO L231 Difference]: Finished difference. Result has 37 places, 18 transitions, 78 flow [2022-12-06 06:38:55,818 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=37, PETRI_TRANSITIONS=18} [2022-12-06 06:38:55,819 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-06 06:38:55,819 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:55,819 INFO L89 Accepts]: Start accepts. Operand has 37 places, 18 transitions, 78 flow [2022-12-06 06:38:55,820 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:55,820 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:55,820 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 18 transitions, 78 flow [2022-12-06 06:38:55,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 18 transitions, 78 flow [2022-12-06 06:38:55,823 INFO L130 PetriNetUnfolder]: 1/21 cut-off events. [2022-12-06 06:38:55,824 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-06 06:38:55,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 21 events. 1/21 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 1 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 47. Up to 6 conditions per place. [2022-12-06 06:38:55,824 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 18 transitions, 78 flow [2022-12-06 06:38:55,824 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 06:38:55,920 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:38:55,921 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 06:38:55,921 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 17 transitions, 76 flow [2022-12-06 06:38:55,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:55,921 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:55,921 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:55,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:38:55,921 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:55,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1881504041, now seen corresponding path program 1 times [2022-12-06 06:38:55,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:55,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608070820] [2022-12-06 06:38:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:55,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:56,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:56,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608070820] [2022-12-06 06:38:56,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608070820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:56,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:56,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:38:56,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391350128] [2022-12-06 06:38:56,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:56,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:38:56,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:56,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:38:56,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:38:56,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:38:56,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 17 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:56,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:56,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:38:56,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:56,164 INFO L130 PetriNetUnfolder]: 168/300 cut-off events. [2022-12-06 06:38:56,165 INFO L131 PetriNetUnfolder]: For 366/366 co-relation queries the response was YES. [2022-12-06 06:38:56,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 300 events. 168/300 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1056 event pairs, 36 based on Foata normal form. 31/331 useless extension candidates. Maximal degree in co-relation 831. Up to 200 conditions per place. [2022-12-06 06:38:56,166 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 22 selfloop transitions, 4 changer transitions 16/42 dead transitions. [2022-12-06 06:38:56,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 256 flow [2022-12-06 06:38:56,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:38:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:38:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 06:38:56,167 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5176470588235295 [2022-12-06 06:38:56,167 INFO L175 Difference]: Start difference. First operand has 35 places, 17 transitions, 76 flow. Second operand 5 states and 44 transitions. [2022-12-06 06:38:56,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 256 flow [2022-12-06 06:38:56,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 42 transitions, 200 flow, removed 8 selfloop flow, removed 9 redundant places. [2022-12-06 06:38:56,168 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 84 flow [2022-12-06 06:38:56,169 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2022-12-06 06:38:56,169 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2022-12-06 06:38:56,169 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:56,169 INFO L89 Accepts]: Start accepts. Operand has 33 places, 20 transitions, 84 flow [2022-12-06 06:38:56,170 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:56,170 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:56,170 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 20 transitions, 84 flow [2022-12-06 06:38:56,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 20 transitions, 84 flow [2022-12-06 06:38:56,175 INFO L130 PetriNetUnfolder]: 31/73 cut-off events. [2022-12-06 06:38:56,175 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-06 06:38:56,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 73 events. 31/73 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 219 event pairs, 18 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 183. Up to 43 conditions per place. [2022-12-06 06:38:56,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 20 transitions, 84 flow [2022-12-06 06:38:56,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 06:38:56,177 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:56,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 06:38:56,178 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 84 flow [2022-12-06 06:38:56,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:56,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:56,178 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:56,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:38:56,178 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:56,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1855916987, now seen corresponding path program 1 times [2022-12-06 06:38:56,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:56,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387110683] [2022-12-06 06:38:56,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:56,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:56,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:56,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387110683] [2022-12-06 06:38:56,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387110683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:56,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:56,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:38:56,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856324088] [2022-12-06 06:38:56,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:56,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:38:56,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:56,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:38:56,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:38:56,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:38:56,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:56,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:56,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:38:56,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:56,368 INFO L130 PetriNetUnfolder]: 78/161 cut-off events. [2022-12-06 06:38:56,368 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-12-06 06:38:56,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 161 events. 78/161 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 485 event pairs, 13 based on Foata normal form. 20/181 useless extension candidates. Maximal degree in co-relation 505. Up to 75 conditions per place. [2022-12-06 06:38:56,369 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 25 selfloop transitions, 7 changer transitions 14/46 dead transitions. [2022-12-06 06:38:56,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 282 flow [2022-12-06 06:38:56,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:38:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:38:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-12-06 06:38:56,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-06 06:38:56,370 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 84 flow. Second operand 6 states and 48 transitions. [2022-12-06 06:38:56,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 282 flow [2022-12-06 06:38:56,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 276 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:38:56,371 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 134 flow [2022-12-06 06:38:56,371 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2022-12-06 06:38:56,372 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-06 06:38:56,372 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:56,372 INFO L89 Accepts]: Start accepts. Operand has 37 places, 23 transitions, 134 flow [2022-12-06 06:38:56,372 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:56,373 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:56,373 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 23 transitions, 134 flow [2022-12-06 06:38:56,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 23 transitions, 134 flow [2022-12-06 06:38:56,377 INFO L130 PetriNetUnfolder]: 13/44 cut-off events. [2022-12-06 06:38:56,377 INFO L131 PetriNetUnfolder]: For 58/60 co-relation queries the response was YES. [2022-12-06 06:38:56,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 44 events. 13/44 cut-off events. For 58/60 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 4 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 146. Up to 24 conditions per place. [2022-12-06 06:38:56,377 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 23 transitions, 134 flow [2022-12-06 06:38:56,377 INFO L188 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-06 06:38:56,378 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:56,378 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 06:38:56,378 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 134 flow [2022-12-06 06:38:56,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:56,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:56,379 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:56,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:38:56,379 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:56,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:56,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1471003974, now seen corresponding path program 1 times [2022-12-06 06:38:56,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:56,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43105501] [2022-12-06 06:38:56,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:56,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:56,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:56,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43105501] [2022-12-06 06:38:56,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43105501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:56,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:56,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:38:56,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524232391] [2022-12-06 06:38:56,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:56,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:38:56,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:56,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:38:56,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:38:56,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:38:56,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:56,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:56,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:38:56,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:56,576 INFO L130 PetriNetUnfolder]: 41/93 cut-off events. [2022-12-06 06:38:56,576 INFO L131 PetriNetUnfolder]: For 119/119 co-relation queries the response was YES. [2022-12-06 06:38:56,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 93 events. 41/93 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 218 event pairs, 10 based on Foata normal form. 7/100 useless extension candidates. Maximal degree in co-relation 331. Up to 41 conditions per place. [2022-12-06 06:38:56,577 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 22 selfloop transitions, 10 changer transitions 7/39 dead transitions. [2022-12-06 06:38:56,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 283 flow [2022-12-06 06:38:56,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:38:56,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:38:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-12-06 06:38:56,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3445378151260504 [2022-12-06 06:38:56,578 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 134 flow. Second operand 7 states and 41 transitions. [2022-12-06 06:38:56,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 283 flow [2022-12-06 06:38:56,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 234 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-12-06 06:38:56,579 INFO L231 Difference]: Finished difference. Result has 39 places, 23 transitions, 130 flow [2022-12-06 06:38:56,580 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=130, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2022-12-06 06:38:56,580 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2022-12-06 06:38:56,580 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:56,580 INFO L89 Accepts]: Start accepts. Operand has 39 places, 23 transitions, 130 flow [2022-12-06 06:38:56,582 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:56,582 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:56,582 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 23 transitions, 130 flow [2022-12-06 06:38:56,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 23 transitions, 130 flow [2022-12-06 06:38:56,586 INFO L130 PetriNetUnfolder]: 5/26 cut-off events. [2022-12-06 06:38:56,586 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-06 06:38:56,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 26 events. 5/26 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 72. Up to 11 conditions per place. [2022-12-06 06:38:56,587 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 23 transitions, 130 flow [2022-12-06 06:38:56,587 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 06:38:56,890 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:38:56,890 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 310 [2022-12-06 06:38:56,890 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 126 flow [2022-12-06 06:38:56,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:56,890 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:56,891 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:56,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:38:56,891 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:56,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:56,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1568771564, now seen corresponding path program 1 times [2022-12-06 06:38:56,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:56,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126778437] [2022-12-06 06:38:56,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:56,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:57,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:38:57,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:57,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126778437] [2022-12-06 06:38:57,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126778437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:57,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:57,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:38:57,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144530357] [2022-12-06 06:38:57,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:57,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:38:57,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:57,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:38:57,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:38:57,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 06:38:57,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 126 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:57,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:57,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 06:38:57,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:57,669 INFO L130 PetriNetUnfolder]: 44/99 cut-off events. [2022-12-06 06:38:57,669 INFO L131 PetriNetUnfolder]: For 167/167 co-relation queries the response was YES. [2022-12-06 06:38:57,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 99 events. 44/99 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 292 event pairs, 3 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 346. Up to 48 conditions per place. [2022-12-06 06:38:57,669 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 24 selfloop transitions, 4 changer transitions 14/42 dead transitions. [2022-12-06 06:38:57,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 340 flow [2022-12-06 06:38:57,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:38:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:38:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-12-06 06:38:57,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32222222222222224 [2022-12-06 06:38:57,671 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 126 flow. Second operand 6 states and 29 transitions. [2022-12-06 06:38:57,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 340 flow [2022-12-06 06:38:57,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 266 flow, removed 21 selfloop flow, removed 6 redundant places. [2022-12-06 06:38:57,672 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 100 flow [2022-12-06 06:38:57,672 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2022-12-06 06:38:57,672 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2022-12-06 06:38:57,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:57,673 INFO L89 Accepts]: Start accepts. Operand has 35 places, 21 transitions, 100 flow [2022-12-06 06:38:57,673 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:57,673 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:57,673 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 21 transitions, 100 flow [2022-12-06 06:38:57,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 21 transitions, 100 flow [2022-12-06 06:38:57,676 INFO L130 PetriNetUnfolder]: 6/28 cut-off events. [2022-12-06 06:38:57,677 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-06 06:38:57,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 28 events. 6/28 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 68. Up to 10 conditions per place. [2022-12-06 06:38:57,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 21 transitions, 100 flow [2022-12-06 06:38:57,677 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 06:38:57,975 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [443] L787-->P1EXIT: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_117 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_408 256) 0))) (.cse5 (not (= 0 (mod v_~x$r_buff0_thd2~0_168 256))))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_409 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_361 256) 0))))) (and (= v_~x$r_buff1_thd2~0_116 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_360 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd2~0_167 256) 0)))) 0 v_~x$r_buff1_thd2~0_117)) (= (ite .cse2 v_~x$w_buff0~0_248 (ite .cse3 v_~x$w_buff1~0_206 v_~x~0_310)) v_~x~0_309) (= (ite .cse4 0 v_~x$r_buff0_thd2~0_168) v_~x$r_buff0_thd2~0_167) (= |v_P1Thread1of1ForFork0_#res#1.base_33| 0) (= v_~__unbuffered_cnt~0_235 (+ v_~__unbuffered_cnt~0_236 1)) (= v_~x$w_buff0_used~0_408 (ite .cse2 0 v_~x$w_buff0_used~0_409)) (= |v_P1Thread1of1ForFork0_#res#1.offset_33| 0) (= (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_361) v_~x$w_buff1_used~0_360)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_248, ~x$w_buff1~0=v_~x$w_buff1~0_206, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_361, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_236, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_168, ~x~0=v_~x~0_310, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_409} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_248, ~x$w_buff1~0=v_~x$w_buff1~0_206, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_360, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_235, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_33|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_167, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_33|, ~x~0=v_~x~0_309, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_408} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#res#1.offset, ~x~0, ~x$w_buff0_used~0] and [441] L836-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse2 (not (= 0 (mod v_~x$r_buff1_thd0~0_158 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_152 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_391 256) 0)))) (let ((.cse0 (and .cse5 .cse1)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_392 256) 0)))) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_345 256) 0)) .cse2))) (and (= v_~x$r_buff0_thd0~0_151 (ite .cse0 0 v_~x$r_buff0_thd0~0_152)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_53| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= v_~x$r_buff1_thd0~0_157 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_151 256) 0)) .cse1) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_344 256) 0)))) 0 v_~x$r_buff1_thd0~0_158)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_53|) (= (ite (or .cse3 .cse0) 0 v_~x$w_buff1_used~0_345) v_~x$w_buff1_used~0_344) (= v_~x$w_buff0_used~0_391 (ite .cse4 0 v_~x$w_buff0_used~0_392)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_229 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (ite .cse4 v_~x$w_buff0~0_240 (ite .cse3 v_~x$w_buff1~0_198 v_~x~0_294)) v_~x~0_293) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_67 1) (= v_~__unbuffered_p0_EAX~0_75 1) (= v_~__unbuffered_p0_EBX~0_86 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43| (mod v_~main$tmp_guard1~0_46 256))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_240, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_152, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_75, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~x$w_buff1~0=v_~x$w_buff1~0_198, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_345, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_229, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_158, ~x~0=v_~x~0_294, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_392} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_240, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_151, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_53|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_69|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_67|, ~x$w_buff1~0=v_~x$w_buff1~0_198, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_157, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_391, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_75, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_229, ~x~0=v_~x~0_293, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:38:58,380 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:38:58,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 708 [2022-12-06 06:38:58,381 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 102 flow [2022-12-06 06:38:58,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:58,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:58,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:58,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:38:58,382 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:58,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:58,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1686306598, now seen corresponding path program 1 times [2022-12-06 06:38:58,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:58,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785584762] [2022-12-06 06:38:58,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:58,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:38:58,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:38:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:38:58,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:38:58,462 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:38:58,463 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:38:58,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:38:58,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:38:58,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:38:58,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:38:58,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:38:58,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:38:58,467 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:58,472 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:38:58,472 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:38:58,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:38:58 BasicIcfg [2022-12-06 06:38:58,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:38:58,546 INFO L158 Benchmark]: Toolchain (without parser) took 10788.17ms. Allocated memory was 211.8MB in the beginning and 563.1MB in the end (delta: 351.3MB). Free memory was 186.6MB in the beginning and 479.5MB in the end (delta: -292.8MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. [2022-12-06 06:38:58,546 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 211.8MB. Free memory is still 189.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:38:58,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.18ms. Allocated memory is still 211.8MB. Free memory was 186.6MB in the beginning and 160.2MB in the end (delta: 26.5MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 06:38:58,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.14ms. Allocated memory is still 211.8MB. Free memory was 160.2MB in the beginning and 158.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:38:58,546 INFO L158 Benchmark]: Boogie Preprocessor took 31.67ms. Allocated memory is still 211.8MB. Free memory was 158.1MB in the beginning and 156.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:38:58,547 INFO L158 Benchmark]: RCFGBuilder took 535.50ms. Allocated memory is still 211.8MB. Free memory was 156.0MB in the beginning and 125.1MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 06:38:58,547 INFO L158 Benchmark]: TraceAbstraction took 9654.15ms. Allocated memory was 211.8MB in the beginning and 563.1MB in the end (delta: 351.3MB). Free memory was 124.0MB in the beginning and 479.5MB in the end (delta: -355.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:38:58,548 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 211.8MB. Free memory is still 189.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 489.18ms. Allocated memory is still 211.8MB. Free memory was 186.6MB in the beginning and 160.2MB in the end (delta: 26.5MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.14ms. Allocated memory is still 211.8MB. Free memory was 160.2MB in the beginning and 158.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.67ms. Allocated memory is still 211.8MB. Free memory was 158.1MB in the beginning and 156.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 535.50ms. Allocated memory is still 211.8MB. Free memory was 156.0MB in the beginning and 125.1MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9654.15ms. Allocated memory was 211.8MB in the beginning and 563.1MB in the end (delta: 351.3MB). Free memory was 124.0MB in the beginning and 479.5MB in the end (delta: -355.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 113 PlacesBefore, 35 PlacesAfterwards, 105 TransitionsBefore, 26 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1496, independent: 1445, independent conditional: 1445, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1496, independent: 1445, independent conditional: 0, independent unconditional: 1445, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1496, independent: 1445, independent conditional: 0, independent unconditional: 1445, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1496, independent: 1445, independent conditional: 0, independent unconditional: 1445, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1188, independent: 1153, independent conditional: 0, independent unconditional: 1153, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1188, independent: 1137, independent conditional: 0, independent unconditional: 1137, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 136, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1496, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1188, unknown conditional: 0, unknown unconditional: 1188] , Statistics on independence cache: Total cache size (in pairs): 1849, Positive cache size: 1814, Positive conditional cache size: 0, Positive unconditional cache size: 1814, Negative cache size: 35, Negative conditional cache size: 0, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 29 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 97, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 97, independent: 77, independent conditional: 5, independent unconditional: 72, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 97, independent: 77, independent conditional: 5, independent unconditional: 72, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 97, independent: 77, independent conditional: 5, independent unconditional: 72, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 89, independent: 71, independent conditional: 5, independent unconditional: 66, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 89, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 82, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 79, dependent conditional: 15, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 97, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 89, unknown conditional: 8, unknown unconditional: 81] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 71, Positive conditional cache size: 5, Positive unconditional cache size: 66, Negative cache size: 18, Negative conditional cache size: 3, Negative unconditional cache size: 15, 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.1s, 30 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 75, independent: 58, independent conditional: 9, independent unconditional: 49, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 75, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 75, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 75, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 78, Positive conditional cache size: 5, Positive unconditional cache size: 73, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, 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: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 74, independent: 59, independent conditional: 19, independent unconditional: 40, dependent: 15, dependent conditional: 9, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 17, dependent conditional: 0, dependent unconditional: 17, 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: 76, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 78, Positive conditional cache size: 5, Positive unconditional cache size: 73, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 52, independent conditional: 16, independent unconditional: 36, dependent: 15, dependent conditional: 8, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 69, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 69, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 79, Positive conditional cache size: 5, Positive unconditional cache size: 74, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 52, independent conditional: 15, independent unconditional: 37, dependent: 15, dependent conditional: 8, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 71, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 71, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 71, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 79, Positive conditional cache size: 5, Positive unconditional cache size: 74, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 38 PlacesAfterwards, 20 TransitionsBefore, 18 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 138, independent: 111, independent conditional: 111, 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: 138, independent: 111, independent conditional: 17, independent unconditional: 94, dependent: 27, dependent conditional: 5, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 147, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 147, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 147, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 33, unknown conditional: 0, unknown unconditional: 33] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 107, Positive conditional cache size: 5, Positive unconditional cache size: 102, Negative cache size: 31, Negative conditional cache size: 3, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 32, independent conditional: 9, independent unconditional: 23, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 111, Positive conditional cache size: 5, Positive unconditional cache size: 106, Negative cache size: 32, Negative conditional cache size: 3, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 35 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 28, independent conditional: 6, independent unconditional: 22, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 47, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 119, Positive conditional cache size: 5, Positive unconditional cache size: 114, Negative cache size: 32, Negative conditional cache size: 3, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 119, Positive conditional cache size: 5, Positive unconditional cache size: 114, Negative cache size: 32, Negative conditional cache size: 3, Negative unconditional cache size: 29, 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, 35 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 28, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 119, Positive conditional cache size: 5, Positive unconditional cache size: 114, Negative cache size: 32, Negative conditional cache size: 3, Negative unconditional cache size: 29, 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.3s, 37 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64, independent: 40, independent conditional: 24, independent unconditional: 16, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 40, independent conditional: 16, independent unconditional: 24, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 40, independent conditional: 16, independent unconditional: 24, dependent: 24, dependent conditional: 0, dependent unconditional: 24, 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: 64, independent: 38, independent conditional: 16, independent unconditional: 22, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 132, Positive conditional cache size: 5, Positive unconditional cache size: 127, Negative cache size: 32, Negative conditional cache size: 3, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 34 PlacesBefore, 33 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 57, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 168, Positive conditional cache size: 10, Positive unconditional cache size: 158, Negative cache size: 32, Negative conditional cache size: 3, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2055; [L832] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2055, ((void *)0), P0, ((void *)0))=-1, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2056; [L834] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2056, ((void *)0), P1, ((void *)0))=0, t2055={5:0}, t2056={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2057; [L836] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2057, ((void *)0), P2, ((void *)0))=1, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y [L806] 3 z = 1 [L746] 3 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 834]: 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: 836]: 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: 832]: 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, 134 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: 9.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 246 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 246 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 663 IncrementalHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 5 mSDtfsCounter, 663 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=5, InterpolantAutomatonStates: 54, 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.9s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 764 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-06 06:38:58,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...