/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/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:47:02,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:47:02,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:47:02,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:47:02,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:47:02,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:47:02,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:47:02,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:47:02,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:47:02,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:47:02,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:47:02,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:47:02,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:47:02,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:47:02,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:47:02,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:47:02,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:47:02,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:47:02,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:47:02,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:47:02,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:47:02,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:47:02,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:47:02,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:47:02,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:47:02,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:47:02,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:47:02,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:47:02,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:47:02,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:47:02,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:47:02,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:47:02,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:47:02,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:47:02,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:47:02,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:47:02,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:47:02,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:47:02,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:47:02,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:47:02,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:47:02,306 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:47:02,337 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:47:02,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:47:02,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:47:02,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:47:02,339 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:47:02,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:47:02,340 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:47:02,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:47:02,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:47:02,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:47:02,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:47:02,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:47:02,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:47:02,342 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:47:02,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:47:02,342 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:47:02,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:47:02,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:47:02,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:47:02,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:47:02,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:47:02,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:47:02,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:47:02,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:47:02,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:47:02,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:47:02,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:47:02,343 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:47:02,343 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:47:02,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:47:02,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:47:02,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:47:02,621 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:47:02,622 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:47:02,623 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2022-12-06 06:47:03,698 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:47:03,961 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:47:03,961 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2022-12-06 06:47:03,977 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13aaa23f9/0e14edbdc5134723bb1dbeb07c5d5964/FLAG51219fcd7 [2022-12-06 06:47:04,003 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13aaa23f9/0e14edbdc5134723bb1dbeb07c5d5964 [2022-12-06 06:47:04,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:47:04,006 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:47:04,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:47:04,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:47:04,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:47:04,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:47:04" (1/1) ... [2022-12-06 06:47:04,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6c12da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:47:04, skipping insertion in model container [2022-12-06 06:47:04,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:47:04" (1/1) ... [2022-12-06 06:47:04,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:47:04,066 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:47:04,678 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i[76077,76090] [2022-12-06 06:47:04,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:47:04,721 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:47:04,757 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i[76077,76090] [2022-12-06 06:47:04,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:47:04,861 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:47:04,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:47:04 WrapperNode [2022-12-06 06:47:04,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:47:04,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:47:04,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:47:04,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:47:04,869 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:47:04" (1/1) ... [2022-12-06 06:47:04,895 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:47:04" (1/1) ... [2022-12-06 06:47:04,939 INFO L138 Inliner]: procedures = 482, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 133 [2022-12-06 06:47:04,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:47:04,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:47:04,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:47:04,940 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:47:04,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:47:04" (1/1) ... [2022-12-06 06:47:04,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:47:04" (1/1) ... [2022-12-06 06:47:04,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:47:04" (1/1) ... [2022-12-06 06:47:04,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:47:04" (1/1) ... [2022-12-06 06:47:04,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:47:04" (1/1) ... [2022-12-06 06:47:04,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:47:04" (1/1) ... [2022-12-06 06:47:04,967 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:47:04" (1/1) ... [2022-12-06 06:47:04,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:47:04" (1/1) ... [2022-12-06 06:47:04,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:47:04,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:47:04,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:47:04,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:47:04,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:47:04" (1/1) ... [2022-12-06 06:47:04,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:47:04,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:47:05,005 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:47:05,023 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:47:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:47:05,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:47:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 06:47:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:47:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-06 06:47:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:47:05,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:47:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-12-06 06:47:05,038 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-12-06 06:47:05,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:47:05,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:47:05,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:47:05,040 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:47:05,338 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:47:05,340 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:47:05,581 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:47:05,586 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:47:05,586 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:47:05,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:47:05 BoogieIcfgContainer [2022-12-06 06:47:05,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:47:05,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:47:05,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:47:05,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:47:05,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:47:04" (1/3) ... [2022-12-06 06:47:05,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3521a087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:47:05, skipping insertion in model container [2022-12-06 06:47:05,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:47:04" (2/3) ... [2022-12-06 06:47:05,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3521a087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:47:05, skipping insertion in model container [2022-12-06 06:47:05,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:47:05" (3/3) ... [2022-12-06 06:47:05,594 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2022-12-06 06:47:05,608 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:47:05,609 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-06 06:47:05,609 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:47:05,655 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 06:47:05,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 174 transitions, 364 flow [2022-12-06 06:47:05,752 INFO L130 PetriNetUnfolder]: 10/212 cut-off events. [2022-12-06 06:47:05,752 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:47:05,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 212 events. 10/212 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 372 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 124. Up to 4 conditions per place. [2022-12-06 06:47:05,757 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 174 transitions, 364 flow [2022-12-06 06:47:05,766 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 162 transitions, 336 flow [2022-12-06 06:47:05,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:47:05,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 162 transitions, 336 flow [2022-12-06 06:47:05,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 162 transitions, 336 flow [2022-12-06 06:47:05,836 INFO L130 PetriNetUnfolder]: 7/193 cut-off events. [2022-12-06 06:47:05,836 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:47:05,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 193 events. 7/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 315 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 114. Up to 4 conditions per place. [2022-12-06 06:47:05,840 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 162 transitions, 336 flow [2022-12-06 06:47:05,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 2604 [2022-12-06 06:47:06,006 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:06,008 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:06,015 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:06,016 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:08,743 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:08,744 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:08,746 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:08,746 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:08,920 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:08,920 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:08,923 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:08,924 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:09,140 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:09,141 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:09,142 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:09,143 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:09,144 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:09,145 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2022-12-06 06:47:09,146 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:09,147 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:12,657 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:12,658 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:12,661 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:12,662 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:15,085 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:15,085 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2022-12-06 06:47:15,087 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:15,087 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:15,089 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:15,089 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2022-12-06 06:47:15,090 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:15,091 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:17,766 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:17,766 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:17,768 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:17,768 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:17,897 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:17,898 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:17,899 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:17,900 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:21,194 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:21,195 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:21,197 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:21,201 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:23,851 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:23,852 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:23,854 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:23,855 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:23,924 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:23,925 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 06:47:23,928 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:23,928 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:23,930 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:23,931 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 06:47:23,933 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:23,933 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:25,200 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:25,201 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:25,202 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:25,203 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:27,676 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:27,677 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:27,679 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:27,680 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:31,923 INFO L203 LiptonReduction]: Total number of compositions: 132 [2022-12-06 06:47:31,938 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:47:31,942 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;@206367ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:47:31,943 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-06 06:47:31,943 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 06:47:31,944 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:47:31,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:47:31,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1] [2022-12-06 06:47:31,944 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:47:31,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:47:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash 586, now seen corresponding path program 1 times [2022-12-06 06:47:31,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:47:31,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745872928] [2022-12-06 06:47:31,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:47:31,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:47:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:47:32,116 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:47:32,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:47:32,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745872928] [2022-12-06 06:47:32,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745872928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:47:32,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:47:32,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-06 06:47:32,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936085827] [2022-12-06 06:47:32,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:47:32,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 06:47:32,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:47:32,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 06:47:32,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 06:47:32,147 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2022-12-06 06:47:32,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 82 flow. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:47:32,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:47:32,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2022-12-06 06:47:32,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:47:32,266 INFO L130 PetriNetUnfolder]: 225/508 cut-off events. [2022-12-06 06:47:32,266 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-06 06:47:32,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 508 events. 225/508 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2817 event pairs, 224 based on Foata normal form. 25/419 useless extension candidates. Maximal degree in co-relation 855. Up to 403 conditions per place. [2022-12-06 06:47:32,274 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 25 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2022-12-06 06:47:32,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 126 flow [2022-12-06 06:47:32,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 06:47:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 06:47:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2022-12-06 06:47:32,282 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 06:47:32,283 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 82 flow. Second operand 2 states and 42 transitions. [2022-12-06 06:47:32,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 126 flow [2022-12-06 06:47:32,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:47:32,287 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 68 flow [2022-12-06 06:47:32,289 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2022-12-06 06:47:32,291 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2022-12-06 06:47:32,291 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:47:32,292 INFO L89 Accepts]: Start accepts. Operand has 34 places, 32 transitions, 68 flow [2022-12-06 06:47:32,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:47:32,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:47:32,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 32 transitions, 68 flow [2022-12-06 06:47:32,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 32 transitions, 68 flow [2022-12-06 06:47:32,300 INFO L130 PetriNetUnfolder]: 1/38 cut-off events. [2022-12-06 06:47:32,300 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:47:32,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 90 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:47:32,302 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 32 transitions, 68 flow [2022-12-06 06:47:32,302 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 06:47:32,313 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:32,314 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:32,323 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:32,323 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:34,739 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:47:34,740 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2449 [2022-12-06 06:47:34,740 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 66 flow [2022-12-06 06:47:34,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:47:34,740 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:47:34,741 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-06 06:47:34,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:47:34,741 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:47:34,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:47:34,741 INFO L85 PathProgramCache]: Analyzing trace with hash 18525369, now seen corresponding path program 1 times [2022-12-06 06:47:34,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:47:34,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515723019] [2022-12-06 06:47:34,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:47:34,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:47:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:47:35,079 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:47:35,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:47:35,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515723019] [2022-12-06 06:47:35,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515723019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:47:35,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:47:35,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:47:35,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450240698] [2022-12-06 06:47:35,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:47:35,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:47:35,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:47:35,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:47:35,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:47:35,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 06:47:35,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 66 flow. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:47:35,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:47:35,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 06:47:35,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:47:35,265 INFO L130 PetriNetUnfolder]: 861/1449 cut-off events. [2022-12-06 06:47:35,265 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:47:35,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2908 conditions, 1449 events. 861/1449 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7211 event pairs, 414 based on Foata normal form. 0/1213 useless extension candidates. Maximal degree in co-relation 235. Up to 1025 conditions per place. [2022-12-06 06:47:35,271 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 40 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2022-12-06 06:47:35,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 46 transitions, 188 flow [2022-12-06 06:47:35,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:47:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:47:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 06:47:35,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5053763440860215 [2022-12-06 06:47:35,273 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 66 flow. Second operand 3 states and 47 transitions. [2022-12-06 06:47:35,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 46 transitions, 188 flow [2022-12-06 06:47:35,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:47:35,274 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 102 flow [2022-12-06 06:47:35,274 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=35, PETRI_TRANSITIONS=35} [2022-12-06 06:47:35,275 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2022-12-06 06:47:35,275 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:47:35,275 INFO L89 Accepts]: Start accepts. Operand has 35 places, 35 transitions, 102 flow [2022-12-06 06:47:35,275 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:47:35,275 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:47:35,276 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 35 transitions, 102 flow [2022-12-06 06:47:35,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 35 transitions, 102 flow [2022-12-06 06:47:35,284 INFO L130 PetriNetUnfolder]: 29/133 cut-off events. [2022-12-06 06:47:35,285 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 06:47:35,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 133 events. 29/133 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 620 event pairs, 16 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 58. Up to 53 conditions per place. [2022-12-06 06:47:35,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 35 transitions, 102 flow [2022-12-06 06:47:35,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-06 06:47:39,731 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:47:39,732 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4457 [2022-12-06 06:47:39,732 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 35 transitions, 102 flow [2022-12-06 06:47:39,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:47:39,732 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:47:39,732 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:47:39,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:47:39,733 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:47:39,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:47:39,733 INFO L85 PathProgramCache]: Analyzing trace with hash 574281447, now seen corresponding path program 1 times [2022-12-06 06:47:39,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:47:39,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546814938] [2022-12-06 06:47:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:47:39,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:47:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:47:39,925 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:47:39,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:47:39,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546814938] [2022-12-06 06:47:39,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546814938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:47:39,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:47:39,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:47:39,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220982809] [2022-12-06 06:47:39,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:47:39,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:47:39,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:47:39,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:47:39,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:47:39,937 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 06:47:39,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 35 transitions, 102 flow. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:47:39,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:47:39,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 06:47:39,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:47:40,138 INFO L130 PetriNetUnfolder]: 935/1593 cut-off events. [2022-12-06 06:47:40,139 INFO L131 PetriNetUnfolder]: For 324/324 co-relation queries the response was YES. [2022-12-06 06:47:40,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 1593 events. 935/1593 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8299 event pairs, 490 based on Foata normal form. 90/1528 useless extension candidates. Maximal degree in co-relation 946. Up to 1130 conditions per place. [2022-12-06 06:47:40,145 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 42 selfloop transitions, 9 changer transitions 2/53 dead transitions. [2022-12-06 06:47:40,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 53 transitions, 266 flow [2022-12-06 06:47:40,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:47:40,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:47:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 06:47:40,146 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4946236559139785 [2022-12-06 06:47:40,146 INFO L175 Difference]: Start difference. First operand has 35 places, 35 transitions, 102 flow. Second operand 3 states and 46 transitions. [2022-12-06 06:47:40,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 53 transitions, 266 flow [2022-12-06 06:47:40,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 53 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:47:40,149 INFO L231 Difference]: Finished difference. Result has 37 places, 41 transitions, 167 flow [2022-12-06 06:47:40,149 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=37, PETRI_TRANSITIONS=41} [2022-12-06 06:47:40,150 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2022-12-06 06:47:40,150 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:47:40,150 INFO L89 Accepts]: Start accepts. Operand has 37 places, 41 transitions, 167 flow [2022-12-06 06:47:40,150 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:47:40,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:47:40,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 41 transitions, 167 flow [2022-12-06 06:47:40,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 41 transitions, 167 flow [2022-12-06 06:47:40,164 INFO L130 PetriNetUnfolder]: 72/209 cut-off events. [2022-12-06 06:47:40,164 INFO L131 PetriNetUnfolder]: For 96/98 co-relation queries the response was YES. [2022-12-06 06:47:40,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 209 events. 72/209 cut-off events. For 96/98 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1057 event pairs, 16 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 160. Up to 113 conditions per place. [2022-12-06 06:47:40,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 41 transitions, 167 flow [2022-12-06 06:47:40,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-06 06:47:40,184 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:40,184 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:40,186 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:40,186 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:40,314 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_53|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_84|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_462|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_521|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_35|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_462|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet39#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] and [379] L1712-->L1712-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_11 28))) (and (= (store |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.base_19| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.base_19|) (= (store |v_#memory_int_33| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_int_33| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_3| 1))) |v_#memory_int_32|) (= (store |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.offset_19| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.offset_19|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_11, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_20|, #memory_int=|v_#memory_int_33|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_11, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_20|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_11, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, #memory_int=|v_#memory_int_32|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_11, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:47:40,317 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_53|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_84|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_462|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_521|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_35|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_462|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet39#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] and [409] L1710-1-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_17 24))) (and (= (store |v_#memory_$Pointer$.base_22| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_$Pointer$.base_22| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 (select (select |v_#memory_$Pointer$.base_21| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0))) |v_#memory_$Pointer$.base_21|) (= (store |v_#memory_$Pointer$.offset_22| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_$Pointer$.offset_22| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 (select (select |v_#memory_$Pointer$.offset_21| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0))) |v_#memory_$Pointer$.offset_21|) (= (store |v_#memory_int_39| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_int_39| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 1)) |v_#memory_int_38|))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_17, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_17, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_22|, #memory_int=|v_#memory_int_39|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_22|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_17, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_17, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_21|, #memory_int=|v_#memory_int_38|, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_7|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_21|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#t~nondet31, #memory_$Pointer$.offset] [2022-12-06 06:47:40,320 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_53|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_84|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_462|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_521|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_35|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_462|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet39#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] and [377] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 24))) (and (= (store |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 1)) |v_#memory_int_29|) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= |v_#memory_$Pointer$.offset_17| (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0)))))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:47:40,323 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_53|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_84|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_462|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_521|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_35|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_462|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_57|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet39#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] and [525] L1712-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_51 28))) (and (= |v_#memory_$Pointer$.base_115| (store |v_#memory_$Pointer$.base_116| v_my_callbackThread1of1ForFork1_~data~0.base_51 (store (select |v_#memory_$Pointer$.base_116| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0 (select (select |v_#memory_$Pointer$.base_115| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0)))) (= (store |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_51 (store (select |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem32_22| 1))) |v_#memory_int_158|) (= (store |v_#memory_$Pointer$.offset_116| v_my_callbackThread1of1ForFork1_~data~0.base_51 (store (select |v_#memory_$Pointer$.offset_116| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0 (select (select |v_#memory_$Pointer$.offset_115| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0))) |v_#memory_$Pointer$.offset_115|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_22|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_51, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_51, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_116|, #memory_int=|v_#memory_int_159|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_116|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_51, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_51, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_115|, #memory_int=|v_#memory_int_158|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_115|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:47:40,330 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:47:40,331 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 06:47:40,331 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 40 transitions, 173 flow [2022-12-06 06:47:40,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:47:40,331 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:47:40,332 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:47:40,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:47:40,332 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:47:40,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:47:40,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1473721803, now seen corresponding path program 1 times [2022-12-06 06:47:40,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:47:40,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573288999] [2022-12-06 06:47:40,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:47:40,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:47:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:47:40,358 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:47:40,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:47:40,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573288999] [2022-12-06 06:47:40,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573288999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:47:40,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:47:40,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:47:40,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957190818] [2022-12-06 06:47:40,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:47:40,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 06:47:40,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:47:40,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 06:47:40,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 06:47:40,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-06 06:47:40,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 40 transitions, 173 flow. Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 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:47:40,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:47:40,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-06 06:47:40,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:47:40,393 INFO L130 PetriNetUnfolder]: 80/189 cut-off events. [2022-12-06 06:47:40,394 INFO L131 PetriNetUnfolder]: For 232/235 co-relation queries the response was YES. [2022-12-06 06:47:40,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 189 events. 80/189 cut-off events. For 232/235 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 737 event pairs, 80 based on Foata normal form. 55/212 useless extension candidates. Maximal degree in co-relation 448. Up to 157 conditions per place. [2022-12-06 06:47:40,395 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 17 selfloop transitions, 0 changer transitions 2/23 dead transitions. [2022-12-06 06:47:40,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 104 flow [2022-12-06 06:47:40,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 06:47:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 06:47:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2022-12-06 06:47:40,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-06 06:47:40,396 INFO L175 Difference]: Start difference. First operand has 36 places, 40 transitions, 173 flow. Second operand 2 states and 36 transitions. [2022-12-06 06:47:40,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 104 flow [2022-12-06 06:47:40,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 23 transitions, 96 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 06:47:40,396 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 54 flow [2022-12-06 06:47:40,397 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2022-12-06 06:47:40,397 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -10 predicate places. [2022-12-06 06:47:40,397 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:47:40,397 INFO L89 Accepts]: Start accepts. Operand has 29 places, 21 transitions, 54 flow [2022-12-06 06:47:40,398 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:47:40,398 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:47:40,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 21 transitions, 54 flow [2022-12-06 06:47:40,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 54 flow [2022-12-06 06:47:40,402 INFO L130 PetriNetUnfolder]: 4/39 cut-off events. [2022-12-06 06:47:40,402 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:47:40,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 39 events. 4/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 4 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 34. Up to 13 conditions per place. [2022-12-06 06:47:40,403 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 54 flow [2022-12-06 06:47:40,403 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-06 06:47:40,405 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:47:40,405 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 06:47:40,405 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 54 flow [2022-12-06 06:47:40,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 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:47:40,406 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:47:40,406 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:47:40,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:47:40,406 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:47:40,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:47:40,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1922876778, now seen corresponding path program 1 times [2022-12-06 06:47:40,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:47:40,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799736290] [2022-12-06 06:47:40,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:47:40,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:47:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:47:40,911 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:47:40,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:47:40,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799736290] [2022-12-06 06:47:40,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799736290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:47:40,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:47:40,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:47:40,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457600932] [2022-12-06 06:47:40,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:47:40,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:47:40,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:47:40,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:47:40,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:47:40,913 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-06 06:47:40,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 54 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:47:40,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:47:40,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-06 06:47:40,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:47:41,005 INFO L130 PetriNetUnfolder]: 69/170 cut-off events. [2022-12-06 06:47:41,005 INFO L131 PetriNetUnfolder]: For 18/26 co-relation queries the response was YES. [2022-12-06 06:47:41,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 170 events. 69/170 cut-off events. For 18/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 655 event pairs, 29 based on Foata normal form. 12/177 useless extension candidates. Maximal degree in co-relation 93. Up to 67 conditions per place. [2022-12-06 06:47:41,006 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 26 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2022-12-06 06:47:41,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 35 transitions, 155 flow [2022-12-06 06:47:41,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:47:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:47:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 06:47:41,007 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2022-12-06 06:47:41,007 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 54 flow. Second operand 5 states and 48 transitions. [2022-12-06 06:47:41,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 35 transitions, 155 flow [2022-12-06 06:47:41,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 35 transitions, 155 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:47:41,008 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 89 flow [2022-12-06 06:47:41,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2022-12-06 06:47:41,009 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2022-12-06 06:47:41,009 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:47:41,009 INFO L89 Accepts]: Start accepts. Operand has 31 places, 25 transitions, 89 flow [2022-12-06 06:47:41,010 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:47:41,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:47:41,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 25 transitions, 89 flow [2022-12-06 06:47:41,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 25 transitions, 89 flow [2022-12-06 06:47:41,014 INFO L130 PetriNetUnfolder]: 8/54 cut-off events. [2022-12-06 06:47:41,014 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:47:41,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 54 events. 8/54 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 145 event pairs, 4 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 58. Up to 19 conditions per place. [2022-12-06 06:47:41,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 25 transitions, 89 flow [2022-12-06 06:47:41,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 06:47:41,020 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:41,020 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:41,021 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:41,022 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:47,617 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:47:47,618 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6609 [2022-12-06 06:47:47,618 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 87 flow [2022-12-06 06:47:47,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:47:47,619 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:47:47,619 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:47:47,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:47:47,619 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:47:47,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:47:47,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1748318950, now seen corresponding path program 1 times [2022-12-06 06:47:47,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:47:47,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041467528] [2022-12-06 06:47:47,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:47:47,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:47:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:47:48,198 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:47:48,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:47:48,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041467528] [2022-12-06 06:47:48,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041467528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:47:48,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:47:48,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:47:48,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868577768] [2022-12-06 06:47:48,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:47:48,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:47:48,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:47:48,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:47:48,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:47:48,201 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:47:48,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 87 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:47:48,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:47:48,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:47:48,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:47:48,392 INFO L130 PetriNetUnfolder]: 123/270 cut-off events. [2022-12-06 06:47:48,392 INFO L131 PetriNetUnfolder]: For 143/143 co-relation queries the response was YES. [2022-12-06 06:47:48,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 270 events. 123/270 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1108 event pairs, 20 based on Foata normal form. 0/269 useless extension candidates. Maximal degree in co-relation 212. Up to 119 conditions per place. [2022-12-06 06:47:48,394 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 47 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2022-12-06 06:47:48,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 56 transitions, 320 flow [2022-12-06 06:47:48,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:47:48,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:47:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-12-06 06:47:48,410 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 06:47:48,410 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 87 flow. Second operand 6 states and 48 transitions. [2022-12-06 06:47:48,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 56 transitions, 320 flow [2022-12-06 06:47:48,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 56 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:47:48,412 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 128 flow [2022-12-06 06:47:48,412 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2022-12-06 06:47:48,414 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2022-12-06 06:47:48,414 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:47:48,415 INFO L89 Accepts]: Start accepts. Operand has 36 places, 27 transitions, 128 flow [2022-12-06 06:47:48,416 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:47:48,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:47:48,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 27 transitions, 128 flow [2022-12-06 06:47:48,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 27 transitions, 128 flow [2022-12-06 06:47:48,423 INFO L130 PetriNetUnfolder]: 16/92 cut-off events. [2022-12-06 06:47:48,423 INFO L131 PetriNetUnfolder]: For 46/48 co-relation queries the response was YES. [2022-12-06 06:47:48,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 92 events. 16/92 cut-off events. For 46/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 373 event pairs, 10 based on Foata normal form. 2/92 useless extension candidates. Maximal degree in co-relation 86. Up to 30 conditions per place. [2022-12-06 06:47:48,424 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 27 transitions, 128 flow [2022-12-06 06:47:48,424 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-06 06:47:48,640 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:47:48,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 06:47:48,641 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 128 flow [2022-12-06 06:47:48,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:47:48,641 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:47:48,641 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:47:48,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:47:48,641 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:47:48,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:47:48,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1615110756, now seen corresponding path program 1 times [2022-12-06 06:47:48,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:47:48,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301325687] [2022-12-06 06:47:48,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:47:48,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:47:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:47:50,300 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:47:50,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:47:50,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301325687] [2022-12-06 06:47:50,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301325687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:47:50,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:47:50,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-06 06:47:50,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621144174] [2022-12-06 06:47:50,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:47:50,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 06:47:50,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:47:50,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 06:47:50,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-06 06:47:50,302 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:47:50,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 128 flow. Second operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:47:50,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:47:50,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:47:50,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:47:51,264 INFO L130 PetriNetUnfolder]: 173/381 cut-off events. [2022-12-06 06:47:51,264 INFO L131 PetriNetUnfolder]: For 448/448 co-relation queries the response was YES. [2022-12-06 06:47:51,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 381 events. 173/381 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1695 event pairs, 38 based on Foata normal form. 1/381 useless extension candidates. Maximal degree in co-relation 338. Up to 241 conditions per place. [2022-12-06 06:47:51,266 INFO L137 encePairwiseOnDemand]: 5/20 looper letters, 52 selfloop transitions, 25 changer transitions 18/95 dead transitions. [2022-12-06 06:47:51,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 95 transitions, 647 flow [2022-12-06 06:47:51,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 06:47:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 06:47:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 81 transitions. [2022-12-06 06:47:51,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27 [2022-12-06 06:47:51,269 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 128 flow. Second operand 15 states and 81 transitions. [2022-12-06 06:47:51,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 95 transitions, 647 flow [2022-12-06 06:47:51,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 95 transitions, 618 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:47:51,271 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 400 flow [2022-12-06 06:47:51,272 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=400, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2022-12-06 06:47:51,272 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 17 predicate places. [2022-12-06 06:47:51,272 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:47:51,272 INFO L89 Accepts]: Start accepts. Operand has 56 places, 53 transitions, 400 flow [2022-12-06 06:47:51,273 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:47:51,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:47:51,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 53 transitions, 400 flow [2022-12-06 06:47:51,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 53 transitions, 400 flow [2022-12-06 06:47:51,302 INFO L130 PetriNetUnfolder]: 32/157 cut-off events. [2022-12-06 06:47:51,302 INFO L131 PetriNetUnfolder]: For 210/213 co-relation queries the response was YES. [2022-12-06 06:47:51,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 157 events. 32/157 cut-off events. For 210/213 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 827 event pairs, 1 based on Foata normal form. 2/155 useless extension candidates. Maximal degree in co-relation 492. Up to 54 conditions per place. [2022-12-06 06:47:51,304 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 53 transitions, 400 flow [2022-12-06 06:47:51,304 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 06:47:51,328 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:51,329 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:51,330 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:51,330 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:51,332 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:51,332 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:51,333 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:51,334 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:51,334 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L1711-1-->L1712: Formula: (= |v_my_callbackThread1of1ForFork1_#t~mem32_1| (select (select |v_#memory_int_31| v_my_callbackThread1of1ForFork1_~data~0.base_9) (+ v_my_callbackThread1of1ForFork1_~data~0.offset_9 28))) InVars {#memory_int=|v_#memory_int_31|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_9, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_9} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_1|, #memory_int=|v_#memory_int_31|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_9, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_9} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32] and [584] $Ultimate##0-->L1711-1: Formula: (let ((.cse1 (select |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_146 24))) (and (= v_my_callbackThread1of1ForFork0_~dev~0.offset_32 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= (store |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 1)) |v_#memory_int_575|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 |v_my_callbackThread1of1ForFork0_#in~arg.offset_24|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~arg.base_32) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_24| v_my_callbackThread1of1ForFork0_~arg.base_32) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= v_my_callbackThread1of1ForFork0_~data~0.base_146 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= (select .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146) 0) (= |v_#memory_$Pointer$.base_514| (store |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.base_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0)))) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 v_my_callbackThread1of1ForFork0_~dev~0.offset_32) (= |v_#pthreadsMutex_180| (store |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146 1))) (= (store |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.offset_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0))) |v_#memory_$Pointer$.offset_514|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_181|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_515|, #memory_int=|v_#memory_int_576|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_515|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_180|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_514|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_32, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_36|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_146, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_146, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_32, #memory_int=|v_#memory_int_575|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_30, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_32, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_32, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_514|} AuxVars[] AssignedVars[#pthreadsMutex, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] [2022-12-06 06:47:51,414 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L1711-1-->L1712: Formula: (= |v_my_callbackThread1of1ForFork1_#t~mem32_1| (select (select |v_#memory_int_31| v_my_callbackThread1of1ForFork1_~data~0.base_9) (+ v_my_callbackThread1of1ForFork1_~data~0.offset_9 28))) InVars {#memory_int=|v_#memory_int_31|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_9, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_9} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_1|, #memory_int=|v_#memory_int_31|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_9, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_9} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32] and [584] $Ultimate##0-->L1711-1: Formula: (let ((.cse1 (select |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_146 24))) (and (= v_my_callbackThread1of1ForFork0_~dev~0.offset_32 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= (store |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 1)) |v_#memory_int_575|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 |v_my_callbackThread1of1ForFork0_#in~arg.offset_24|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~arg.base_32) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_24| v_my_callbackThread1of1ForFork0_~arg.base_32) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= v_my_callbackThread1of1ForFork0_~data~0.base_146 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= (select .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146) 0) (= |v_#memory_$Pointer$.base_514| (store |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.base_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0)))) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 v_my_callbackThread1of1ForFork0_~dev~0.offset_32) (= |v_#pthreadsMutex_180| (store |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146 1))) (= (store |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.offset_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0))) |v_#memory_$Pointer$.offset_514|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_181|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_515|, #memory_int=|v_#memory_int_576|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_515|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_180|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_514|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_32, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_36|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_146, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_146, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_32, #memory_int=|v_#memory_int_575|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_30, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_32, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_32, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_514|} AuxVars[] AssignedVars[#pthreadsMutex, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] [2022-12-06 06:47:51,654 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85))) (and (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_9|) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_85 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 v_my_callbackThread1of1ForFork1_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork1_~data~0.base_85 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~arg.base_13) (= (store |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85 1)) |v_#pthreadsMutex_125|) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85) 0) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_15 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_126|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_125|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_85, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_85, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_27, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_15, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_15, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~dev~0.base] and [584] $Ultimate##0-->L1711-1: Formula: (let ((.cse1 (select |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_146 24))) (and (= v_my_callbackThread1of1ForFork0_~dev~0.offset_32 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= (store |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 1)) |v_#memory_int_575|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 |v_my_callbackThread1of1ForFork0_#in~arg.offset_24|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~arg.base_32) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_24| v_my_callbackThread1of1ForFork0_~arg.base_32) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= v_my_callbackThread1of1ForFork0_~data~0.base_146 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= (select .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146) 0) (= |v_#memory_$Pointer$.base_514| (store |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.base_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0)))) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 v_my_callbackThread1of1ForFork0_~dev~0.offset_32) (= |v_#pthreadsMutex_180| (store |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146 1))) (= (store |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.offset_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0))) |v_#memory_$Pointer$.offset_514|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_181|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_515|, #memory_int=|v_#memory_int_576|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_515|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_180|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_514|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_32, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_36|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_146, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_146, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_32, #memory_int=|v_#memory_int_575|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_30, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_32, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_32, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_514|} AuxVars[] AssignedVars[#pthreadsMutex, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] [2022-12-06 06:47:51,861 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85))) (and (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_9|) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_85 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 v_my_callbackThread1of1ForFork1_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork1_~data~0.base_85 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~arg.base_13) (= (store |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85 1)) |v_#pthreadsMutex_125|) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85) 0) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_15 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_126|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_125|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_85, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_85, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_27, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_15, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_15, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~dev~0.base] and [584] $Ultimate##0-->L1711-1: Formula: (let ((.cse1 (select |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_146 24))) (and (= v_my_callbackThread1of1ForFork0_~dev~0.offset_32 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= (store |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 1)) |v_#memory_int_575|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 |v_my_callbackThread1of1ForFork0_#in~arg.offset_24|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~arg.base_32) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_24| v_my_callbackThread1of1ForFork0_~arg.base_32) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= v_my_callbackThread1of1ForFork0_~data~0.base_146 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= (select .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146) 0) (= |v_#memory_$Pointer$.base_514| (store |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.base_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0)))) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 v_my_callbackThread1of1ForFork0_~dev~0.offset_32) (= |v_#pthreadsMutex_180| (store |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146 1))) (= (store |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.offset_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0))) |v_#memory_$Pointer$.offset_514|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_181|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_515|, #memory_int=|v_#memory_int_576|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_515|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_180|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_514|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_32, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_36|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_146, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_146, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_32, #memory_int=|v_#memory_int_575|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_30, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_32, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_32, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_514|} AuxVars[] AssignedVars[#pthreadsMutex, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] [2022-12-06 06:47:54,445 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:47:54,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3174 [2022-12-06 06:47:54,446 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 416 flow [2022-12-06 06:47:54,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:47:54,447 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:47:54,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:47:54,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:47:54,447 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:47:54,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:47:54,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1669920330, now seen corresponding path program 1 times [2022-12-06 06:47:54,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:47:54,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645324624] [2022-12-06 06:47:54,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:47:54,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:47:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:47:54,745 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:47:54,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:47:54,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645324624] [2022-12-06 06:47:54,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645324624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:47:54,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:47:54,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:47:54,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526531928] [2022-12-06 06:47:54,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:47:54,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:47:54,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:47:54,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:47:54,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:47:54,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 06:47:54,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 416 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:47:54,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:47:54,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 06:47:54,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:47:54,894 INFO L130 PetriNetUnfolder]: 77/214 cut-off events. [2022-12-06 06:47:54,895 INFO L131 PetriNetUnfolder]: For 548/570 co-relation queries the response was YES. [2022-12-06 06:47:54,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 214 events. 77/214 cut-off events. For 548/570 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1009 event pairs, 22 based on Foata normal form. 14/216 useless extension candidates. Maximal degree in co-relation 843. Up to 125 conditions per place. [2022-12-06 06:47:54,896 INFO L137 encePairwiseOnDemand]: 15/25 looper letters, 40 selfloop transitions, 9 changer transitions 0/54 dead transitions. [2022-12-06 06:47:54,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 477 flow [2022-12-06 06:47:54,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:47:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:47:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-06 06:47:54,897 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36 [2022-12-06 06:47:54,897 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 416 flow. Second operand 5 states and 45 transitions. [2022-12-06 06:47:54,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 477 flow [2022-12-06 06:47:54,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 425 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-06 06:47:54,899 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 309 flow [2022-12-06 06:47:54,899 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=309, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2022-12-06 06:47:54,900 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2022-12-06 06:47:54,900 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:47:54,900 INFO L89 Accepts]: Start accepts. Operand has 51 places, 45 transitions, 309 flow [2022-12-06 06:47:54,901 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:47:54,901 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:47:54,901 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 45 transitions, 309 flow [2022-12-06 06:47:54,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 45 transitions, 309 flow [2022-12-06 06:47:54,947 INFO L130 PetriNetUnfolder]: 23/128 cut-off events. [2022-12-06 06:47:54,947 INFO L131 PetriNetUnfolder]: For 219/221 co-relation queries the response was YES. [2022-12-06 06:47:54,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 128 events. 23/128 cut-off events. For 219/221 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 633 event pairs, 4 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 248. Up to 27 conditions per place. [2022-12-06 06:47:54,948 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 45 transitions, 309 flow [2022-12-06 06:47:54,948 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-06 06:47:54,959 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:47:54,959 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-06 06:47:54,959 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 309 flow [2022-12-06 06:47:54,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:47:54,960 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:47:54,960 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:47:54,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:47:54,960 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:47:54,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:47:54,960 INFO L85 PathProgramCache]: Analyzing trace with hash 477767222, now seen corresponding path program 1 times [2022-12-06 06:47:54,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:47:54,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581711181] [2022-12-06 06:47:54,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:47:54,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:47:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:47:56,572 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:47:56,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:47:56,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581711181] [2022-12-06 06:47:56,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581711181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:47:56,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:47:56,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 06:47:56,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522581859] [2022-12-06 06:47:56,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:47:56,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 06:47:56,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:47:56,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 06:47:56,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-12-06 06:47:56,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:47:56,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 309 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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:47:56,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:47:56,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:47:56,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:47:57,212 INFO L130 PetriNetUnfolder]: 144/339 cut-off events. [2022-12-06 06:47:57,212 INFO L131 PetriNetUnfolder]: For 769/769 co-relation queries the response was YES. [2022-12-06 06:47:57,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1312 conditions, 339 events. 144/339 cut-off events. For 769/769 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1549 event pairs, 75 based on Foata normal form. 1/339 useless extension candidates. Maximal degree in co-relation 782. Up to 282 conditions per place. [2022-12-06 06:47:57,214 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 44 selfloop transitions, 10 changer transitions 25/79 dead transitions. [2022-12-06 06:47:57,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 642 flow [2022-12-06 06:47:57,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 06:47:57,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 06:47:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-12-06 06:47:57,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21245421245421245 [2022-12-06 06:47:57,215 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 309 flow. Second operand 13 states and 58 transitions. [2022-12-06 06:47:57,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 642 flow [2022-12-06 06:47:57,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 79 transitions, 627 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 06:47:57,218 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 359 flow [2022-12-06 06:47:57,219 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=359, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2022-12-06 06:47:57,219 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 29 predicate places. [2022-12-06 06:47:57,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:47:57,219 INFO L89 Accepts]: Start accepts. Operand has 68 places, 47 transitions, 359 flow [2022-12-06 06:47:57,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:47:57,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:47:57,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 47 transitions, 359 flow [2022-12-06 06:47:57,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 47 transitions, 359 flow [2022-12-06 06:47:57,234 INFO L130 PetriNetUnfolder]: 26/132 cut-off events. [2022-12-06 06:47:57,234 INFO L131 PetriNetUnfolder]: For 282/287 co-relation queries the response was YES. [2022-12-06 06:47:57,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 132 events. 26/132 cut-off events. For 282/287 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 645 event pairs, 4 based on Foata normal form. 2/132 useless extension candidates. Maximal degree in co-relation 460. Up to 27 conditions per place. [2022-12-06 06:47:57,235 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 47 transitions, 359 flow [2022-12-06 06:47:57,235 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 06:47:57,257 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:47:57,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 06:47:57,258 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 359 flow [2022-12-06 06:47:57,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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:47:57,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:47:57,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:47:57,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:47:57,259 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:47:57,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:47:57,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1181307190, now seen corresponding path program 2 times [2022-12-06 06:47:57,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:47:57,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662428972] [2022-12-06 06:47:57,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:47:57,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:47:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:47:58,451 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:47:58,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:47:58,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662428972] [2022-12-06 06:47:58,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662428972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:47:58,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:47:58,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 06:47:58,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389420817] [2022-12-06 06:47:58,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:47:58,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 06:47:58,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:47:58,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 06:47:58,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-06 06:47:58,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:47:58,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 359 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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:47:58,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:47:58,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:47:58,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:47:59,194 INFO L130 PetriNetUnfolder]: 154/358 cut-off events. [2022-12-06 06:47:59,194 INFO L131 PetriNetUnfolder]: For 1054/1054 co-relation queries the response was YES. [2022-12-06 06:47:59,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1552 conditions, 358 events. 154/358 cut-off events. For 1054/1054 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1662 event pairs, 79 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 1525. Up to 291 conditions per place. [2022-12-06 06:47:59,197 INFO L137 encePairwiseOnDemand]: 7/21 looper letters, 62 selfloop transitions, 25 changer transitions 0/87 dead transitions. [2022-12-06 06:47:59,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 766 flow [2022-12-06 06:47:59,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 06:47:59,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 06:47:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-12-06 06:47:59,198 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23443223443223443 [2022-12-06 06:47:59,198 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 359 flow. Second operand 13 states and 64 transitions. [2022-12-06 06:47:59,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 766 flow [2022-12-06 06:47:59,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 712 flow, removed 16 selfloop flow, removed 10 redundant places. [2022-12-06 06:47:59,202 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 534 flow [2022-12-06 06:47:59,202 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=534, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2022-12-06 06:47:59,203 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 32 predicate places. [2022-12-06 06:47:59,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:47:59,204 INFO L89 Accepts]: Start accepts. Operand has 71 places, 63 transitions, 534 flow [2022-12-06 06:47:59,205 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:47:59,205 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:47:59,205 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 63 transitions, 534 flow [2022-12-06 06:47:59,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 63 transitions, 534 flow [2022-12-06 06:47:59,223 INFO L130 PetriNetUnfolder]: 31/160 cut-off events. [2022-12-06 06:47:59,223 INFO L131 PetriNetUnfolder]: For 455/463 co-relation queries the response was YES. [2022-12-06 06:47:59,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 160 events. 31/160 cut-off events. For 455/463 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 854 event pairs, 4 based on Foata normal form. 2/160 useless extension candidates. Maximal degree in co-relation 583. Up to 37 conditions per place. [2022-12-06 06:47:59,224 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 63 transitions, 534 flow [2022-12-06 06:47:59,224 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-06 06:47:59,229 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [379] L1712-->L1712-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_11 28))) (and (= (store |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.base_19| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.base_19|) (= (store |v_#memory_int_33| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_int_33| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_3| 1))) |v_#memory_int_32|) (= (store |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.offset_19| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.offset_19|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_11, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_20|, #memory_int=|v_#memory_int_33|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_11, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_20|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_11, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, #memory_int=|v_#memory_int_32|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_11, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:47:59,339 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [378] L1711-1-->L1712: Formula: (= |v_my_callbackThread1of1ForFork0_#t~mem32_1| (select (select |v_#memory_int_31| v_my_callbackThread1of1ForFork0_~data~0.base_9) (+ v_my_callbackThread1of1ForFork0_~data~0.offset_9 28))) InVars {#memory_int=|v_#memory_int_31|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_9, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_9} OutVars{#memory_int=|v_#memory_int_31|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_9, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_1|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_9} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_#t~mem32] [2022-12-06 06:47:59,600 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:47:59,600 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 397 [2022-12-06 06:47:59,600 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 569 flow [2022-12-06 06:47:59,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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:47:59,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:47:59,601 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:47:59,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:47:59,601 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:47:59,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:47:59,601 INFO L85 PathProgramCache]: Analyzing trace with hash -310924648, now seen corresponding path program 3 times [2022-12-06 06:47:59,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:47:59,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246867402] [2022-12-06 06:47:59,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:47:59,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:47:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:00,657 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:48:00,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:00,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246867402] [2022-12-06 06:48:00,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246867402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:00,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:00,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 06:48:00,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830667382] [2022-12-06 06:48:00,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:00,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:48:00,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:00,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:48:00,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:48:00,658 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:48:00,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 569 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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:48:00,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:00,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:48:00,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:01,254 INFO L130 PetriNetUnfolder]: 175/418 cut-off events. [2022-12-06 06:48:01,254 INFO L131 PetriNetUnfolder]: For 1577/1577 co-relation queries the response was YES. [2022-12-06 06:48:01,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1921 conditions, 418 events. 175/418 cut-off events. For 1577/1577 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2129 event pairs, 76 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 1840. Up to 305 conditions per place. [2022-12-06 06:48:01,257 INFO L137 encePairwiseOnDemand]: 9/25 looper letters, 56 selfloop transitions, 24 changer transitions 25/105 dead transitions. [2022-12-06 06:48:01,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 105 transitions, 1047 flow [2022-12-06 06:48:01,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 06:48:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 06:48:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. [2022-12-06 06:48:01,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22666666666666666 [2022-12-06 06:48:01,261 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 569 flow. Second operand 12 states and 68 transitions. [2022-12-06 06:48:01,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 105 transitions, 1047 flow [2022-12-06 06:48:01,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 105 transitions, 1002 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-06 06:48:01,268 INFO L231 Difference]: Finished difference. Result has 86 places, 67 transitions, 646 flow [2022-12-06 06:48:01,268 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=646, PETRI_PLACES=86, PETRI_TRANSITIONS=67} [2022-12-06 06:48:01,269 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 47 predicate places. [2022-12-06 06:48:01,269 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:01,269 INFO L89 Accepts]: Start accepts. Operand has 86 places, 67 transitions, 646 flow [2022-12-06 06:48:01,270 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:01,270 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:01,270 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 67 transitions, 646 flow [2022-12-06 06:48:01,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 67 transitions, 646 flow [2022-12-06 06:48:01,286 INFO L130 PetriNetUnfolder]: 34/181 cut-off events. [2022-12-06 06:48:01,286 INFO L131 PetriNetUnfolder]: For 706/717 co-relation queries the response was YES. [2022-12-06 06:48:01,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 181 events. 34/181 cut-off events. For 706/717 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1038 event pairs, 4 based on Foata normal form. 5/183 useless extension candidates. Maximal degree in co-relation 741. Up to 42 conditions per place. [2022-12-06 06:48:01,287 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 67 transitions, 646 flow [2022-12-06 06:48:01,288 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-06 06:48:01,463 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:48:01,463 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 06:48:01,463 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 642 flow [2022-12-06 06:48:01,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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:48:01,464 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:01,464 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:01,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:48:01,464 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:48:01,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:01,464 INFO L85 PathProgramCache]: Analyzing trace with hash 165739536, now seen corresponding path program 1 times [2022-12-06 06:48:01,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:01,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505133962] [2022-12-06 06:48:01,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:01,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:01,910 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:48:01,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:01,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505133962] [2022-12-06 06:48:01,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505133962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:01,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:01,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 06:48:01,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812965154] [2022-12-06 06:48:01,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:01,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 06:48:01,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:01,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 06:48:01,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 06:48:01,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:48:01,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 642 flow. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:48:01,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:01,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:48:01,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:02,252 INFO L130 PetriNetUnfolder]: 166/416 cut-off events. [2022-12-06 06:48:02,253 INFO L131 PetriNetUnfolder]: For 2147/2147 co-relation queries the response was YES. [2022-12-06 06:48:02,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2110 conditions, 416 events. 166/416 cut-off events. For 2147/2147 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2135 event pairs, 16 based on Foata normal form. 1/416 useless extension candidates. Maximal degree in co-relation 2070. Up to 149 conditions per place. [2022-12-06 06:48:02,256 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 66 selfloop transitions, 36 changer transitions 5/107 dead transitions. [2022-12-06 06:48:02,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 107 transitions, 1167 flow [2022-12-06 06:48:02,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 06:48:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 06:48:02,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2022-12-06 06:48:02,257 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24 [2022-12-06 06:48:02,257 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 642 flow. Second operand 11 states and 66 transitions. [2022-12-06 06:48:02,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 107 transitions, 1167 flow [2022-12-06 06:48:02,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 107 transitions, 1094 flow, removed 28 selfloop flow, removed 9 redundant places. [2022-12-06 06:48:02,265 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 727 flow [2022-12-06 06:48:02,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=727, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2022-12-06 06:48:02,266 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 45 predicate places. [2022-12-06 06:48:02,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:02,266 INFO L89 Accepts]: Start accepts. Operand has 84 places, 70 transitions, 727 flow [2022-12-06 06:48:02,267 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:02,268 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:02,268 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 70 transitions, 727 flow [2022-12-06 06:48:02,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 70 transitions, 727 flow [2022-12-06 06:48:02,285 INFO L130 PetriNetUnfolder]: 38/195 cut-off events. [2022-12-06 06:48:02,285 INFO L131 PetriNetUnfolder]: For 882/897 co-relation queries the response was YES. [2022-12-06 06:48:02,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 195 events. 38/195 cut-off events. For 882/897 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1094 event pairs, 7 based on Foata normal form. 4/194 useless extension candidates. Maximal degree in co-relation 821. Up to 44 conditions per place. [2022-12-06 06:48:02,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 70 transitions, 727 flow [2022-12-06 06:48:02,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-06 06:48:02,294 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:02,300 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-06 06:48:02,306 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85))) (and (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_9|) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_85 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 v_my_callbackThread1of1ForFork1_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork1_~data~0.base_85 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~arg.base_13) (= (store |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85 1)) |v_#pthreadsMutex_125|) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85) 0) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_15 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_126|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_125|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_85, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_85, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_27, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_15, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_15, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~dev~0.base] and [575] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_354| |v_ULTIMATE.start_main_~#data~1#1.base_135|))) (and (= (store |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|)) |v_#memory_$Pointer$.base_300|) (= |v_#memory_int_354| (store |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| (select (select |v_#memory_int_354| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|)))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_55|) 1 0)) (= |v_ULTIMATE.start_main_#t~mem47#1_55| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 28))) (not (= 0 (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 24)) 1) 1 0))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| |v_ULTIMATE.start_ldv_assert_~expression#1_203|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_203| 0) (= |v_#valid_144| (store |v_#valid_145| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| 0)) (= |v_#memory_$Pointer$.offset_300| (store |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_301|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|, #valid=|v_#valid_145|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, #memory_int=|v_#memory_int_355|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_301|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_203|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_300|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_40|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_163|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_63|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_354|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_300|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_main_#t~mem47#1, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~mem46#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:48:02,481 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:48:02,482 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-06 06:48:02,482 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 747 flow [2022-12-06 06:48:02,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:48:02,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:02,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:02,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:48:02,483 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:48:02,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:02,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1397058242, now seen corresponding path program 4 times [2022-12-06 06:48:02,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:02,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879414577] [2022-12-06 06:48:02,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:02,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:03,505 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:48:03,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:03,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879414577] [2022-12-06 06:48:03,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879414577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:03,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:03,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 06:48:03,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861672234] [2022-12-06 06:48:03,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:03,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:48:03,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:03,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:48:03,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:48:03,506 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:48:03,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 747 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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:48:03,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:03,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:48:03,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:04,034 INFO L130 PetriNetUnfolder]: 188/477 cut-off events. [2022-12-06 06:48:04,035 INFO L131 PetriNetUnfolder]: For 2514/2514 co-relation queries the response was YES. [2022-12-06 06:48:04,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2372 conditions, 477 events. 188/477 cut-off events. For 2514/2514 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2516 event pairs, 121 based on Foata normal form. 2/478 useless extension candidates. Maximal degree in co-relation 2327. Up to 410 conditions per place. [2022-12-06 06:48:04,037 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 57 selfloop transitions, 11 changer transitions 28/96 dead transitions. [2022-12-06 06:48:04,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 96 transitions, 1098 flow [2022-12-06 06:48:04,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 06:48:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 06:48:04,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-12-06 06:48:04,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21014492753623187 [2022-12-06 06:48:04,038 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 747 flow. Second operand 12 states and 58 transitions. [2022-12-06 06:48:04,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 96 transitions, 1098 flow [2022-12-06 06:48:04,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 96 transitions, 1018 flow, removed 17 selfloop flow, removed 8 redundant places. [2022-12-06 06:48:04,045 INFO L231 Difference]: Finished difference. Result has 92 places, 65 transitions, 636 flow [2022-12-06 06:48:04,045 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=636, PETRI_PLACES=92, PETRI_TRANSITIONS=65} [2022-12-06 06:48:04,045 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 53 predicate places. [2022-12-06 06:48:04,045 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:04,045 INFO L89 Accepts]: Start accepts. Operand has 92 places, 65 transitions, 636 flow [2022-12-06 06:48:04,046 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:04,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:04,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 65 transitions, 636 flow [2022-12-06 06:48:04,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 65 transitions, 636 flow [2022-12-06 06:48:04,082 INFO L130 PetriNetUnfolder]: 26/161 cut-off events. [2022-12-06 06:48:04,082 INFO L131 PetriNetUnfolder]: For 709/714 co-relation queries the response was YES. [2022-12-06 06:48:04,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 161 events. 26/161 cut-off events. For 709/714 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 873 event pairs, 5 based on Foata normal form. 2/161 useless extension candidates. Maximal degree in co-relation 679. Up to 35 conditions per place. [2022-12-06 06:48:04,084 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 65 transitions, 636 flow [2022-12-06 06:48:04,084 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 06:48:04,093 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:04,093 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:04,094 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:04,095 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:04,226 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:48:04,227 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 06:48:04,227 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 64 transitions, 630 flow [2022-12-06 06:48:04,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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:48:04,227 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:04,227 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:04,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:48:04,228 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:48:04,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:04,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1593881406, now seen corresponding path program 1 times [2022-12-06 06:48:04,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:04,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506118005] [2022-12-06 06:48:04,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:04,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:05,174 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:48:05,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:05,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506118005] [2022-12-06 06:48:05,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506118005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:05,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:05,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 06:48:05,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946634289] [2022-12-06 06:48:05,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:05,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 06:48:05,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:05,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 06:48:05,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-12-06 06:48:05,176 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:48:05,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 64 transitions, 630 flow. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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:48:05,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:05,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:48:05,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:05,626 INFO L130 PetriNetUnfolder]: 153/383 cut-off events. [2022-12-06 06:48:05,626 INFO L131 PetriNetUnfolder]: For 1961/1961 co-relation queries the response was YES. [2022-12-06 06:48:05,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 383 events. 153/383 cut-off events. For 1961/1961 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1881 event pairs, 90 based on Foata normal form. 1/383 useless extension candidates. Maximal degree in co-relation 1912. Up to 319 conditions per place. [2022-12-06 06:48:05,629 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 60 selfloop transitions, 20 changer transitions 10/90 dead transitions. [2022-12-06 06:48:05,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 1002 flow [2022-12-06 06:48:05,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 06:48:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 06:48:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-12-06 06:48:05,630 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21014492753623187 [2022-12-06 06:48:05,630 INFO L175 Difference]: Start difference. First operand has 83 places, 64 transitions, 630 flow. Second operand 12 states and 58 transitions. [2022-12-06 06:48:05,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 90 transitions, 1002 flow [2022-12-06 06:48:05,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 90 transitions, 932 flow, removed 23 selfloop flow, removed 11 redundant places. [2022-12-06 06:48:05,636 INFO L231 Difference]: Finished difference. Result has 88 places, 68 transitions, 664 flow [2022-12-06 06:48:05,636 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=664, PETRI_PLACES=88, PETRI_TRANSITIONS=68} [2022-12-06 06:48:05,636 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 49 predicate places. [2022-12-06 06:48:05,636 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:05,636 INFO L89 Accepts]: Start accepts. Operand has 88 places, 68 transitions, 664 flow [2022-12-06 06:48:05,637 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:05,637 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:05,637 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 68 transitions, 664 flow [2022-12-06 06:48:05,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 68 transitions, 664 flow [2022-12-06 06:48:05,676 INFO L130 PetriNetUnfolder]: 27/170 cut-off events. [2022-12-06 06:48:05,676 INFO L131 PetriNetUnfolder]: For 684/691 co-relation queries the response was YES. [2022-12-06 06:48:05,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 170 events. 27/170 cut-off events. For 684/691 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 932 event pairs, 5 based on Foata normal form. 4/172 useless extension candidates. Maximal degree in co-relation 691. Up to 36 conditions per place. [2022-12-06 06:48:05,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 68 transitions, 664 flow [2022-12-06 06:48:05,677 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 06:48:05,682 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:05,682 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-06 06:48:05,689 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [575] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_354| |v_ULTIMATE.start_main_~#data~1#1.base_135|))) (and (= (store |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|)) |v_#memory_$Pointer$.base_300|) (= |v_#memory_int_354| (store |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| (select (select |v_#memory_int_354| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|)))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_55|) 1 0)) (= |v_ULTIMATE.start_main_#t~mem47#1_55| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 28))) (not (= 0 (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 24)) 1) 1 0))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| |v_ULTIMATE.start_ldv_assert_~expression#1_203|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_203| 0) (= |v_#valid_144| (store |v_#valid_145| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| 0)) (= |v_#memory_$Pointer$.offset_300| (store |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_301|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|, #valid=|v_#valid_145|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, #memory_int=|v_#memory_int_355|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_301|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_203|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_300|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_40|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_163|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_63|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_354|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_300|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_main_#t~mem47#1, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~mem46#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:48:06,167 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [461] L1735-1-->L1735-3: Formula: (and (= (store |v_#memory_$Pointer$.base_67| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17| (store (select |v_#memory_$Pointer$.base_67| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_14|)) |v_#memory_$Pointer$.base_66|) (= (store |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_67| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_14|)) |v_#memory_$Pointer$.offset_66|) (= |v_#memory_int_90| (store |v_#memory_int_91| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17| (store (select |v_#memory_int_91| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15| (select (select |v_#memory_int_90| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_14|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_67|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_14|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|, #memory_int=|v_#memory_int_91|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_67|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_10|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_15|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_14|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_66|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_14|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_17|, #memory_int=|v_#memory_int_90|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_66|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] and [558] L1712-1-->my_callbackEXIT: Formula: (and (= |v_my_callbackThread1of1ForFork0_#res.base_13| 0) (= |v_#pthreadsMutex_121| (store |v_#pthreadsMutex_122| v_my_callbackThread1of1ForFork0_~data~0.base_71 (store (select |v_#pthreadsMutex_122| v_my_callbackThread1of1ForFork0_~data~0.base_71) v_my_callbackThread1of1ForFork0_~data~0.offset_71 0))) (= |v_my_callbackThread1of1ForFork0_#res.offset_13| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_71, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_71} OutVars{#pthreadsMutex=|v_#pthreadsMutex_121|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_71, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_13|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_25|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_13|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_71} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, my_callbackThread1of1ForFork0_#res.offset] [2022-12-06 06:48:06,614 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:48:06,614 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 978 [2022-12-06 06:48:06,614 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 67 transitions, 692 flow [2022-12-06 06:48:06,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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:48:06,615 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:06,615 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:06,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:48:06,615 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:48:06,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:06,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1333595062, now seen corresponding path program 1 times [2022-12-06 06:48:06,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:06,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667918153] [2022-12-06 06:48:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:06,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:07,427 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:48:07,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:07,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667918153] [2022-12-06 06:48:07,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667918153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:07,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:07,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 06:48:07,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864061272] [2022-12-06 06:48:07,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:07,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 06:48:07,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:07,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 06:48:07,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-06 06:48:07,429 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 06:48:07,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 67 transitions, 692 flow. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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:48:07,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:07,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 06:48:07,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:07,834 INFO L130 PetriNetUnfolder]: 133/343 cut-off events. [2022-12-06 06:48:07,835 INFO L131 PetriNetUnfolder]: For 1766/1766 co-relation queries the response was YES. [2022-12-06 06:48:07,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1783 conditions, 343 events. 133/343 cut-off events. For 1766/1766 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1649 event pairs, 87 based on Foata normal form. 1/343 useless extension candidates. Maximal degree in co-relation 1746. Up to 301 conditions per place. [2022-12-06 06:48:07,837 INFO L137 encePairwiseOnDemand]: 14/27 looper letters, 50 selfloop transitions, 12 changer transitions 11/73 dead transitions. [2022-12-06 06:48:07,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 73 transitions, 861 flow [2022-12-06 06:48:07,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 06:48:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 06:48:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2022-12-06 06:48:07,838 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1934156378600823 [2022-12-06 06:48:07,838 INFO L175 Difference]: Start difference. First operand has 85 places, 67 transitions, 692 flow. Second operand 9 states and 47 transitions. [2022-12-06 06:48:07,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 73 transitions, 861 flow [2022-12-06 06:48:07,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 73 transitions, 807 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-12-06 06:48:07,844 INFO L231 Difference]: Finished difference. Result has 87 places, 57 transitions, 535 flow [2022-12-06 06:48:07,844 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=535, PETRI_PLACES=87, PETRI_TRANSITIONS=57} [2022-12-06 06:48:07,845 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 48 predicate places. [2022-12-06 06:48:07,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:07,845 INFO L89 Accepts]: Start accepts. Operand has 87 places, 57 transitions, 535 flow [2022-12-06 06:48:07,845 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:07,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:07,846 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 57 transitions, 535 flow [2022-12-06 06:48:07,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 57 transitions, 535 flow [2022-12-06 06:48:07,859 INFO L130 PetriNetUnfolder]: 22/142 cut-off events. [2022-12-06 06:48:07,859 INFO L131 PetriNetUnfolder]: For 529/534 co-relation queries the response was YES. [2022-12-06 06:48:07,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 142 events. 22/142 cut-off events. For 529/534 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 711 event pairs, 5 based on Foata normal form. 2/142 useless extension candidates. Maximal degree in co-relation 573. Up to 29 conditions per place. [2022-12-06 06:48:07,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 57 transitions, 535 flow [2022-12-06 06:48:07,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 06:48:07,861 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [604] L1711-1-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_243 28))) (and (= |v_my_callbackThread1of1ForFork0_#res.base_33| 0) (= (store |v_#pthreadsMutex_253| v_my_callbackThread1of1ForFork0_~data~0.base_243 (store (select |v_#pthreadsMutex_253| v_my_callbackThread1of1ForFork0_~data~0.base_243) v_my_callbackThread1of1ForFork0_~data~0.offset_243 0)) |v_#pthreadsMutex_252|) (= (store |v_#memory_$Pointer$.offset_831| v_my_callbackThread1of1ForFork0_~data~0.base_243 (store (select |v_#memory_$Pointer$.offset_831| v_my_callbackThread1of1ForFork0_~data~0.base_243) .cse0 (select (select |v_#memory_$Pointer$.offset_830| v_my_callbackThread1of1ForFork0_~data~0.base_243) .cse0))) |v_#memory_$Pointer$.offset_830|) (= (store |v_#memory_$Pointer$.base_831| v_my_callbackThread1of1ForFork0_~data~0.base_243 (store (select |v_#memory_$Pointer$.base_831| v_my_callbackThread1of1ForFork0_~data~0.base_243) .cse0 (select (select |v_#memory_$Pointer$.base_830| v_my_callbackThread1of1ForFork0_~data~0.base_243) .cse0))) |v_#memory_$Pointer$.base_830|) (= |v_my_callbackThread1of1ForFork0_#res.offset_33| 0) (= |v_#memory_int_897| (store |v_#memory_int_898| v_my_callbackThread1of1ForFork0_~data~0.base_243 (let ((.cse1 (select |v_#memory_int_898| v_my_callbackThread1of1ForFork0_~data~0.base_243))) (store .cse1 .cse0 (+ (select .cse1 .cse0) 1))))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_253|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_243, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_831|, #memory_int=|v_#memory_int_898|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_243, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_831|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_252|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_243, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_33|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_159|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_830|, #memory_int=|v_#memory_int_897|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_33|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_243, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_830|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] [2022-12-06 06:48:08,470 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [584] $Ultimate##0-->L1711-1: Formula: (let ((.cse1 (select |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_146 24))) (and (= v_my_callbackThread1of1ForFork0_~dev~0.offset_32 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= (store |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_int_576| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 1)) |v_#memory_int_575|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 |v_my_callbackThread1of1ForFork0_#in~arg.offset_24|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_32 v_my_callbackThread1of1ForFork0_~arg.base_32) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_24| v_my_callbackThread1of1ForFork0_~arg.base_32) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30) (= v_my_callbackThread1of1ForFork0_~data~0.base_146 v_my_callbackThread1of1ForFork0_~__mptr~0.base_30) (= (select .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146) 0) (= |v_#memory_$Pointer$.base_514| (store |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.base_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.base_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0)))) (= v_my_callbackThread1of1ForFork0_~arg.offset_32 v_my_callbackThread1of1ForFork0_~dev~0.offset_32) (= |v_#pthreadsMutex_180| (store |v_#pthreadsMutex_181| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store .cse1 v_my_callbackThread1of1ForFork0_~data~0.offset_146 1))) (= (store |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146 (store (select |v_#memory_$Pointer$.offset_515| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0 (select (select |v_#memory_$Pointer$.offset_514| v_my_callbackThread1of1ForFork0_~data~0.base_146) .cse0))) |v_#memory_$Pointer$.offset_514|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_181|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_515|, #memory_int=|v_#memory_int_576|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_515|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_180|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_514|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_32, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_24|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_36|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_30, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_146, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_146, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_24|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_32, #memory_int=|v_#memory_int_575|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_30, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_32, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_32, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_514|} AuxVars[] AssignedVars[#pthreadsMutex, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] and [606] L1727-4-->my_callbackEXIT: Formula: (let ((.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_247 28))) (and (= (select |v_#valid_329| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_188|) 0) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_167| 0) (= (store |v_#memory_int_906| v_my_callbackThread1of1ForFork0_~data~0.base_247 (let ((.cse0 (select |v_#memory_int_906| v_my_callbackThread1of1ForFork0_~data~0.base_247))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1)))) |v_#memory_int_905|) (= |v_my_callbackThread1of1ForFork0_#res.base_37| 0) (= (store |v_#memory_$Pointer$.base_845| v_my_callbackThread1of1ForFork0_~data~0.base_247 (store (select |v_#memory_$Pointer$.base_845| v_my_callbackThread1of1ForFork0_~data~0.base_247) .cse1 (select (select |v_#memory_$Pointer$.base_844| v_my_callbackThread1of1ForFork0_~data~0.base_247) .cse1))) |v_#memory_$Pointer$.base_844|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_81| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_83|) (= (store |v_#length_230| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_188| 4) |v_#length_229|) (= (store |v_#memory_$Pointer$.offset_845| v_my_callbackThread1of1ForFork0_~data~0.base_247 (store (select |v_#memory_$Pointer$.offset_845| v_my_callbackThread1of1ForFork0_~data~0.base_247) .cse1 (select (select |v_#memory_$Pointer$.offset_844| v_my_callbackThread1of1ForFork0_~data~0.base_247) .cse1))) |v_#memory_$Pointer$.offset_844|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_115| 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_164| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_116| (select (select |v_#memory_int_906| |v_~#t1~0.base_113|) |v_~#t1~0.offset_113|)) (= |v_my_callbackThread1of1ForFork0_#res.offset_37| 0) (= (store |v_#pthreadsMutex_263| v_my_callbackThread1of1ForFork0_~data~0.base_247 (store (select |v_#pthreadsMutex_263| v_my_callbackThread1of1ForFork0_~data~0.base_247) v_my_callbackThread1of1ForFork0_~data~0.offset_247 0)) |v_#pthreadsMutex_262|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_81| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_83|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_313| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_81|) (= (store |v_#valid_329| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_188| 1) |v_#valid_328|) (< |v_#StackHeapBarrier_110| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_188|) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_188| 0)) (= |v_ULTIMATE.start_main_~#data~1#1.base_313| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_81|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_263|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_845|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_313|, ~#t1~0.offset=|v_~#t1~0.offset_113|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_247, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_247, #StackHeapBarrier=|v_#StackHeapBarrier_110|, ~#t1~0.base=|v_~#t1~0.base_113|, #valid=|v_#valid_329|, #memory_int=|v_#memory_int_906|, #length=|v_#length_230|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_845|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_313|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_116|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_844|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_188|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_132|, ~#t1~0.offset=|v_~#t1~0.offset_113|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_247, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_83|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_137|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_247, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_115|, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_37|, ~#t1~0.base=|v_~#t1~0.base_113|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_150|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_137|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_164|, #length=|v_#length_229|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_97|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_81|, #pthreadsMutex=|v_#pthreadsMutex_262|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_167|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_83|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_137|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_313|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_131|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_167|, #StackHeapBarrier=|v_#StackHeapBarrier_110|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_81|, #valid=|v_#valid_328|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_132|, #memory_int=|v_#memory_int_905|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_844|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_313|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, my_callbackThread1of1ForFork0_#res.base, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_main_~probe_ret~0#1, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1, my_callbackThread1of1ForFork0_#res.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, #pthreadsMutex, my_callbackThread1of1ForFork0_#t~mem32, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:48:09,317 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:09,318 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-06 06:48:09,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [608] $Ultimate##0-->my_callbackEXIT: Formula: (let ((.cse6 (select |v_#memory_int_926| v_my_callbackThread1of1ForFork0_~data~0.base_251)) (.cse2 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_251 24))) (let ((.cse0 (select |v_#memory_$Pointer$.offset_864| v_my_callbackThread1of1ForFork0_~data~0.base_251)) (.cse3 (select |v_#memory_$Pointer$.base_864| v_my_callbackThread1of1ForFork0_~data~0.base_251)) (.cse4 (select |v_#pthreadsMutex_274| v_my_callbackThread1of1ForFork0_~data~0.base_251)) (.cse5 (store .cse6 .cse2 1)) (.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_251 28))) (and (= |v_ULTIMATE.start_main_~probe_ret~0#1_166| 0) (= |v_ULTIMATE.start_main_~#data~1#1.base_317| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_83|) (= (store |v_#memory_$Pointer$.offset_864| v_my_callbackThread1of1ForFork0_~data~0.base_251 (store .cse0 .cse1 (select (select |v_#memory_$Pointer$.offset_863| v_my_callbackThread1of1ForFork0_~data~0.base_251) .cse1))) |v_#memory_$Pointer$.offset_863|) (= (store |v_#memory_$Pointer$.offset_865| v_my_callbackThread1of1ForFork0_~data~0.base_251 (store (select |v_#memory_$Pointer$.offset_865| v_my_callbackThread1of1ForFork0_~data~0.base_251) .cse2 (select .cse0 .cse2))) |v_#memory_$Pointer$.offset_864|) (= (store |v_#memory_$Pointer$.base_864| v_my_callbackThread1of1ForFork0_~data~0.base_251 (store .cse3 .cse1 (select (select |v_#memory_$Pointer$.base_863| v_my_callbackThread1of1ForFork0_~data~0.base_251) .cse1))) |v_#memory_$Pointer$.base_863|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_83| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_85|) (= (store |v_#length_234| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_190| 4) |v_#length_233|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_169| 0) (= v_my_callbackThread1of1ForFork0_~dev~0.base_54 v_my_callbackThread1of1ForFork0_~arg.base_54) (= (store |v_#pthreadsMutex_274| v_my_callbackThread1of1ForFork0_~data~0.base_251 (store .cse4 v_my_callbackThread1of1ForFork0_~data~0.offset_251 0)) |v_#pthreadsMutex_272|) (= (store |v_#memory_$Pointer$.base_865| v_my_callbackThread1of1ForFork0_~data~0.base_251 (store (select |v_#memory_$Pointer$.base_865| v_my_callbackThread1of1ForFork0_~data~0.base_251) .cse2 (select .cse3 .cse2))) |v_#memory_$Pointer$.base_864|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_117| 0) (= v_my_callbackThread1of1ForFork0_~data~0.base_251 v_my_callbackThread1of1ForFork0_~__mptr~0.base_52) (= (select |v_#valid_335| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_190|) 0) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_76| v_my_callbackThread1of1ForFork0_~arg.base_54) (= .cse2 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_52) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_83| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_85|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_54 v_my_callbackThread1of1ForFork0_~__mptr~0.base_52) (= v_my_callbackThread1of1ForFork0_~dev~0.offset_54 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_52) (= |v_my_callbackThread1of1ForFork0_#res.base_41| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_41| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_190| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_118| (select (select (store |v_#memory_int_926| v_my_callbackThread1of1ForFork0_~data~0.base_251 .cse5) |v_~#t1~0.base_115|) |v_~#t1~0.offset_115|)) (= v_my_callbackThread1of1ForFork0_~arg.offset_54 v_my_callbackThread1of1ForFork0_~dev~0.offset_54) (= (select .cse4 v_my_callbackThread1of1ForFork0_~data~0.offset_251) 0) (= |v_#valid_334| (store |v_#valid_335| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_190| 1)) (= (store |v_#memory_int_926| v_my_callbackThread1of1ForFork0_~data~0.base_251 (store .cse5 .cse1 (+ (select .cse6 .cse1) 1))) |v_#memory_int_924|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_317| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_83|) (= v_my_callbackThread1of1ForFork0_~arg.offset_54 |v_my_callbackThread1of1ForFork0_#in~arg.offset_76|) (< |v_#StackHeapBarrier_112| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_190|)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_274|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_865|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_317|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_76|, ~#t1~0.offset=|v_~#t1~0.offset_115|, #StackHeapBarrier=|v_#StackHeapBarrier_112|, ~#t1~0.base=|v_~#t1~0.base_115|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_76|, #valid=|v_#valid_335|, #memory_int=|v_#memory_int_926|, #length=|v_#length_234|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_865|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_317|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_118|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_863|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_190|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_134|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_76|, ~#t1~0.offset=|v_~#t1~0.offset_115|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_58|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_52, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_251, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_85|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_142|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_251, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_117|, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_41|, ~#t1~0.base=|v_~#t1~0.base_115|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_152|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_139|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_166|, #length=|v_#length_233|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_99|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_41|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_83|, #pthreadsMutex=|v_#pthreadsMutex_272|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_171|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_85|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_139|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_54, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_317|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_133|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_169|, #StackHeapBarrier=|v_#StackHeapBarrier_112|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_76|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_83|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_54, #valid=|v_#valid_334|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_134|, #memory_int=|v_#memory_int_924|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_52, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_54, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_54, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_863|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_317|} AuxVars[|v_#memory_$Pointer$.offset_864|, |v_#memory_$Pointer$.base_864|] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, my_callbackThread1of1ForFork0_~data~0.offset, ULTIMATE.start_my_drv_probe_#res#1, my_callbackThread1of1ForFork0_#res.base, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_main_~probe_ret~0#1, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1, my_callbackThread1of1ForFork0_#res.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, #pthreadsMutex, my_callbackThread1of1ForFork0_#t~mem32, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, my_callbackThread1of1ForFork0_~arg.base, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, my_callbackThread1of1ForFork0_~arg.offset, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] and [575] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_354| |v_ULTIMATE.start_main_~#data~1#1.base_135|))) (and (= (store |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|)) |v_#memory_$Pointer$.base_300|) (= |v_#memory_int_354| (store |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| (select (select |v_#memory_int_354| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|)))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_55|) 1 0)) (= |v_ULTIMATE.start_main_#t~mem47#1_55| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 28))) (not (= 0 (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 24)) 1) 1 0))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| |v_ULTIMATE.start_ldv_assert_~expression#1_203|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_203| 0) (= |v_#valid_144| (store |v_#valid_145| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| 0)) (= |v_#memory_$Pointer$.offset_300| (store |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_301|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|, #valid=|v_#valid_145|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, #memory_int=|v_#memory_int_355|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_301|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_203|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_300|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_40|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_163|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_63|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_354|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_300|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_main_#t~mem47#1, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~mem46#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:48:12,688 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:48:12,689 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4844 [2022-12-06 06:48:12,689 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 57 transitions, 565 flow [2022-12-06 06:48:12,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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:48:12,689 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:12,689 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:12,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:48:12,689 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:48:12,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:12,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2049383554, now seen corresponding path program 1 times [2022-12-06 06:48:12,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:12,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085746069] [2022-12-06 06:48:12,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:12,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:13,446 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:48:13,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:13,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085746069] [2022-12-06 06:48:13,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085746069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:13,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:13,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 06:48:13,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709931465] [2022-12-06 06:48:13,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:13,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 06:48:13,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:13,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 06:48:13,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-06 06:48:13,448 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:48:13,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 57 transitions, 565 flow. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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:48:13,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:13,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:48:13,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:13,757 INFO L130 PetriNetUnfolder]: 128/324 cut-off events. [2022-12-06 06:48:13,757 INFO L131 PetriNetUnfolder]: For 1515/1515 co-relation queries the response was YES. [2022-12-06 06:48:13,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1620 conditions, 324 events. 128/324 cut-off events. For 1515/1515 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1491 event pairs, 89 based on Foata normal form. 1/324 useless extension candidates. Maximal degree in co-relation 1583. Up to 296 conditions per place. [2022-12-06 06:48:13,760 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 50 selfloop transitions, 10 changer transitions 6/66 dead transitions. [2022-12-06 06:48:13,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 66 transitions, 726 flow [2022-12-06 06:48:13,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 06:48:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 06:48:13,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2022-12-06 06:48:13,763 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20772946859903382 [2022-12-06 06:48:13,763 INFO L175 Difference]: Start difference. First operand has 81 places, 57 transitions, 565 flow. Second operand 9 states and 43 transitions. [2022-12-06 06:48:13,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 66 transitions, 726 flow [2022-12-06 06:48:13,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 66 transitions, 654 flow, removed 17 selfloop flow, removed 16 redundant places. [2022-12-06 06:48:13,767 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 465 flow [2022-12-06 06:48:13,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=465, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2022-12-06 06:48:13,768 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 36 predicate places. [2022-12-06 06:48:13,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:13,769 INFO L89 Accepts]: Start accepts. Operand has 75 places, 55 transitions, 465 flow [2022-12-06 06:48:13,769 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:13,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:13,770 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 55 transitions, 465 flow [2022-12-06 06:48:13,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 55 transitions, 465 flow [2022-12-06 06:48:13,782 INFO L130 PetriNetUnfolder]: 20/136 cut-off events. [2022-12-06 06:48:13,782 INFO L131 PetriNetUnfolder]: For 397/402 co-relation queries the response was YES. [2022-12-06 06:48:13,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 136 events. 20/136 cut-off events. For 397/402 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 671 event pairs, 5 based on Foata normal form. 2/136 useless extension candidates. Maximal degree in co-relation 498. Up to 27 conditions per place. [2022-12-06 06:48:13,783 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 55 transitions, 465 flow [2022-12-06 06:48:13,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-06 06:48:13,784 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:48:13,785 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 06:48:13,785 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 55 transitions, 465 flow [2022-12-06 06:48:13,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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:48:13,785 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:13,785 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:13,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:48:13,785 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:48:13,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:13,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1174998908, now seen corresponding path program 5 times [2022-12-06 06:48:13,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:13,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108358061] [2022-12-06 06:48:13,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:13,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:14,710 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:48:14,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:14,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108358061] [2022-12-06 06:48:14,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108358061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:14,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:14,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 06:48:14,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178300121] [2022-12-06 06:48:14,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:14,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 06:48:14,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:14,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 06:48:14,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-12-06 06:48:14,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:48:14,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 55 transitions, 465 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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:48:14,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:14,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:48:14,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:15,289 INFO L130 PetriNetUnfolder]: 143/367 cut-off events. [2022-12-06 06:48:15,290 INFO L131 PetriNetUnfolder]: For 1312/1312 co-relation queries the response was YES. [2022-12-06 06:48:15,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1650 conditions, 367 events. 143/367 cut-off events. For 1312/1312 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1799 event pairs, 84 based on Foata normal form. 2/368 useless extension candidates. Maximal degree in co-relation 1619. Up to 249 conditions per place. [2022-12-06 06:48:15,292 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 52 selfloop transitions, 21 changer transitions 19/92 dead transitions. [2022-12-06 06:48:15,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 92 transitions, 878 flow [2022-12-06 06:48:15,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 06:48:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 06:48:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-12-06 06:48:15,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2490842490842491 [2022-12-06 06:48:15,293 INFO L175 Difference]: Start difference. First operand has 73 places, 55 transitions, 465 flow. Second operand 13 states and 68 transitions. [2022-12-06 06:48:15,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 92 transitions, 878 flow [2022-12-06 06:48:15,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 92 transitions, 850 flow, removed 4 selfloop flow, removed 8 redundant places. [2022-12-06 06:48:15,297 INFO L231 Difference]: Finished difference. Result has 82 places, 58 transitions, 535 flow [2022-12-06 06:48:15,297 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=535, PETRI_PLACES=82, PETRI_TRANSITIONS=58} [2022-12-06 06:48:15,297 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 43 predicate places. [2022-12-06 06:48:15,297 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:15,297 INFO L89 Accepts]: Start accepts. Operand has 82 places, 58 transitions, 535 flow [2022-12-06 06:48:15,298 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:15,298 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:15,298 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 58 transitions, 535 flow [2022-12-06 06:48:15,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 58 transitions, 535 flow [2022-12-06 06:48:15,310 INFO L130 PetriNetUnfolder]: 20/139 cut-off events. [2022-12-06 06:48:15,310 INFO L131 PetriNetUnfolder]: For 443/448 co-relation queries the response was YES. [2022-12-06 06:48:15,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 139 events. 20/139 cut-off events. For 443/448 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 687 event pairs, 5 based on Foata normal form. 2/139 useless extension candidates. Maximal degree in co-relation 530. Up to 28 conditions per place. [2022-12-06 06:48:15,311 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 58 transitions, 535 flow [2022-12-06 06:48:15,311 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-06 06:48:15,492 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:48:15,493 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 06:48:15,493 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 58 transitions, 535 flow [2022-12-06 06:48:15,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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:48:15,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:15,493 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:15,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 06:48:15,493 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:48:15,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:15,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1706511762, now seen corresponding path program 6 times [2022-12-06 06:48:15,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:15,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181539787] [2022-12-06 06:48:15,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:15,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:16,573 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:48:16,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:16,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181539787] [2022-12-06 06:48:16,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181539787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:16,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:16,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 06:48:16,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375262292] [2022-12-06 06:48:16,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:16,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 06:48:16,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:16,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 06:48:16,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-06 06:48:16,575 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:48:16,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 58 transitions, 535 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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:48:16,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:16,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:48:16,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:17,289 INFO L130 PetriNetUnfolder]: 141/367 cut-off events. [2022-12-06 06:48:17,289 INFO L131 PetriNetUnfolder]: For 1642/1642 co-relation queries the response was YES. [2022-12-06 06:48:17,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1803 conditions, 367 events. 141/367 cut-off events. For 1642/1642 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1797 event pairs, 49 based on Foata normal form. 2/368 useless extension candidates. Maximal degree in co-relation 1765. Up to 292 conditions per place. [2022-12-06 06:48:17,291 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 61 selfloop transitions, 17 changer transitions 26/104 dead transitions. [2022-12-06 06:48:17,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 104 transitions, 1079 flow [2022-12-06 06:48:17,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 06:48:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 06:48:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-12-06 06:48:17,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24175824175824176 [2022-12-06 06:48:17,292 INFO L175 Difference]: Start difference. First operand has 78 places, 58 transitions, 535 flow. Second operand 13 states and 66 transitions. [2022-12-06 06:48:17,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 104 transitions, 1079 flow [2022-12-06 06:48:17,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 104 transitions, 995 flow, removed 27 selfloop flow, removed 9 redundant places. [2022-12-06 06:48:17,297 INFO L231 Difference]: Finished difference. Result has 89 places, 71 transitions, 676 flow [2022-12-06 06:48:17,297 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=676, PETRI_PLACES=89, PETRI_TRANSITIONS=71} [2022-12-06 06:48:17,297 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 50 predicate places. [2022-12-06 06:48:17,297 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:17,297 INFO L89 Accepts]: Start accepts. Operand has 89 places, 71 transitions, 676 flow [2022-12-06 06:48:17,298 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:17,298 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:17,298 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 71 transitions, 676 flow [2022-12-06 06:48:17,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 71 transitions, 676 flow [2022-12-06 06:48:17,329 INFO L130 PetriNetUnfolder]: 26/155 cut-off events. [2022-12-06 06:48:17,329 INFO L131 PetriNetUnfolder]: For 601/607 co-relation queries the response was YES. [2022-12-06 06:48:17,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 155 events. 26/155 cut-off events. For 601/607 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 809 event pairs, 1 based on Foata normal form. 3/156 useless extension candidates. Maximal degree in co-relation 646. Up to 33 conditions per place. [2022-12-06 06:48:17,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 71 transitions, 676 flow [2022-12-06 06:48:17,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 06:48:17,336 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:17,337 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-06 06:48:17,342 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [575] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_354| |v_ULTIMATE.start_main_~#data~1#1.base_135|))) (and (= (store |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|)) |v_#memory_$Pointer$.base_300|) (= |v_#memory_int_354| (store |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| (select (select |v_#memory_int_354| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|)))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_55|) 1 0)) (= |v_ULTIMATE.start_main_#t~mem47#1_55| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 28))) (not (= 0 (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 24)) 1) 1 0))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| |v_ULTIMATE.start_ldv_assert_~expression#1_203|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_203| 0) (= |v_#valid_144| (store |v_#valid_145| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| 0)) (= |v_#memory_$Pointer$.offset_300| (store |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_301|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|, #valid=|v_#valid_145|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, #memory_int=|v_#memory_int_355|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_301|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_203|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_300|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_40|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_163|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_63|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_354|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_300|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_main_#t~mem47#1, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~mem46#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:48:17,535 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:17,535 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:17,536 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:17,537 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:17,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85))) (and (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_9|) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_85 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 v_my_callbackThread1of1ForFork1_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork1_~data~0.base_85 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~arg.base_13) (= (store |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85 1)) |v_#pthreadsMutex_125|) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85) 0) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_15 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_126|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_125|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_85, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_85, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_27, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_15, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_15, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~dev~0.base] and [379] L1712-->L1712-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_11 28))) (and (= (store |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.base_19| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.base_19|) (= (store |v_#memory_int_33| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_int_33| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_3| 1))) |v_#memory_int_32|) (= (store |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.offset_19| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.offset_19|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_11, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_20|, #memory_int=|v_#memory_int_33|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_11, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_20|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_11, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, #memory_int=|v_#memory_int_32|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_11, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:48:17,742 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:48:17,743 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 446 [2022-12-06 06:48:17,743 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 71 transitions, 699 flow [2022-12-06 06:48:17,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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:48:17,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:17,743 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:17,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 06:48:17,743 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:48:17,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:17,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1970522316, now seen corresponding path program 7 times [2022-12-06 06:48:17,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:17,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516857030] [2022-12-06 06:48:17,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:17,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:18,726 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:48:18,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:18,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516857030] [2022-12-06 06:48:18,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516857030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:18,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:18,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 06:48:18,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105950301] [2022-12-06 06:48:18,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:18,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 06:48:18,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:18,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 06:48:18,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-06 06:48:18,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 06:48:18,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 71 transitions, 699 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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:48:18,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:18,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 06:48:18,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:19,500 INFO L130 PetriNetUnfolder]: 157/411 cut-off events. [2022-12-06 06:48:19,500 INFO L131 PetriNetUnfolder]: For 1935/1935 co-relation queries the response was YES. [2022-12-06 06:48:19,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 411 events. 157/411 cut-off events. For 1935/1935 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2098 event pairs, 41 based on Foata normal form. 2/412 useless extension candidates. Maximal degree in co-relation 2015. Up to 318 conditions per place. [2022-12-06 06:48:19,503 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 62 selfloop transitions, 21 changer transitions 33/116 dead transitions. [2022-12-06 06:48:19,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 116 transitions, 1276 flow [2022-12-06 06:48:19,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 06:48:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 06:48:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 72 transitions. [2022-12-06 06:48:19,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23076923076923078 [2022-12-06 06:48:19,504 INFO L175 Difference]: Start difference. First operand has 84 places, 71 transitions, 699 flow. Second operand 13 states and 72 transitions. [2022-12-06 06:48:19,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 116 transitions, 1276 flow [2022-12-06 06:48:19,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 116 transitions, 1178 flow, removed 48 selfloop flow, removed 6 redundant places. [2022-12-06 06:48:19,512 INFO L231 Difference]: Finished difference. Result has 97 places, 77 transitions, 792 flow [2022-12-06 06:48:19,513 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=792, PETRI_PLACES=97, PETRI_TRANSITIONS=77} [2022-12-06 06:48:19,513 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 58 predicate places. [2022-12-06 06:48:19,513 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:19,513 INFO L89 Accepts]: Start accepts. Operand has 97 places, 77 transitions, 792 flow [2022-12-06 06:48:19,515 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:19,515 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:19,515 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 77 transitions, 792 flow [2022-12-06 06:48:19,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 77 transitions, 792 flow [2022-12-06 06:48:19,530 INFO L130 PetriNetUnfolder]: 28/154 cut-off events. [2022-12-06 06:48:19,530 INFO L131 PetriNetUnfolder]: For 736/743 co-relation queries the response was YES. [2022-12-06 06:48:19,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 154 events. 28/154 cut-off events. For 736/743 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 782 event pairs, 0 based on Foata normal form. 2/154 useless extension candidates. Maximal degree in co-relation 687. Up to 32 conditions per place. [2022-12-06 06:48:19,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 77 transitions, 792 flow [2022-12-06 06:48:19,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-06 06:48:19,539 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:48:19,540 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 06:48:19,540 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 77 transitions, 792 flow [2022-12-06 06:48:19,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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:48:19,540 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:19,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:19,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 06:48:19,541 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:48:19,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:19,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1132574368, now seen corresponding path program 8 times [2022-12-06 06:48:19,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:19,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887387424] [2022-12-06 06:48:19,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:19,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:20,455 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:48:20,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:20,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887387424] [2022-12-06 06:48:20,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887387424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:20,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:20,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 06:48:20,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287815522] [2022-12-06 06:48:20,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:20,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 06:48:20,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:20,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 06:48:20,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-06 06:48:20,457 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:48:20,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 77 transitions, 792 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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:48:20,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:20,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:48:20,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:21,174 INFO L130 PetriNetUnfolder]: 134/353 cut-off events. [2022-12-06 06:48:21,175 INFO L131 PetriNetUnfolder]: For 1933/1933 co-relation queries the response was YES. [2022-12-06 06:48:21,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1857 conditions, 353 events. 134/353 cut-off events. For 1933/1933 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1717 event pairs, 38 based on Foata normal form. 2/354 useless extension candidates. Maximal degree in co-relation 1812. Up to 271 conditions per place. [2022-12-06 06:48:21,178 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 61 selfloop transitions, 21 changer transitions 25/107 dead transitions. [2022-12-06 06:48:21,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 107 transitions, 1187 flow [2022-12-06 06:48:21,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 06:48:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 06:48:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-12-06 06:48:21,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22742474916387959 [2022-12-06 06:48:21,179 INFO L175 Difference]: Start difference. First operand has 90 places, 77 transitions, 792 flow. Second operand 13 states and 68 transitions. [2022-12-06 06:48:21,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 107 transitions, 1187 flow [2022-12-06 06:48:21,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 107 transitions, 1118 flow, removed 32 selfloop flow, removed 7 redundant places. [2022-12-06 06:48:21,186 INFO L231 Difference]: Finished difference. Result has 100 places, 75 transitions, 777 flow [2022-12-06 06:48:21,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=777, PETRI_PLACES=100, PETRI_TRANSITIONS=75} [2022-12-06 06:48:21,187 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 61 predicate places. [2022-12-06 06:48:21,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:21,187 INFO L89 Accepts]: Start accepts. Operand has 100 places, 75 transitions, 777 flow [2022-12-06 06:48:21,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:21,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:21,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 75 transitions, 777 flow [2022-12-06 06:48:21,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 75 transitions, 777 flow [2022-12-06 06:48:21,203 INFO L130 PetriNetUnfolder]: 27/155 cut-off events. [2022-12-06 06:48:21,203 INFO L131 PetriNetUnfolder]: For 701/707 co-relation queries the response was YES. [2022-12-06 06:48:21,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 155 events. 27/155 cut-off events. For 701/707 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 790 event pairs, 0 based on Foata normal form. 3/156 useless extension candidates. Maximal degree in co-relation 683. Up to 32 conditions per place. [2022-12-06 06:48:21,204 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 75 transitions, 777 flow [2022-12-06 06:48:21,204 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-06 06:48:21,207 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:21,208 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:21,209 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:21,209 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:21,210 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [379] L1712-->L1712-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_11 28))) (and (= (store |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.base_19| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.base_19|) (= (store |v_#memory_int_33| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_int_33| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_3| 1))) |v_#memory_int_32|) (= (store |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.offset_19| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.offset_19|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_11, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_20|, #memory_int=|v_#memory_int_33|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_11, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_20|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_11, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, #memory_int=|v_#memory_int_32|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_11, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:48:21,395 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [525] L1712-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_51 28))) (and (= |v_#memory_$Pointer$.base_115| (store |v_#memory_$Pointer$.base_116| v_my_callbackThread1of1ForFork1_~data~0.base_51 (store (select |v_#memory_$Pointer$.base_116| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0 (select (select |v_#memory_$Pointer$.base_115| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0)))) (= (store |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_51 (store (select |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem32_22| 1))) |v_#memory_int_158|) (= (store |v_#memory_$Pointer$.offset_116| v_my_callbackThread1of1ForFork1_~data~0.base_51 (store (select |v_#memory_$Pointer$.offset_116| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0 (select (select |v_#memory_$Pointer$.offset_115| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0))) |v_#memory_$Pointer$.offset_115|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_22|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_51, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_51, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_116|, #memory_int=|v_#memory_int_159|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_116|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_51, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_51, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_115|, #memory_int=|v_#memory_int_158|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_115|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:48:21,589 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:48:21,590 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 403 [2022-12-06 06:48:21,590 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 74 transitions, 783 flow [2022-12-06 06:48:21,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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:48:21,590 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:21,590 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:21,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 06:48:21,590 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:48:21,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:21,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1660657234, now seen corresponding path program 9 times [2022-12-06 06:48:21,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:21,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548139088] [2022-12-06 06:48:21,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:21,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:22,569 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:48:22,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:22,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548139088] [2022-12-06 06:48:22,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548139088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:22,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:22,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 06:48:22,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660837350] [2022-12-06 06:48:22,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:22,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:48:22,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:22,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:48:22,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:48:22,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:48:22,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 74 transitions, 783 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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:48:22,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:22,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:48:22,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:23,159 INFO L130 PetriNetUnfolder]: 116/303 cut-off events. [2022-12-06 06:48:23,159 INFO L131 PetriNetUnfolder]: For 1869/1869 co-relation queries the response was YES. [2022-12-06 06:48:23,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 303 events. 116/303 cut-off events. For 1869/1869 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1388 event pairs, 21 based on Foata normal form. 2/304 useless extension candidates. Maximal degree in co-relation 1616. Up to 213 conditions per place. [2022-12-06 06:48:23,162 INFO L137 encePairwiseOnDemand]: 8/25 looper letters, 58 selfloop transitions, 22 changer transitions 21/101 dead transitions. [2022-12-06 06:48:23,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 1149 flow [2022-12-06 06:48:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 06:48:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 06:48:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-12-06 06:48:23,163 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23 [2022-12-06 06:48:23,163 INFO L175 Difference]: Start difference. First operand has 93 places, 74 transitions, 783 flow. Second operand 12 states and 69 transitions. [2022-12-06 06:48:23,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 1149 flow [2022-12-06 06:48:23,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 101 transitions, 1067 flow, removed 23 selfloop flow, removed 10 redundant places. [2022-12-06 06:48:23,169 INFO L231 Difference]: Finished difference. Result has 99 places, 71 transitions, 754 flow [2022-12-06 06:48:23,169 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=754, PETRI_PLACES=99, PETRI_TRANSITIONS=71} [2022-12-06 06:48:23,170 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 60 predicate places. [2022-12-06 06:48:23,170 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:23,170 INFO L89 Accepts]: Start accepts. Operand has 99 places, 71 transitions, 754 flow [2022-12-06 06:48:23,171 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:23,171 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:23,171 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 71 transitions, 754 flow [2022-12-06 06:48:23,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 71 transitions, 754 flow [2022-12-06 06:48:23,185 INFO L130 PetriNetUnfolder]: 24/135 cut-off events. [2022-12-06 06:48:23,185 INFO L131 PetriNetUnfolder]: For 641/645 co-relation queries the response was YES. [2022-12-06 06:48:23,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 135 events. 24/135 cut-off events. For 641/645 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 632 event pairs, 0 based on Foata normal form. 3/136 useless extension candidates. Maximal degree in co-relation 592. Up to 27 conditions per place. [2022-12-06 06:48:23,186 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 71 transitions, 754 flow [2022-12-06 06:48:23,186 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-06 06:48:23,205 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:48:23,206 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 06:48:23,206 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 71 transitions, 754 flow [2022-12-06 06:48:23,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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:48:23,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:23,207 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:23,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 06:48:23,207 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:48:23,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:23,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1773173564, now seen corresponding path program 10 times [2022-12-06 06:48:23,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:23,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580765368] [2022-12-06 06:48:23,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:23,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:24,136 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:48:24,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:24,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580765368] [2022-12-06 06:48:24,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580765368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:24,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:24,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 06:48:24,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960704844] [2022-12-06 06:48:24,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:24,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 06:48:24,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:24,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 06:48:24,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-12-06 06:48:24,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:48:24,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 71 transitions, 754 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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:48:24,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:24,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:48:24,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:24,691 INFO L130 PetriNetUnfolder]: 104/271 cut-off events. [2022-12-06 06:48:24,691 INFO L131 PetriNetUnfolder]: For 1748/1748 co-relation queries the response was YES. [2022-12-06 06:48:24,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 271 events. 104/271 cut-off events. For 1748/1748 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1190 event pairs, 45 based on Foata normal form. 1/271 useless extension candidates. Maximal degree in co-relation 1387. Up to 219 conditions per place. [2022-12-06 06:48:24,693 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 58 selfloop transitions, 16 changer transitions 17/91 dead transitions. [2022-12-06 06:48:24,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 91 transitions, 1054 flow [2022-12-06 06:48:24,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 06:48:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 06:48:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2022-12-06 06:48:24,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1657142857142857 [2022-12-06 06:48:24,694 INFO L175 Difference]: Start difference. First operand has 94 places, 71 transitions, 754 flow. Second operand 14 states and 58 transitions. [2022-12-06 06:48:24,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 91 transitions, 1054 flow [2022-12-06 06:48:24,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 91 transitions, 976 flow, removed 16 selfloop flow, removed 10 redundant places. [2022-12-06 06:48:24,699 INFO L231 Difference]: Finished difference. Result has 102 places, 67 transitions, 681 flow [2022-12-06 06:48:24,699 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=681, PETRI_PLACES=102, PETRI_TRANSITIONS=67} [2022-12-06 06:48:24,699 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 63 predicate places. [2022-12-06 06:48:24,699 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:24,699 INFO L89 Accepts]: Start accepts. Operand has 102 places, 67 transitions, 681 flow [2022-12-06 06:48:24,700 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:24,700 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:24,700 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 67 transitions, 681 flow [2022-12-06 06:48:24,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 67 transitions, 681 flow [2022-12-06 06:48:24,712 INFO L130 PetriNetUnfolder]: 24/129 cut-off events. [2022-12-06 06:48:24,712 INFO L131 PetriNetUnfolder]: For 648/653 co-relation queries the response was YES. [2022-12-06 06:48:24,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 129 events. 24/129 cut-off events. For 648/653 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 600 event pairs, 1 based on Foata normal form. 4/131 useless extension candidates. Maximal degree in co-relation 591. Up to 26 conditions per place. [2022-12-06 06:48:24,713 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 67 transitions, 681 flow [2022-12-06 06:48:24,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 06:48:24,729 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:24,730 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-06 06:48:24,735 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [575] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_354| |v_ULTIMATE.start_main_~#data~1#1.base_135|))) (and (= (store |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|)) |v_#memory_$Pointer$.base_300|) (= |v_#memory_int_354| (store |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| (select (select |v_#memory_int_354| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|)))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_55|) 1 0)) (= |v_ULTIMATE.start_main_#t~mem47#1_55| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 28))) (not (= 0 (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 24)) 1) 1 0))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| |v_ULTIMATE.start_ldv_assert_~expression#1_203|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_203| 0) (= |v_#valid_144| (store |v_#valid_145| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| 0)) (= |v_#memory_$Pointer$.offset_300| (store |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_301|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|, #valid=|v_#valid_145|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, #memory_int=|v_#memory_int_355|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_301|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_203|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_300|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_40|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_163|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_63|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_354|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_300|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_main_#t~mem47#1, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~mem46#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:48:24,903 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [575] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_354| |v_ULTIMATE.start_main_~#data~1#1.base_135|))) (and (= (store |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|)) |v_#memory_$Pointer$.base_300|) (= |v_#memory_int_354| (store |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| (select (select |v_#memory_int_354| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|)))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_55|) 1 0)) (= |v_ULTIMATE.start_main_#t~mem47#1_55| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 28))) (not (= 0 (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 24)) 1) 1 0))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| |v_ULTIMATE.start_ldv_assert_~expression#1_203|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_203| 0) (= |v_#valid_144| (store |v_#valid_145| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| 0)) (= |v_#memory_$Pointer$.offset_300| (store |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_301|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|, #valid=|v_#valid_145|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, #memory_int=|v_#memory_int_355|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_301|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_203|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_300|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_40|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_163|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_63|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_354|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_300|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_main_#t~mem47#1, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~mem46#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:48:27,234 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:48:27,235 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2536 [2022-12-06 06:48:27,235 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 69 transitions, 710 flow [2022-12-06 06:48:27,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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:48:27,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:27,235 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:27,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 06:48:27,235 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:48:27,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:27,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1635805550, now seen corresponding path program 11 times [2022-12-06 06:48:27,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:27,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007352194] [2022-12-06 06:48:27,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:27,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:28,248 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:48:28,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:28,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007352194] [2022-12-06 06:48:28,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007352194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:28,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:28,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 06:48:28,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592440007] [2022-12-06 06:48:28,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:28,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:48:28,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:28,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:48:28,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:48:28,250 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 06:48:28,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 69 transitions, 710 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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:48:28,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:28,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 06:48:28,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:28,723 INFO L130 PetriNetUnfolder]: 101/267 cut-off events. [2022-12-06 06:48:28,723 INFO L131 PetriNetUnfolder]: For 1759/1759 co-relation queries the response was YES. [2022-12-06 06:48:28,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 267 events. 101/267 cut-off events. For 1759/1759 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1165 event pairs, 52 based on Foata normal form. 1/267 useless extension candidates. Maximal degree in co-relation 1427. Up to 237 conditions per place. [2022-12-06 06:48:28,725 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 47 selfloop transitions, 8 changer transitions 22/77 dead transitions. [2022-12-06 06:48:28,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 77 transitions, 872 flow [2022-12-06 06:48:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 06:48:28,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 06:48:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-12-06 06:48:28,726 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14814814814814814 [2022-12-06 06:48:28,726 INFO L175 Difference]: Start difference. First operand has 95 places, 69 transitions, 710 flow. Second operand 12 states and 48 transitions. [2022-12-06 06:48:28,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 77 transitions, 872 flow [2022-12-06 06:48:28,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 77 transitions, 826 flow, removed 7 selfloop flow, removed 11 redundant places. [2022-12-06 06:48:28,731 INFO L231 Difference]: Finished difference. Result has 98 places, 55 transitions, 544 flow [2022-12-06 06:48:28,731 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=544, PETRI_PLACES=98, PETRI_TRANSITIONS=55} [2022-12-06 06:48:28,731 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 59 predicate places. [2022-12-06 06:48:28,732 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:28,732 INFO L89 Accepts]: Start accepts. Operand has 98 places, 55 transitions, 544 flow [2022-12-06 06:48:28,732 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:28,732 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:28,732 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 55 transitions, 544 flow [2022-12-06 06:48:28,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 55 transitions, 544 flow [2022-12-06 06:48:28,743 INFO L130 PetriNetUnfolder]: 19/109 cut-off events. [2022-12-06 06:48:28,743 INFO L131 PetriNetUnfolder]: For 532/536 co-relation queries the response was YES. [2022-12-06 06:48:28,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 109 events. 19/109 cut-off events. For 532/536 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 441 event pairs, 1 based on Foata normal form. 4/111 useless extension candidates. Maximal degree in co-relation 496. Up to 24 conditions per place. [2022-12-06 06:48:28,743 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 55 transitions, 544 flow [2022-12-06 06:48:28,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 06:48:30,939 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:48:30,940 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2208 [2022-12-06 06:48:30,940 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 55 transitions, 544 flow [2022-12-06 06:48:30,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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:48:30,940 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:30,940 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:30,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 06:48:30,940 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:48:30,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:30,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1951498684, now seen corresponding path program 12 times [2022-12-06 06:48:30,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:30,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593106349] [2022-12-06 06:48:30,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:31,947 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:48:31,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:31,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593106349] [2022-12-06 06:48:31,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593106349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:31,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:31,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 06:48:31,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780174760] [2022-12-06 06:48:31,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:31,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 06:48:31,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:31,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 06:48:31,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-12-06 06:48:31,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:48:31,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 55 transitions, 544 flow. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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:48:31,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:31,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:48:31,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:32,510 INFO L130 PetriNetUnfolder]: 83/220 cut-off events. [2022-12-06 06:48:32,510 INFO L131 PetriNetUnfolder]: For 1513/1513 co-relation queries the response was YES. [2022-12-06 06:48:32,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 220 events. 83/220 cut-off events. For 1513/1513 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 867 event pairs, 37 based on Foata normal form. 1/220 useless extension candidates. Maximal degree in co-relation 1212. Up to 177 conditions per place. [2022-12-06 06:48:32,512 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 39 selfloop transitions, 8 changer transitions 24/71 dead transitions. [2022-12-06 06:48:32,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 71 transitions, 792 flow [2022-12-06 06:48:32,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 06:48:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 06:48:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 52 transitions. [2022-12-06 06:48:32,513 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14857142857142858 [2022-12-06 06:48:32,513 INFO L175 Difference]: Start difference. First operand has 83 places, 55 transitions, 544 flow. Second operand 14 states and 52 transitions. [2022-12-06 06:48:32,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 71 transitions, 792 flow [2022-12-06 06:48:32,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 71 transitions, 727 flow, removed 22 selfloop flow, removed 13 redundant places. [2022-12-06 06:48:32,517 INFO L231 Difference]: Finished difference. Result has 88 places, 45 transitions, 440 flow [2022-12-06 06:48:32,517 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=440, PETRI_PLACES=88, PETRI_TRANSITIONS=45} [2022-12-06 06:48:32,518 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 49 predicate places. [2022-12-06 06:48:32,518 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:32,518 INFO L89 Accepts]: Start accepts. Operand has 88 places, 45 transitions, 440 flow [2022-12-06 06:48:32,519 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:32,519 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:32,520 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 45 transitions, 440 flow [2022-12-06 06:48:32,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 45 transitions, 440 flow [2022-12-06 06:48:32,530 INFO L130 PetriNetUnfolder]: 17/93 cut-off events. [2022-12-06 06:48:32,530 INFO L131 PetriNetUnfolder]: For 512/513 co-relation queries the response was YES. [2022-12-06 06:48:32,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 93 events. 17/93 cut-off events. For 512/513 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 360 event pairs, 0 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 422. Up to 20 conditions per place. [2022-12-06 06:48:32,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 45 transitions, 440 flow [2022-12-06 06:48:32,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 06:48:32,533 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:32,534 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:32,535 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:32,535 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:32,636 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:32,637 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:32,638 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:32,638 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:32,872 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:32,873 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:32,874 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:32,878 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:32,878 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85))) (and (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_9|) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_85 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 v_my_callbackThread1of1ForFork1_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork1_~data~0.base_85 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~arg.base_13) (= (store |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85 1)) |v_#pthreadsMutex_125|) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85) 0) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_15 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_126|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_125|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_85, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_85, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_27, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_15, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_15, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~dev~0.base] and [379] L1712-->L1712-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_11 28))) (and (= (store |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_$Pointer$.base_20| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.base_19| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.base_19|) (= (store |v_#memory_int_33| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_int_33| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_3| 1))) |v_#memory_int_32|) (= (store |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_$Pointer$.offset_20| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.offset_19| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.offset_19|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_11, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_20|, #memory_int=|v_#memory_int_33|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_11, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_20|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_11, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, #memory_int=|v_#memory_int_32|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_11, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:48:33,088 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:48:33,088 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 570 [2022-12-06 06:48:33,088 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 42 transitions, 434 flow [2022-12-06 06:48:33,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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:48:33,089 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:33,089 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:33,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 06:48:33,089 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:48:33,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:33,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1898120713, now seen corresponding path program 1 times [2022-12-06 06:48:33,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:33,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926617470] [2022-12-06 06:48:33,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:33,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:33,337 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:48:33,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:33,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926617470] [2022-12-06 06:48:33,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926617470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:33,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:33,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:48:33,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018502105] [2022-12-06 06:48:33,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:33,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:48:33,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:33,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:48:33,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:48:33,339 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 06:48:33,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 42 transitions, 434 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:48:33,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:33,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 06:48:33,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:33,420 INFO L130 PetriNetUnfolder]: 8/55 cut-off events. [2022-12-06 06:48:33,420 INFO L131 PetriNetUnfolder]: For 633/633 co-relation queries the response was YES. [2022-12-06 06:48:33,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 55 events. 8/55 cut-off events. For 633/633 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 106 event pairs, 2 based on Foata normal form. 8/61 useless extension candidates. Maximal degree in co-relation 292. Up to 37 conditions per place. [2022-12-06 06:48:33,420 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 26 selfloop transitions, 6 changer transitions 0/33 dead transitions. [2022-12-06 06:48:33,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 33 transitions, 350 flow [2022-12-06 06:48:33,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:48:33,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:48:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-12-06 06:48:33,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2518518518518518 [2022-12-06 06:48:33,421 INFO L175 Difference]: Start difference. First operand has 72 places, 42 transitions, 434 flow. Second operand 5 states and 34 transitions. [2022-12-06 06:48:33,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 33 transitions, 350 flow [2022-12-06 06:48:33,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 33 transitions, 236 flow, removed 30 selfloop flow, removed 28 redundant places. [2022-12-06 06:48:33,423 INFO L231 Difference]: Finished difference. Result has 47 places, 29 transitions, 170 flow [2022-12-06 06:48:33,423 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2022-12-06 06:48:33,423 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2022-12-06 06:48:33,423 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:33,423 INFO L89 Accepts]: Start accepts. Operand has 47 places, 29 transitions, 170 flow [2022-12-06 06:48:33,424 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:33,424 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:33,424 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 29 transitions, 170 flow [2022-12-06 06:48:33,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 29 transitions, 170 flow [2022-12-06 06:48:33,428 INFO L130 PetriNetUnfolder]: 2/47 cut-off events. [2022-12-06 06:48:33,429 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2022-12-06 06:48:33,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 47 events. 2/47 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 1 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 87. Up to 8 conditions per place. [2022-12-06 06:48:33,429 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 29 transitions, 170 flow [2022-12-06 06:48:33,429 INFO L188 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-06 06:48:34,445 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:48:34,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1023 [2022-12-06 06:48:34,446 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 25 transitions, 176 flow [2022-12-06 06:48:34,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:48:34,447 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:34,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:34,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 06:48:34,447 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:48:34,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:34,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2068620348, now seen corresponding path program 1 times [2022-12-06 06:48:34,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:34,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524137780] [2022-12-06 06:48:34,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:34,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:35,211 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:48:35,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:35,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524137780] [2022-12-06 06:48:35,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524137780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:35,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:35,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 06:48:35,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116580070] [2022-12-06 06:48:35,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:35,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 06:48:35,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:35,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 06:48:35,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-06 06:48:35,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:48:35,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 25 transitions, 176 flow. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 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:48:35,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:35,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:48:35,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:35,490 INFO L130 PetriNetUnfolder]: 5/43 cut-off events. [2022-12-06 06:48:35,490 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2022-12-06 06:48:35,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 43 events. 5/43 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 2 based on Foata normal form. 1/43 useless extension candidates. Maximal degree in co-relation 118. Up to 23 conditions per place. [2022-12-06 06:48:35,491 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 16 selfloop transitions, 5 changer transitions 12/33 dead transitions. [2022-12-06 06:48:35,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 33 transitions, 288 flow [2022-12-06 06:48:35,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 06:48:35,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 06:48:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-12-06 06:48:35,491 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13043478260869565 [2022-12-06 06:48:35,492 INFO L175 Difference]: Start difference. First operand has 43 places, 25 transitions, 176 flow. Second operand 11 states and 33 transitions. [2022-12-06 06:48:35,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 33 transitions, 288 flow [2022-12-06 06:48:35,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 33 transitions, 254 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-06 06:48:35,493 INFO L231 Difference]: Finished difference. Result has 50 places, 21 transitions, 135 flow [2022-12-06 06:48:35,493 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=135, PETRI_PLACES=50, PETRI_TRANSITIONS=21} [2022-12-06 06:48:35,493 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2022-12-06 06:48:35,493 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:35,493 INFO L89 Accepts]: Start accepts. Operand has 50 places, 21 transitions, 135 flow [2022-12-06 06:48:35,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:35,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:35,494 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 21 transitions, 135 flow [2022-12-06 06:48:35,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 21 transitions, 135 flow [2022-12-06 06:48:35,497 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-06 06:48:35,497 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-06 06:48:35,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 25 events. 0/25 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2022-12-06 06:48:35,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 21 transitions, 135 flow [2022-12-06 06:48:35,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-06 06:48:35,498 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:48:35,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 06:48:35,498 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 21 transitions, 135 flow [2022-12-06 06:48:35,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 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:48:35,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:35,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:35,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 06:48:35,499 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:48:35,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1339825243, now seen corresponding path program 1 times [2022-12-06 06:48:35,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:35,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763013739] [2022-12-06 06:48:35,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:35,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:36,507 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:48:36,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:36,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763013739] [2022-12-06 06:48:36,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763013739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:36,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:36,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 06:48:36,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33998447] [2022-12-06 06:48:36,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:36,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 06:48:36,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:36,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 06:48:36,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-06 06:48:36,509 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:48:36,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 21 transitions, 135 flow. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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:48:36,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:36,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:48:36,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:36,878 INFO L130 PetriNetUnfolder]: 1/33 cut-off events. [2022-12-06 06:48:36,878 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2022-12-06 06:48:36,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 33 events. 1/33 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 1/33 useless extension candidates. Maximal degree in co-relation 128. Up to 14 conditions per place. [2022-12-06 06:48:36,878 INFO L137 encePairwiseOnDemand]: 6/19 looper letters, 11 selfloop transitions, 12 changer transitions 5/28 dead transitions. [2022-12-06 06:48:36,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 28 transitions, 226 flow [2022-12-06 06:48:36,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 06:48:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 06:48:36,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2022-12-06 06:48:36,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1339712918660287 [2022-12-06 06:48:36,879 INFO L175 Difference]: Start difference. First operand has 42 places, 21 transitions, 135 flow. Second operand 11 states and 28 transitions. [2022-12-06 06:48:36,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 28 transitions, 226 flow [2022-12-06 06:48:36,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 28 transitions, 178 flow, removed 12 selfloop flow, removed 13 redundant places. [2022-12-06 06:48:36,880 INFO L231 Difference]: Finished difference. Result has 42 places, 23 transitions, 143 flow [2022-12-06 06:48:36,880 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=143, PETRI_PLACES=42, PETRI_TRANSITIONS=23} [2022-12-06 06:48:36,880 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2022-12-06 06:48:36,881 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:36,881 INFO L89 Accepts]: Start accepts. Operand has 42 places, 23 transitions, 143 flow [2022-12-06 06:48:36,881 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:36,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:36,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 23 transitions, 143 flow [2022-12-06 06:48:36,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 23 transitions, 143 flow [2022-12-06 06:48:36,885 INFO L130 PetriNetUnfolder]: 1/28 cut-off events. [2022-12-06 06:48:36,885 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-06 06:48:36,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 28 events. 1/28 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 83. Up to 6 conditions per place. [2022-12-06 06:48:36,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 23 transitions, 143 flow [2022-12-06 06:48:36,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 06:48:36,888 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:36,889 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-06 06:48:36,893 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [575] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_354| |v_ULTIMATE.start_main_~#data~1#1.base_135|))) (and (= (store |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|)) |v_#memory_$Pointer$.base_300|) (= |v_#memory_int_354| (store |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| (select (select |v_#memory_int_354| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|)))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_55|) 1 0)) (= |v_ULTIMATE.start_main_#t~mem47#1_55| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 28))) (not (= 0 (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 24)) 1) 1 0))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| |v_ULTIMATE.start_ldv_assert_~expression#1_203|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_203| 0) (= |v_#valid_144| (store |v_#valid_145| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| 0)) (= |v_#memory_$Pointer$.offset_300| (store |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_301|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|, #valid=|v_#valid_145|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, #memory_int=|v_#memory_int_355|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_301|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_203|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_300|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_40|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_163|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_63|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_354|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_300|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_main_#t~mem47#1, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~mem46#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:48:37,072 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L1712-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_376 28))) (and (= |v_my_callbackThread1of1ForFork0_#res.offset_45| 0) (= (store |v_#pthreadsMutex_345| v_my_callbackThread1of1ForFork0_~data~0.base_376 (store (select |v_#pthreadsMutex_345| v_my_callbackThread1of1ForFork0_~data~0.base_376) v_my_callbackThread1of1ForFork0_~data~0.offset_376 0)) |v_#pthreadsMutex_344|) (= (store |v_#memory_$Pointer$.base_1233| v_my_callbackThread1of1ForFork0_~data~0.base_376 (store (select |v_#memory_$Pointer$.base_1233| v_my_callbackThread1of1ForFork0_~data~0.base_376) .cse0 (select (select |v_#memory_$Pointer$.base_1232| v_my_callbackThread1of1ForFork0_~data~0.base_376) .cse0))) |v_#memory_$Pointer$.base_1232|) (= (store |v_#memory_int_1308| v_my_callbackThread1of1ForFork0_~data~0.base_376 (store (select |v_#memory_int_1308| v_my_callbackThread1of1ForFork0_~data~0.base_376) .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_278| 1))) |v_#memory_int_1307|) (= |v_my_callbackThread1of1ForFork0_#res.base_45| 0) (= (store |v_#memory_$Pointer$.offset_1233| v_my_callbackThread1of1ForFork0_~data~0.base_376 (store (select |v_#memory_$Pointer$.offset_1233| v_my_callbackThread1of1ForFork0_~data~0.base_376) .cse0 (select (select |v_#memory_$Pointer$.offset_1232| v_my_callbackThread1of1ForFork0_~data~0.base_376) .cse0))) |v_#memory_$Pointer$.offset_1232|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_345|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_376, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_278|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1233|, #memory_int=|v_#memory_int_1308|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_376, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1233|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_344|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_376, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_45|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1232|, #memory_int=|v_#memory_int_1307|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_45|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_376, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1232|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] and [560] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85))) (and (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_9|) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_85 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 v_my_callbackThread1of1ForFork1_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork1_~data~0.base_85 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~arg.base_13) (= (store |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85 1)) |v_#pthreadsMutex_125|) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85) 0) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_15 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_126|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_125|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_85, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_85, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_27, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_15, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_15, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~dev~0.base] [2022-12-06 06:48:37,236 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [631] L1712-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_378 28))) (and (= (store |v_#memory_$Pointer$.offset_1237| v_my_callbackThread1of1ForFork0_~data~0.base_378 (store (select |v_#memory_$Pointer$.offset_1237| v_my_callbackThread1of1ForFork0_~data~0.base_378) .cse0 (select (select |v_#memory_$Pointer$.offset_1236| v_my_callbackThread1of1ForFork0_~data~0.base_378) .cse0))) |v_#memory_$Pointer$.offset_1236|) (= (store |v_#pthreadsMutex_349| v_my_callbackThread1of1ForFork0_~data~0.base_378 (store (select |v_#pthreadsMutex_349| v_my_callbackThread1of1ForFork0_~data~0.base_378) v_my_callbackThread1of1ForFork0_~data~0.offset_378 0)) |v_#pthreadsMutex_348|) (= |v_my_callbackThread1of1ForFork0_#res.base_47| 0) (= |v_#memory_$Pointer$.base_1236| (store |v_#memory_$Pointer$.base_1237| v_my_callbackThread1of1ForFork0_~data~0.base_378 (store (select |v_#memory_$Pointer$.base_1237| v_my_callbackThread1of1ForFork0_~data~0.base_378) .cse0 (select (select |v_#memory_$Pointer$.base_1236| v_my_callbackThread1of1ForFork0_~data~0.base_378) .cse0)))) (= |v_#memory_int_1311| (store |v_#memory_int_1312| v_my_callbackThread1of1ForFork0_~data~0.base_378 (store (select |v_#memory_int_1312| v_my_callbackThread1of1ForFork0_~data~0.base_378) .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_282| 1)))) (= |v_my_callbackThread1of1ForFork0_#res.offset_47| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_349|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_378, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_282|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1237|, #memory_int=|v_#memory_int_1312|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_378, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1237|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_348|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_378, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_47|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1236|, #memory_int=|v_#memory_int_1311|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_47|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_378, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1236|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] and [560] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85))) (and (= v_my_callbackThread1of1ForFork1_~arg.offset_13 |v_my_callbackThread1of1ForFork1_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork1_~arg.base_13 |v_my_callbackThread1of1ForFork1_#in~arg.base_9|) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_85 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~arg.offset_13 v_my_callbackThread1of1ForFork1_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork1_~data~0.base_85 v_my_callbackThread1of1ForFork1_~__mptr~0.base_27) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~arg.base_13) (= (store |v_#pthreadsMutex_126| v_my_callbackThread1of1ForFork1_~data~0.base_85 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85 1)) |v_#pthreadsMutex_125|) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_29| 0) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_85) 0) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_15 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_126|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #pthreadsMutex=|v_#pthreadsMutex_125|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_85, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_85, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_13, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_13, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_27, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_27, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_15, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_29|, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_15, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~dev~0.base] [2022-12-06 06:48:37,666 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:37,666 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:37,667 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:37,668 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:37,668 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [622] L1712-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_419 28))) (and (= (store |v_#memory_$Pointer$.base_1187| v_my_callbackThread1of1ForFork1_~data~0.base_402 (store (select |v_#memory_$Pointer$.base_1187| v_my_callbackThread1of1ForFork1_~data~0.base_402) .cse0 (select (select |v_#memory_$Pointer$.base_1186| v_my_callbackThread1of1ForFork1_~data~0.base_402) .cse0))) |v_#memory_$Pointer$.base_1186|) (= (store |v_#memory_$Pointer$.offset_1187| v_my_callbackThread1of1ForFork1_~data~0.base_402 (store (select |v_#memory_$Pointer$.offset_1187| v_my_callbackThread1of1ForFork1_~data~0.base_402) .cse0 (select (select |v_#memory_$Pointer$.offset_1186| v_my_callbackThread1of1ForFork1_~data~0.base_402) .cse0))) |v_#memory_$Pointer$.offset_1186|) (= |v_#memory_int_1261| (store |v_#memory_int_1262| v_my_callbackThread1of1ForFork1_~data~0.base_402 (store (select |v_#memory_int_1262| v_my_callbackThread1of1ForFork1_~data~0.base_402) .cse0 (+ 1 |v_my_callbackThread1of1ForFork1_#t~mem32_249|)))) (= |v_my_callbackThread1of1ForFork1_#res.offset_18| 0) (= (store |v_#pthreadsMutex_313| v_my_callbackThread1of1ForFork1_~data~0.base_402 (store (select |v_#pthreadsMutex_313| v_my_callbackThread1of1ForFork1_~data~0.base_402) v_my_callbackThread1of1ForFork1_~data~0.offset_419 0)) |v_#pthreadsMutex_312|) (= |v_my_callbackThread1of1ForFork1_#res.base_18| 0))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_249|, #pthreadsMutex=|v_#pthreadsMutex_313|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_419, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_402, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1187|, #memory_int=|v_#memory_int_1262|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1187|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_312|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_419, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_18|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_402, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1186|, #memory_int=|v_#memory_int_1261|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1186|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #pthreadsMutex, my_callbackThread1of1ForFork1_#res.base, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#res.offset, #memory_$Pointer$.offset] [2022-12-06 06:48:37,832 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:37,833 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:37,834 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:37,834 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:37,838 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [621] L1710-1-->L1712: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_413 24))) (and (= (store |v_#memory_$Pointer$.base_1177| v_my_callbackThread1of1ForFork1_~data~0.base_397 (store (select |v_#memory_$Pointer$.base_1177| v_my_callbackThread1of1ForFork1_~data~0.base_397) .cse0 (select (select |v_#memory_$Pointer$.base_1176| v_my_callbackThread1of1ForFork1_~data~0.base_397) .cse0))) |v_#memory_$Pointer$.base_1176|) (= (select (select |v_#memory_int_1250| v_my_callbackThread1of1ForFork1_~data~0.base_397) (+ v_my_callbackThread1of1ForFork1_~data~0.offset_413 28)) |v_my_callbackThread1of1ForFork1_#t~mem32_240|) (= (store |v_#memory_int_1251| v_my_callbackThread1of1ForFork1_~data~0.base_397 (store (select |v_#memory_int_1251| v_my_callbackThread1of1ForFork1_~data~0.base_397) .cse0 1)) |v_#memory_int_1250|) (= (store |v_#memory_$Pointer$.offset_1177| v_my_callbackThread1of1ForFork1_~data~0.base_397 (store (select |v_#memory_$Pointer$.offset_1177| v_my_callbackThread1of1ForFork1_~data~0.base_397) .cse0 (select (select |v_#memory_$Pointer$.offset_1176| v_my_callbackThread1of1ForFork1_~data~0.base_397) .cse0))) |v_#memory_$Pointer$.offset_1176|))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_413, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_397, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1177|, #memory_int=|v_#memory_int_1251|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1177|} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_240|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_413, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_397, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1176|, #memory_int=|v_#memory_int_1250|, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_146|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1176|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#t~nondet31, #memory_$Pointer$.offset] and [637] L1727-4-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_445 28))) (and (= |v_#pthreadsMutex_372| (store |v_#pthreadsMutex_373| v_my_callbackThread1of1ForFork1_~data~0.base_425 (store (select |v_#pthreadsMutex_373| v_my_callbackThread1of1ForFork1_~data~0.base_425) v_my_callbackThread1of1ForFork1_~data~0.offset_445 0))) (= (store |v_#memory_$Pointer$.base_1276| v_my_callbackThread1of1ForFork1_~data~0.base_425 (store (select |v_#memory_$Pointer$.base_1276| v_my_callbackThread1of1ForFork1_~data~0.base_425) .cse0 (select (select |v_#memory_$Pointer$.base_1275| v_my_callbackThread1of1ForFork1_~data~0.base_425) .cse0))) |v_#memory_$Pointer$.base_1275|) (= (select |v_#valid_539| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_304|) 0) (= |v_ULTIMATE.start_main_~#data~1#1.offset_447| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_147|) (= (store |v_#memory_$Pointer$.offset_1276| v_my_callbackThread1of1ForFork1_~data~0.base_425 (store (select |v_#memory_$Pointer$.offset_1276| v_my_callbackThread1of1ForFork1_~data~0.base_425) .cse0 (select (select |v_#memory_$Pointer$.offset_1275| v_my_callbackThread1of1ForFork1_~data~0.base_425) .cse0))) |v_#memory_$Pointer$.offset_1275|) (= (store |v_#valid_539| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_304| 1) |v_#valid_538|) (= |v_ULTIMATE.start_main_~#data~1#1.base_447| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_147|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_268| 0) (< |v_#StackHeapBarrier_176| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_304|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_181| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_304| 0)) (= |v_my_callbackThread1of1ForFork1_#res.base_31| 0) (= |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_149| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_147|) (= |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_149| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_147|) (= |v_my_callbackThread1of1ForFork1_#res.offset_31| 0) (= (store |v_#length_362| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_304| 4) |v_#length_361|) (= |v_#memory_int_1346| (store |v_#memory_int_1347| v_my_callbackThread1of1ForFork1_~data~0.base_425 (store (select |v_#memory_int_1347| v_my_callbackThread1of1ForFork1_~data~0.base_425) .cse0 (+ 1 |v_my_callbackThread1of1ForFork1_#t~mem32_279|)))) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_207| (select (select |v_#memory_int_1347| |v_~#t1~0.base_191|) |v_~#t1~0.offset_179|)) (= |v_ULTIMATE.start_main_~probe_ret~0#1_230| 0))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_279|, #pthreadsMutex=|v_#pthreadsMutex_373|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1276|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_447|, ~#t1~0.offset=|v_~#t1~0.offset_179|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_445, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_425, #StackHeapBarrier=|v_#StackHeapBarrier_176|, ~#t1~0.base=|v_~#t1~0.base_191|, #valid=|v_#valid_539|, #memory_int=|v_#memory_int_1347|, #length=|v_#length_362|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1276|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_447|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_207|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1275|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_304|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_208|, ~#t1~0.offset=|v_~#t1~0.offset_179|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_149|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_212|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_445, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_31|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_181|, ~#t1~0.base=|v_~#t1~0.base_191|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_216|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_238|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_230|, #length=|v_#length_361|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_163|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_31|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_147|, #pthreadsMutex=|v_#pthreadsMutex_372|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_149|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_238|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_447|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_217|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_425, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_268|, #StackHeapBarrier=|v_#StackHeapBarrier_176|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_147|, #valid=|v_#valid_538|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_208|, #memory_int=|v_#memory_int_1346|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1275|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_447|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, my_callbackThread1of1ForFork1_#res.base, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_main_~probe_ret~0#1, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1, my_callbackThread1of1ForFork1_#res.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, my_callbackThread1of1ForFork1_#t~mem32, #pthreadsMutex, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:48:38,217 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:48:38,218 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1337 [2022-12-06 06:48:38,218 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 150 flow [2022-12-06 06:48:38,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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:48:38,218 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:38,218 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:38,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 06:48:38,218 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:48:38,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:38,219 INFO L85 PathProgramCache]: Analyzing trace with hash -417587994, now seen corresponding path program 1 times [2022-12-06 06:48:38,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:38,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442955580] [2022-12-06 06:48:38,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:38,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:38,857 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:48:38,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:38,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442955580] [2022-12-06 06:48:38,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442955580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:38,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:38,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 06:48:38,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464989188] [2022-12-06 06:48:38,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:38,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 06:48:38,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:38,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 06:48:38,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 06:48:38,858 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:48:38,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 21 transitions, 150 flow. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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:48:38,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:38,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:48:38,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:39,055 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-06 06:48:39,055 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-06 06:48:39,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 22 events. 0/22 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 26 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-12-06 06:48:39,056 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 7 selfloop transitions, 6 changer transitions 8/21 dead transitions. [2022-12-06 06:48:39,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 21 transitions, 176 flow [2022-12-06 06:48:39,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:48:39,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:48:39,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-12-06 06:48:39,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1375 [2022-12-06 06:48:39,056 INFO L175 Difference]: Start difference. First operand has 38 places, 21 transitions, 150 flow. Second operand 8 states and 22 transitions. [2022-12-06 06:48:39,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 21 transitions, 176 flow [2022-12-06 06:48:39,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 21 transitions, 136 flow, removed 4 selfloop flow, removed 10 redundant places. [2022-12-06 06:48:39,057 INFO L231 Difference]: Finished difference. Result has 35 places, 13 transitions, 69 flow [2022-12-06 06:48:39,057 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=69, PETRI_PLACES=35, PETRI_TRANSITIONS=13} [2022-12-06 06:48:39,058 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2022-12-06 06:48:39,058 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:39,058 INFO L89 Accepts]: Start accepts. Operand has 35 places, 13 transitions, 69 flow [2022-12-06 06:48:39,058 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:39,058 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:39,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 13 transitions, 69 flow [2022-12-06 06:48:39,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 13 transitions, 69 flow [2022-12-06 06:48:39,064 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-06 06:48:39,064 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 06:48:39,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 13 events. 0/13 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 1 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-06 06:48:39,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 13 transitions, 69 flow [2022-12-06 06:48:39,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 06:48:39,067 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:39,068 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2022-12-06 06:48:39,069 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:39,069 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:39,071 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:39,071 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:39,072 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:39,072 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:40,939 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:40,940 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:40,941 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:40,941 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2022-12-06 06:48:40,943 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:40,943 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:40,945 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:40,945 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2022-12-06 06:48:40,947 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:40,947 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2022-12-06 06:48:40,949 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:40,949 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:49,886 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:49,886 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2022-12-06 06:48:49,888 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:49,889 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2022-12-06 06:48:49,890 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:49,891 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2022-12-06 06:48:49,896 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:49,897 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:49,900 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:49,901 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:49,903 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:49,903 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:49,905 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:49,905 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2022-12-06 06:48:49,907 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:49,907 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:49,910 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_main_~#data~1#1.offset_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|) (= (select |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|) (= |v_#valid_184| (store |v_#valid_185| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 1)) (= (store |v_#length_134| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95| 4) |v_#length_133|) (= |v_ULTIMATE.start_main_~#data~1#1.base_213| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_104| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_55| 0) (= (select (select |v_#memory_int_525| |v_~#t1~0.base_65|) |v_~#t1~0.offset_65|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_65|, #valid=|v_#valid_185|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, #memory_int=|v_#memory_int_525|, ~#t1~0.offset=|v_~#t1~0.offset_65|, #length=|v_#length_134|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_95|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_78|, ~#t1~0.offset=|v_~#t1~0.offset_65|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_35|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_59|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_55|, ~#t1~0.base=|v_~#t1~0.base_65|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_50|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_104|, #length=|v_#length_133|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_37|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_33|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_50|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_213|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_33|, #valid=|v_#valid_184|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_78|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_213|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1] and [640] $Ultimate##0-->my_callbackEXIT: Formula: (let ((.cse13 (select |v_#pthreadsMutex_388| v_my_callbackThread1of1ForFork0_~data~0.base_388))) (let ((.cse1 (store |v_#pthreadsMutex_388| v_my_callbackThread1of1ForFork0_~data~0.base_388 (store .cse13 v_my_callbackThread1of1ForFork0_~data~0.offset_388 0)))) (let ((.cse2 (select .cse1 v_my_callbackThread1of1ForFork1_~data~0.base_431)) (.cse5 (select |v_#memory_$Pointer$.offset_1300| v_my_callbackThread1of1ForFork0_~data~0.base_388)) (.cse4 (select |v_#memory_$Pointer$.offset_1302| v_my_callbackThread1of1ForFork1_~data~0.base_431)) (.cse8 (select |v_#memory_$Pointer$.base_1300| v_my_callbackThread1of1ForFork0_~data~0.base_388)) (.cse9 (select |v_#memory_$Pointer$.base_1302| v_my_callbackThread1of1ForFork1_~data~0.base_431)) (.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_451 24)) (.cse7 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_451 28)) (.cse3 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_388 24)) (.cse6 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_388 28))) (and (= v_my_callbackThread1of1ForFork0_~dev~0.offset_67 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_65) (= v_my_callbackThread1of1ForFork0_~dev~0.base_67 v_my_callbackThread1of1ForFork0_~__mptr~0.base_65) (= |v_my_callbackThread1of1ForFork0_#res.base_55| 0) (= .cse0 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_63) (= v_my_callbackThread1of1ForFork0_~arg.offset_67 v_my_callbackThread1of1ForFork0_~dev~0.offset_67) (= |v_my_callbackThread1of1ForFork1_#res.offset_37| 0) (= (store .cse1 v_my_callbackThread1of1ForFork1_~data~0.base_431 (store .cse2 v_my_callbackThread1of1ForFork1_~data~0.offset_451 0)) |v_#pthreadsMutex_386|) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_65 .cse3) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_156| v_my_callbackThread1of1ForFork0_~arg.base_67) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_51 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_63) (= v_my_callbackThread1of1ForFork1_~dev~0.base_51 v_my_callbackThread1of1ForFork1_~__mptr~0.base_63) (= |v_#memory_$Pointer$.offset_1302| (store |v_#memory_$Pointer$.offset_1301| v_my_callbackThread1of1ForFork1_~data~0.base_431 (store (select |v_#memory_$Pointer$.offset_1301| v_my_callbackThread1of1ForFork1_~data~0.base_431) .cse0 (select .cse4 .cse0)))) (= (store |v_#memory_$Pointer$.offset_1303| v_my_callbackThread1of1ForFork0_~data~0.base_388 (store (select |v_#memory_$Pointer$.offset_1303| v_my_callbackThread1of1ForFork0_~data~0.base_388) .cse3 (select .cse5 .cse3))) |v_#memory_$Pointer$.offset_1300|) (= v_my_callbackThread1of1ForFork1_~arg.base_49 |v_my_callbackThread1of1ForFork1_#in~arg.base_117|) (= (select .cse2 v_my_callbackThread1of1ForFork1_~data~0.offset_451) 0) (= v_my_callbackThread1of1ForFork0_~data~0.base_388 v_my_callbackThread1of1ForFork0_~__mptr~0.base_65) (= (store |v_#memory_$Pointer$.offset_1300| v_my_callbackThread1of1ForFork0_~data~0.base_388 (store .cse5 .cse6 (select (select |v_#memory_$Pointer$.offset_1301| v_my_callbackThread1of1ForFork0_~data~0.base_388) .cse6))) |v_#memory_$Pointer$.offset_1301|) (= (store |v_#memory_$Pointer$.offset_1302| v_my_callbackThread1of1ForFork1_~data~0.base_431 (store .cse4 .cse7 (select (select |v_#memory_$Pointer$.offset_1299| v_my_callbackThread1of1ForFork1_~data~0.base_431) .cse7))) |v_#memory_$Pointer$.offset_1299|) (= v_my_callbackThread1of1ForFork1_~arg.offset_49 |v_my_callbackThread1of1ForFork1_#in~arg.offset_149|) (= |v_my_callbackThread1of1ForFork0_#res.offset_55| 0) (= v_my_callbackThread1of1ForFork0_~arg.offset_67 |v_my_callbackThread1of1ForFork0_#in~arg.offset_156|) (= v_my_callbackThread1of1ForFork1_~arg.offset_49 v_my_callbackThread1of1ForFork1_~dev~0.offset_51) (= |v_my_callbackThread1of1ForFork1_#res.base_37| 0) (= (store |v_#memory_$Pointer$.base_1300| v_my_callbackThread1of1ForFork0_~data~0.base_388 (store .cse8 .cse6 (select (select |v_#memory_$Pointer$.base_1301| v_my_callbackThread1of1ForFork0_~data~0.base_388) .cse6))) |v_#memory_$Pointer$.base_1301|) (= |v_#memory_$Pointer$.base_1300| (store |v_#memory_$Pointer$.base_1303| v_my_callbackThread1of1ForFork0_~data~0.base_388 (store (select |v_#memory_$Pointer$.base_1303| v_my_callbackThread1of1ForFork0_~data~0.base_388) .cse3 (select .cse8 .cse3)))) (= (store |v_#memory_$Pointer$.base_1301| v_my_callbackThread1of1ForFork1_~data~0.base_431 (store (select |v_#memory_$Pointer$.base_1301| v_my_callbackThread1of1ForFork1_~data~0.base_431) .cse0 (select .cse9 .cse0))) |v_#memory_$Pointer$.base_1302|) (= v_my_callbackThread1of1ForFork1_~dev~0.base_51 v_my_callbackThread1of1ForFork1_~arg.base_49) (= |v_#memory_$Pointer$.base_1299| (store |v_#memory_$Pointer$.base_1302| v_my_callbackThread1of1ForFork1_~data~0.base_431 (store .cse9 .cse7 (select (select |v_#memory_$Pointer$.base_1299| v_my_callbackThread1of1ForFork1_~data~0.base_431) .cse7)))) (= (let ((.cse10 (store |v_#memory_int_1364| v_my_callbackThread1of1ForFork0_~data~0.base_388 (let ((.cse12 (select |v_#memory_int_1364| v_my_callbackThread1of1ForFork0_~data~0.base_388))) (store (store .cse12 .cse3 1) .cse6 (+ (select .cse12 .cse6) 1)))))) (store .cse10 v_my_callbackThread1of1ForFork1_~data~0.base_431 (let ((.cse11 (select .cse10 v_my_callbackThread1of1ForFork1_~data~0.base_431))) (store (store .cse11 .cse0 1) .cse7 (+ (select .cse11 .cse7) 1))))) |v_#memory_int_1362|) (= 0 (select .cse13 v_my_callbackThread1of1ForFork0_~data~0.offset_388)) (= v_my_callbackThread1of1ForFork0_~dev~0.base_67 v_my_callbackThread1of1ForFork0_~arg.base_67) (= v_my_callbackThread1of1ForFork1_~data~0.base_431 v_my_callbackThread1of1ForFork1_~__mptr~0.base_63))))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_117|, #pthreadsMutex=|v_#pthreadsMutex_388|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_156|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1303|, #memory_int=|v_#memory_int_1364|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_156|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1303|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_149|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_1299|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_156|, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_63, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_71|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_65, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_170|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_388, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_149|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_451, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_37|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_388, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_55|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_37|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_55|, my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_288|, #pthreadsMutex=|v_#pthreadsMutex_386|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_297|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_67, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_49, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_117|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_431, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_49, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_156|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_67, #memory_int=|v_#memory_int_1362|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_63, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_65, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_51, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_67, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_51, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_67, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1299|} AuxVars[|v_#memory_$Pointer$.offset_1302|, |v_#memory_$Pointer$.base_1302|, |v_#memory_$Pointer$.base_1301|, |v_#memory_$Pointer$.offset_1301|, |v_#memory_$Pointer$.base_1300|, |v_#memory_$Pointer$.offset_1300|] AssignedVars[#memory_$Pointer$.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_#res.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork1_#res.offset, my_callbackThread1of1ForFork0_#res.offset, my_callbackThread1of1ForFork1_#t~mem32, #pthreadsMutex, my_callbackThread1of1ForFork0_#t~mem32, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork1_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] [2022-12-06 06:49:01,983 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:49:01,983 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22925 [2022-12-06 06:49:01,984 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 12 transitions, 68 flow [2022-12-06 06:49:01,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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:49:01,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:49:01,984 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:49:01,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 06:49:01,984 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:49:01,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:49:01,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1655116602, now seen corresponding path program 1 times [2022-12-06 06:49:01,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:49:01,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906654742] [2022-12-06 06:49:01,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:49:01,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:49:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:49:02,304 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:49:02,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:49:02,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906654742] [2022-12-06 06:49:02,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906654742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:49:02,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:49:02,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:49:02,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129763766] [2022-12-06 06:49:02,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:49:02,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:49:02,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:49:02,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:49:02,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:49:02,306 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 12 [2022-12-06 06:49:02,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 12 transitions, 68 flow. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:49:02,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:49:02,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 12 [2022-12-06 06:49:02,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:49:02,375 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-06 06:49:02,376 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 06:49:02,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 11 events. 0/11 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 3 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2022-12-06 06:49:02,376 INFO L137 encePairwiseOnDemand]: 7/12 looper letters, 5 selfloop transitions, 4 changer transitions 2/11 dead transitions. [2022-12-06 06:49:02,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 11 transitions, 85 flow [2022-12-06 06:49:02,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:49:02,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:49:02,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2022-12-06 06:49:02,377 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2 [2022-12-06 06:49:02,377 INFO L175 Difference]: Start difference. First operand has 29 places, 12 transitions, 68 flow. Second operand 5 states and 12 transitions. [2022-12-06 06:49:02,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 11 transitions, 85 flow [2022-12-06 06:49:02,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 11 transitions, 52 flow, removed 3 selfloop flow, removed 12 redundant places. [2022-12-06 06:49:02,377 INFO L231 Difference]: Finished difference. Result has 20 places, 9 transitions, 30 flow [2022-12-06 06:49:02,377 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=30, PETRI_PLACES=20, PETRI_TRANSITIONS=9} [2022-12-06 06:49:02,378 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -19 predicate places. [2022-12-06 06:49:02,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:49:02,378 INFO L89 Accepts]: Start accepts. Operand has 20 places, 9 transitions, 30 flow [2022-12-06 06:49:02,378 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:49:02,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:49:02,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 9 transitions, 30 flow [2022-12-06 06:49:02,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 16 places, 9 transitions, 30 flow [2022-12-06 06:49:02,381 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-06 06:49:02,381 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:49:02,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17 conditions, 9 events. 0/9 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/9 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:49:02,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 16 places, 9 transitions, 30 flow [2022-12-06 06:49:02,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 06:49:02,382 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [575] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_354| |v_ULTIMATE.start_main_~#data~1#1.base_135|))) (and (= (store |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.base_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|)) |v_#memory_$Pointer$.base_300|) (= |v_#memory_int_354| (store |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_int_355| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| (select (select |v_#memory_int_354| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|)))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_55|) 1 0)) (= |v_ULTIMATE.start_main_#t~mem47#1_55| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 28))) (not (= 0 (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_135| 24)) 1) 1 0))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_163| |v_ULTIMATE.start_ldv_assert_~expression#1_203|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_203| 0) (= |v_#valid_144| (store |v_#valid_145| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| 0)) (= |v_#memory_$Pointer$.offset_300| (store |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70| (store (select |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_66|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_301|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_70|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_55|, #valid=|v_#valid_145|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, #memory_int=|v_#memory_int_355|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_301|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_203|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_300|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_55|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_135|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_40|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_163|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_63|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_354|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_300|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_135|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_main_#t~mem47#1, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~mem46#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, #memory_$Pointer$.offset] and [641] L1727-4-->my_callbackEXIT: Formula: (let ((.cse13 (select |v_#pthreadsMutex_393| v_my_callbackThread1of1ForFork0_~data~0.base_390))) (let ((.cse2 (store |v_#pthreadsMutex_393| v_my_callbackThread1of1ForFork0_~data~0.base_390 (store .cse13 v_my_callbackThread1of1ForFork0_~data~0.offset_390 0)))) (let ((.cse5 (select |v_#memory_$Pointer$.base_1314| v_my_callbackThread1of1ForFork1_~data~0.base_433)) (.cse3 (select .cse2 v_my_callbackThread1of1ForFork1_~data~0.base_433)) (.cse4 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_453 24)) (.cse8 (select |v_#memory_$Pointer$.base_1316| v_my_callbackThread1of1ForFork0_~data~0.base_390)) (.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_390 28)) (.cse6 (select |v_#memory_$Pointer$.offset_1314| v_my_callbackThread1of1ForFork1_~data~0.base_433)) (.cse9 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_453 28)) (.cse0 (select |v_#memory_$Pointer$.offset_1316| v_my_callbackThread1of1ForFork0_~data~0.base_390)) (.cse7 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_390 24))) (and (= (select |v_#valid_547| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_308|) 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_185| 0) (= |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_153| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_151|) (= v_my_callbackThread1of1ForFork1_~arg.base_51 |v_my_callbackThread1of1ForFork1_#in~arg.base_119|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_69 v_my_callbackThread1of1ForFork0_~__mptr~0.base_67) (= v_my_callbackThread1of1ForFork1_~data~0.base_433 v_my_callbackThread1of1ForFork1_~__mptr~0.base_65) (= v_my_callbackThread1of1ForFork0_~dev~0.base_69 v_my_callbackThread1of1ForFork0_~arg.base_69) (= v_my_callbackThread1of1ForFork0_~arg.offset_69 v_my_callbackThread1of1ForFork0_~dev~0.offset_69) (= v_my_callbackThread1of1ForFork1_~arg.offset_51 v_my_callbackThread1of1ForFork1_~dev~0.offset_53) (= (store |v_#memory_$Pointer$.offset_1316| v_my_callbackThread1of1ForFork0_~data~0.base_390 (store .cse0 .cse1 (select (select |v_#memory_$Pointer$.offset_1315| v_my_callbackThread1of1ForFork0_~data~0.base_390) .cse1))) |v_#memory_$Pointer$.offset_1315|) (= (store .cse2 v_my_callbackThread1of1ForFork1_~data~0.base_433 (store .cse3 v_my_callbackThread1of1ForFork1_~data~0.offset_453 0)) |v_#pthreadsMutex_392|) (= (store |v_#memory_$Pointer$.base_1315| v_my_callbackThread1of1ForFork1_~data~0.base_433 (store (select |v_#memory_$Pointer$.base_1315| v_my_callbackThread1of1ForFork1_~data~0.base_433) .cse4 (select .cse5 .cse4))) |v_#memory_$Pointer$.base_1314|) (= |v_#memory_$Pointer$.offset_1314| (store |v_#memory_$Pointer$.offset_1315| v_my_callbackThread1of1ForFork1_~data~0.base_433 (store (select |v_#memory_$Pointer$.offset_1315| v_my_callbackThread1of1ForFork1_~data~0.base_433) .cse4 (select .cse6 .cse4)))) (< |v_#StackHeapBarrier_180| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_308|) (= v_my_callbackThread1of1ForFork0_~arg.offset_69 |v_my_callbackThread1of1ForFork0_#in~arg.offset_158|) (= (store |v_#memory_$Pointer$.base_1313| v_my_callbackThread1of1ForFork0_~data~0.base_390 (store (select |v_#memory_$Pointer$.base_1313| v_my_callbackThread1of1ForFork0_~data~0.base_390) .cse7 (select .cse8 .cse7))) |v_#memory_$Pointer$.base_1316|) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_158| v_my_callbackThread1of1ForFork0_~arg.base_69) (= |v_my_callbackThread1of1ForFork1_#res.offset_39| 0) (= v_my_callbackThread1of1ForFork1_~dev~0.base_53 v_my_callbackThread1of1ForFork1_~arg.base_51) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_308| 0)) (= v_my_callbackThread1of1ForFork0_~data~0.base_390 v_my_callbackThread1of1ForFork0_~__mptr~0.base_67) (= (store |v_#memory_$Pointer$.base_1314| v_my_callbackThread1of1ForFork1_~data~0.base_433 (store .cse5 .cse9 (select (select |v_#memory_$Pointer$.base_1312| v_my_callbackThread1of1ForFork1_~data~0.base_433) .cse9))) |v_#memory_$Pointer$.base_1312|) (= (select .cse3 v_my_callbackThread1of1ForFork1_~data~0.offset_453) 0) (= v_my_callbackThread1of1ForFork1_~arg.offset_51 |v_my_callbackThread1of1ForFork1_#in~arg.offset_151|) (= |v_#valid_546| (store |v_#valid_547| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_308| 1)) (= v_my_callbackThread1of1ForFork1_~dev~0.base_53 v_my_callbackThread1of1ForFork1_~__mptr~0.base_65) (= |v_my_callbackThread1of1ForFork0_#res.base_57| 0) (= |v_ULTIMATE.start_main_~#data~1#1.base_451| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_151|) (= (let ((.cse10 (store |v_#memory_int_1369| v_my_callbackThread1of1ForFork0_~data~0.base_390 (let ((.cse12 (select |v_#memory_int_1369| v_my_callbackThread1of1ForFork0_~data~0.base_390))) (store (store .cse12 .cse7 1) .cse1 (+ (select .cse12 .cse1) 1)))))) (store .cse10 v_my_callbackThread1of1ForFork1_~data~0.base_433 (let ((.cse11 (select .cse10 v_my_callbackThread1of1ForFork1_~data~0.base_433))) (store (store .cse11 .cse4 1) .cse9 (+ (select .cse11 .cse9) 1))))) |v_#memory_int_1368|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_211| (select (select |v_#memory_int_1369| |v_~#t1~0.base_195|) |v_~#t1~0.offset_183|)) (= (store |v_#length_370| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_308| 4) |v_#length_369|) (= |v_my_callbackThread1of1ForFork0_#res.offset_57| 0) (= .cse7 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_67) (= v_my_callbackThread1of1ForFork1_~__mptr~0.offset_65 .cse4) (= v_my_callbackThread1of1ForFork0_~dev~0.offset_69 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_67) (= |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_153| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_151|) (= |v_#memory_$Pointer$.base_1315| (store |v_#memory_$Pointer$.base_1316| v_my_callbackThread1of1ForFork0_~data~0.base_390 (store .cse8 .cse1 (select (select |v_#memory_$Pointer$.base_1315| v_my_callbackThread1of1ForFork0_~data~0.base_390) .cse1)))) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_53 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_65) (= |v_ULTIMATE.start_main_~#data~1#1.offset_451| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_151|) (= (store |v_#memory_$Pointer$.offset_1314| v_my_callbackThread1of1ForFork1_~data~0.base_433 (store .cse6 .cse9 (select (select |v_#memory_$Pointer$.offset_1312| v_my_callbackThread1of1ForFork1_~data~0.base_433) .cse9))) |v_#memory_$Pointer$.offset_1312|) (= (store |v_#memory_$Pointer$.offset_1313| v_my_callbackThread1of1ForFork0_~data~0.base_390 (store (select |v_#memory_$Pointer$.offset_1313| v_my_callbackThread1of1ForFork0_~data~0.base_390) .cse7 (select .cse0 .cse7))) |v_#memory_$Pointer$.offset_1316|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_272| 0) (= |v_my_callbackThread1of1ForFork1_#res.base_39| 0) (= (select .cse13 v_my_callbackThread1of1ForFork0_~data~0.offset_390) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_234| 0))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_393|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1313|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_158|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_451|, ~#t1~0.offset=|v_~#t1~0.offset_183|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_151|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_119|, #StackHeapBarrier=|v_#StackHeapBarrier_180|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_158|, ~#t1~0.base=|v_~#t1~0.base_195|, #valid=|v_#valid_547|, #memory_int=|v_#memory_int_1369|, #length=|v_#length_370|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1313|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_451|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_1312|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_158|, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_65, ~#t1~0.offset=|v_~#t1~0.offset_183|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_67, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_390, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_153|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_151|, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_39|, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_57|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_220|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_234|, #length=|v_#length_369|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_151|, #pthreadsMutex=|v_#pthreadsMutex_392|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_242|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_221|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_119|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_433, #StackHeapBarrier=|v_#StackHeapBarrier_180|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_158|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_151|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_212|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_65, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_67, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_69, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_53, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1312|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_211|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_308|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_212|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_73|, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_172|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_216|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_453, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_390, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_185|, ~#t1~0.base=|v_~#t1~0.base_195|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_242|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_167|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_39|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_57|, my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_290|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_301|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_153|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_69, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_51, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_451|, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_51, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_272|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_69, #valid=|v_#valid_546|, #memory_int=|v_#memory_int_1368|, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_53, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_69, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_451|} AuxVars[|v_#memory_$Pointer$.offset_1315|, |v_#memory_$Pointer$.offset_1314|, |v_#memory_$Pointer$.base_1316|, |v_#memory_$Pointer$.offset_1316|, |v_#memory_$Pointer$.base_1315|, |v_#memory_$Pointer$.base_1314|] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork1_#t~nondet31, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_probe_#t~pre38#1, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_#res.base, my_callbackThread1of1ForFork0_~data~0.offset, ULTIMATE.start_my_drv_probe_#res#1, my_callbackThread1of1ForFork0_#res.base, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_main_~probe_ret~0#1, #length, ULTIMATE.start_my_drv_probe_#t~nondet39#1, my_callbackThread1of1ForFork1_#res.offset, my_callbackThread1of1ForFork0_#res.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, my_callbackThread1of1ForFork1_#t~mem32, #pthreadsMutex, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, my_callbackThread1of1ForFork0_#t~mem32, ULTIMATE.start_my_drv_disconnect_~data#1.offset, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork1_~arg.base, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, my_callbackThread1of1ForFork0_~arg.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #valid, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] [2022-12-06 06:49:10,311 WARN L233 SmtUtils]: Spent 7.93s on a formula simplification that was a NOOP. DAG size: 216 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 06:49:17,733 WARN L233 SmtUtils]: Spent 7.42s on a formula simplification that was a NOOP. DAG size: 210 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 06:49:26,273 WARN L233 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 219 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 06:49:34,306 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 213 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 06:49:34,308 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:49:34,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31930 [2022-12-06 06:49:34,308 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 10 transitions, 39 flow [2022-12-06 06:49:34,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:49:34,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:49:34,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:49:34,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 06:49:34,309 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 06:49:34,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:49:34,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1655116590, now seen corresponding path program 1 times [2022-12-06 06:49:34,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:49:34,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864665076] [2022-12-06 06:49:34,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:49:34,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:49:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:49:35,046 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:49:35,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:49:35,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864665076] [2022-12-06 06:49:35,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864665076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:49:35,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:49:35,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:49:35,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865315696] [2022-12-06 06:49:35,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:49:35,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:49:35,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:49:35,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:49:35,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:49:35,047 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 10 [2022-12-06 06:49:35,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 10 transitions, 39 flow. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:49:35,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:49:35,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 10 [2022-12-06 06:49:35,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:49:35,168 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-06 06:49:35,168 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:49:35,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 8 events. 0/8 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 1/9 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-06 06:49:35,168 INFO L137 encePairwiseOnDemand]: 5/10 looper letters, 0 selfloop transitions, 0 changer transitions 8/8 dead transitions. [2022-12-06 06:49:35,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 8 transitions, 41 flow [2022-12-06 06:49:35,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:49:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:49:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2022-12-06 06:49:35,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15 [2022-12-06 06:49:35,169 INFO L175 Difference]: Start difference. First operand has 17 places, 10 transitions, 39 flow. Second operand 6 states and 9 transitions. [2022-12-06 06:49:35,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 8 transitions, 41 flow [2022-12-06 06:49:35,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 8 transitions, 34 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:49:35,169 INFO L231 Difference]: Finished difference. Result has 16 places, 0 transitions, 0 flow [2022-12-06 06:49:35,170 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=10, PETRI_DIFFERENCE_MINUEND_FLOW=18, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=16, PETRI_TRANSITIONS=0} [2022-12-06 06:49:35,170 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -23 predicate places. [2022-12-06 06:49:35,170 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:49:35,170 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 16 places, 0 transitions, 0 flow [2022-12-06 06:49:35,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 06:49:35,171 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 06:49:35,171 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:49:35,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 06:49:35,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 06:49:35,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 06:49:35,171 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:49:35,171 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-06 06:49:35,171 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 06:49:35,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:49:35,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-12-06 06:49:35,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-12-06 06:49:35,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-12-06 06:49:35,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-12-06 06:49:35,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-12-06 06:49:35,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-12-06 06:49:35,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2022-12-06 06:49:35,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2022-12-06 06:49:35,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 06:49:35,174 INFO L458 BasicCegarLoop]: Path program histogram: [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:49:35,176 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:49:35,176 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:49:35,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:49:35 BasicIcfg [2022-12-06 06:49:35,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:49:35,178 INFO L158 Benchmark]: Toolchain (without parser) took 151172.29ms. Allocated memory was 183.5MB in the beginning and 778.0MB in the end (delta: 594.5MB). Free memory was 156.3MB in the beginning and 547.5MB in the end (delta: -391.2MB). Peak memory consumption was 204.1MB. Max. memory is 8.0GB. [2022-12-06 06:49:35,179 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:49:35,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 854.95ms. Allocated memory is still 183.5MB. Free memory was 156.3MB in the beginning and 100.4MB in the end (delta: 55.9MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. [2022-12-06 06:49:35,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.88ms. Allocated memory is still 183.5MB. Free memory was 100.4MB in the beginning and 96.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-12-06 06:49:35,179 INFO L158 Benchmark]: Boogie Preprocessor took 32.31ms. Allocated memory is still 183.5MB. Free memory was 96.7MB in the beginning and 94.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:49:35,179 INFO L158 Benchmark]: RCFGBuilder took 615.13ms. Allocated memory was 183.5MB in the beginning and 259.0MB in the end (delta: 75.5MB). Free memory was 94.1MB in the beginning and 215.7MB in the end (delta: -121.6MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-12-06 06:49:35,179 INFO L158 Benchmark]: TraceAbstraction took 149588.30ms. Allocated memory was 259.0MB in the beginning and 778.0MB in the end (delta: 519.0MB). Free memory was 215.2MB in the beginning and 547.5MB in the end (delta: -332.3MB). Peak memory consumption was 186.2MB. Max. memory is 8.0GB. [2022-12-06 06:49:35,180 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 854.95ms. Allocated memory is still 183.5MB. Free memory was 156.3MB in the beginning and 100.4MB in the end (delta: 55.9MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.88ms. Allocated memory is still 183.5MB. Free memory was 100.4MB in the beginning and 96.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.31ms. Allocated memory is still 183.5MB. Free memory was 96.7MB in the beginning and 94.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 615.13ms. Allocated memory was 183.5MB in the beginning and 259.0MB in the end (delta: 75.5MB). Free memory was 94.1MB in the beginning and 215.7MB in the end (delta: -121.6MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * TraceAbstraction took 149588.30ms. Allocated memory was 259.0MB in the beginning and 778.0MB in the end (delta: 519.0MB). Free memory was 215.2MB in the beginning and 547.5MB in the end (delta: -332.3MB). Peak memory consumption was 186.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.1s, 162 PlacesBefore, 39 PlacesAfterwards, 162 TransitionsBefore, 35 TransitionsAfterwards, 2604 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 76 TrivialYvCompositions, 50 ConcurrentYvCompositions, 4 ChoiceCompositions, 132 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1835, independent: 1744, independent conditional: 1744, independent unconditional: 0, dependent: 81, dependent conditional: 81, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1835, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1835, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1835, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1512, independent: 1475, independent conditional: 0, independent unconditional: 1475, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1512, independent: 1472, independent conditional: 0, independent unconditional: 1472, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15509, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 289, dependent conditional: 0, dependent unconditional: 289, unknown: 15213, unknown conditional: 0, unknown unconditional: 15213] ], Cache Queries: [ total: 1835, independent: 269, independent conditional: 0, independent unconditional: 269, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 1515, unknown conditional: 0, unknown unconditional: 1515] , Statistics on independence cache: Total cache size (in pairs): 2485, Positive cache size: 2455, Positive conditional cache size: 0, Positive unconditional cache size: 2455, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 0, Unknown unconditional cache size: 7, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 33 PlacesBefore, 32 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 144, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 144, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 144, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 67, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 67, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2294, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 2169, unknown conditional: 0, unknown unconditional: 2169] ], Cache Queries: [ total: 144, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 68, unknown conditional: 0, unknown unconditional: 68] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 45, Positive conditional cache size: 0, Positive unconditional cache size: 45, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 35 PlacesBefore, 35 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, independent: 85, independent conditional: 85, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 105, independent: 85, independent conditional: 8, independent unconditional: 77, dependent: 15, dependent conditional: 3, dependent unconditional: 12, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 105, independent: 85, independent conditional: 8, independent unconditional: 77, dependent: 15, dependent conditional: 3, dependent unconditional: 12, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 105, independent: 85, independent conditional: 8, independent unconditional: 77, dependent: 15, dependent conditional: 3, dependent unconditional: 12, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4442, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 89, dependent conditional: 89, dependent unconditional: 0, unknown: 4354, unknown conditional: 4354, unknown unconditional: 0] ], Cache Queries: [ total: 105, independent: 78, independent conditional: 8, independent unconditional: 70, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 15, unknown conditional: 7, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 3, Unknown conditional cache size: 2, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 37 PlacesBefore, 36 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 648, independent: 557, independent conditional: 557, independent unconditional: 0, dependent: 88, dependent conditional: 88, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 648, independent: 557, independent conditional: 60, independent unconditional: 497, dependent: 88, dependent conditional: 18, dependent unconditional: 70, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 666, independent: 557, independent conditional: 60, independent unconditional: 497, dependent: 106, dependent conditional: 36, dependent unconditional: 70, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 666, independent: 557, independent conditional: 60, independent unconditional: 497, dependent: 106, dependent conditional: 36, dependent unconditional: 70, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, independent: 32, independent conditional: 2, independent unconditional: 30, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 40, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 12, dependent conditional: 10, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 666, independent: 525, independent conditional: 58, independent unconditional: 467, dependent: 98, dependent conditional: 30, dependent unconditional: 68, unknown: 43, unknown conditional: 8, unknown unconditional: 35] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 98, Positive conditional cache size: 2, Positive unconditional cache size: 96, Negative cache size: 32, Negative conditional cache size: 9, Negative unconditional cache size: 23, Unknown cache size: 3, Unknown conditional cache size: 2, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 100, Positive conditional cache size: 2, Positive unconditional cache size: 98, Negative cache size: 33, Negative conditional cache size: 9, Negative unconditional cache size: 24, Unknown cache size: 3, Unknown conditional cache size: 2, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 31 PlacesBefore, 30 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 19, independent conditional: 8, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 19, independent conditional: 8, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 19, independent conditional: 8, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6499, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 175, dependent conditional: 0, dependent unconditional: 175, unknown: 6322, unknown conditional: 0, unknown unconditional: 6322] ], Cache Queries: [ total: 33, independent: 14, independent conditional: 4, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 14, unknown conditional: 4, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 107, Positive conditional cache size: 6, Positive unconditional cache size: 101, Negative cache size: 36, Negative conditional cache size: 9, Negative unconditional cache size: 27, Unknown cache size: 6, Unknown conditional cache size: 2, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 36 PlacesBefore, 36 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 9, dependent conditional: 4, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 9, dependent conditional: 4, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 9, dependent conditional: 4, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 215, independent: 204, independent conditional: 204, independent unconditional: 0, dependent: 11, dependent conditional: 10, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 12, independent conditional: 10, independent unconditional: 2, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 112, Positive conditional cache size: 10, Positive unconditional cache size: 102, Negative cache size: 39, Negative conditional cache size: 11, Negative unconditional cache size: 28, Unknown cache size: 6, Unknown conditional cache size: 2, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 52 PlacesBefore, 51 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 40, dependent conditional: 14, dependent unconditional: 26, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 40, dependent conditional: 14, dependent unconditional: 26, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 40, dependent conditional: 14, dependent unconditional: 26, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2515, independent: 223, independent conditional: 223, independent unconditional: 0, dependent: 105, dependent conditional: 103, dependent unconditional: 3, unknown: 2187, unknown conditional: 2187, unknown unconditional: 0] ], Cache Queries: [ total: 79, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 35, dependent conditional: 11, dependent unconditional: 24, unknown: 14, unknown conditional: 12, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 125, Positive conditional cache size: 17, Positive unconditional cache size: 108, Negative cache size: 44, Negative conditional cache size: 14, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 9, independent conditional: 9, 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: 26, independent: 9, independent conditional: 6, independent unconditional: 3, dependent: 17, dependent conditional: 14, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 9, independent conditional: 6, independent unconditional: 3, dependent: 17, dependent conditional: 14, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 9, independent conditional: 6, independent unconditional: 3, dependent: 17, dependent conditional: 14, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 15, dependent conditional: 12, dependent unconditional: 3, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 127, Positive conditional cache size: 17, Positive unconditional cache size: 110, Negative cache size: 46, Negative conditional cache size: 16, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 27, independent conditional: 14, independent unconditional: 13, dependent: 18, dependent conditional: 15, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, independent: 27, independent conditional: 14, independent unconditional: 13, dependent: 22, dependent conditional: 19, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, independent: 27, independent conditional: 14, independent unconditional: 13, dependent: 22, dependent conditional: 19, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, independent: 27, independent conditional: 14, independent unconditional: 13, dependent: 20, dependent conditional: 17, dependent unconditional: 3, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 127, Positive conditional cache size: 17, Positive unconditional cache size: 110, Negative cache size: 48, Negative conditional cache size: 18, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 71 PlacesBefore, 71 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 22, independent conditional: 18, independent unconditional: 4, dependent: 16, dependent conditional: 12, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, independent: 22, independent conditional: 18, independent unconditional: 4, dependent: 21, dependent conditional: 17, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, independent: 22, independent conditional: 18, independent unconditional: 4, dependent: 21, dependent conditional: 17, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 15, dependent conditional: 11, dependent unconditional: 4, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 135, Positive conditional cache size: 21, Positive unconditional cache size: 114, Negative cache size: 54, Negative conditional cache size: 24, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 82 PlacesBefore, 81 PlacesAfterwards, 67 TransitionsBefore, 66 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 15, 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: 25, independent: 15, independent conditional: 7, independent unconditional: 8, dependent: 10, dependent conditional: 6, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 15, independent conditional: 7, independent unconditional: 8, dependent: 12, dependent conditional: 8, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 15, independent conditional: 7, independent unconditional: 8, dependent: 12, dependent conditional: 8, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 15, independent conditional: 7, independent unconditional: 8, dependent: 11, dependent conditional: 7, dependent unconditional: 4, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 135, Positive conditional cache size: 21, Positive unconditional cache size: 114, Negative cache size: 55, Negative conditional cache size: 25, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 82 PlacesBefore, 83 PlacesAfterwards, 70 TransitionsBefore, 71 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, independent: 154, independent conditional: 154, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 210, independent: 154, independent conditional: 96, independent unconditional: 58, dependent: 56, dependent conditional: 18, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 212, independent: 154, independent conditional: 96, independent unconditional: 58, dependent: 58, dependent conditional: 20, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 212, independent: 154, independent conditional: 96, independent unconditional: 58, dependent: 58, dependent conditional: 20, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 212, independent: 149, independent conditional: 92, independent unconditional: 57, dependent: 56, dependent conditional: 18, dependent unconditional: 38, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 140, Positive conditional cache size: 25, Positive unconditional cache size: 115, Negative cache size: 57, Negative conditional cache size: 27, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 84 PlacesBefore, 83 PlacesAfterwards, 65 TransitionsBefore, 64 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 21, independent conditional: 11, independent unconditional: 10, dependent: 45, dependent conditional: 9, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68, independent: 21, independent conditional: 11, independent unconditional: 10, dependent: 47, dependent conditional: 11, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68, independent: 21, independent conditional: 11, independent unconditional: 10, dependent: 47, dependent conditional: 11, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, independent: 20, independent conditional: 10, independent unconditional: 10, dependent: 45, dependent conditional: 9, dependent unconditional: 36, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 143, Positive conditional cache size: 26, Positive unconditional cache size: 117, Negative cache size: 59, Negative conditional cache size: 29, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 86 PlacesBefore, 85 PlacesAfterwards, 68 TransitionsBefore, 67 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 61, independent: 43, independent conditional: 29, independent unconditional: 14, dependent: 16, dependent conditional: 12, dependent unconditional: 4, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 43, independent conditional: 29, independent unconditional: 14, dependent: 16, dependent conditional: 12, dependent unconditional: 4, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 43, independent conditional: 29, independent unconditional: 14, dependent: 16, dependent conditional: 12, dependent unconditional: 4, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, independent: 42, independent conditional: 28, independent unconditional: 14, dependent: 16, dependent conditional: 12, dependent unconditional: 4, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 161, Positive conditional cache size: 30, Positive unconditional cache size: 131, Negative cache size: 59, Negative conditional cache size: 29, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 81 PlacesBefore, 81 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, independent: 22, independent conditional: 22, 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: 73, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 51, dependent conditional: 21, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 73, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 51, dependent conditional: 21, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 73, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 51, dependent conditional: 21, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 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.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 73, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 51, dependent conditional: 21, dependent unconditional: 30, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 164, Positive conditional cache size: 32, Positive unconditional cache size: 132, Negative cache size: 59, Negative conditional cache size: 29, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 7, independent conditional: 7, 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: 26, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 19, dependent conditional: 7, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 19, dependent conditional: 7, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 19, dependent conditional: 7, dependent unconditional: 12, 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: 26, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 19, dependent conditional: 7, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 164, Positive conditional cache size: 32, Positive unconditional cache size: 132, Negative cache size: 59, Negative conditional cache size: 29, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 78 PlacesBefore, 78 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 8, independent conditional: 8, 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: 32, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 24, dependent conditional: 9, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 30, dependent conditional: 15, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 30, dependent conditional: 15, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 179, independent: 168, independent conditional: 168, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 27, dependent conditional: 12, dependent unconditional: 15, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 166, Positive conditional cache size: 34, Positive unconditional cache size: 132, Negative cache size: 62, Negative conditional cache size: 32, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 84 PlacesBefore, 84 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 61, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 169, Positive conditional cache size: 34, Positive unconditional cache size: 135, Negative cache size: 65, Negative conditional cache size: 35, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 90 PlacesBefore, 90 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 21, independent conditional: 10, independent unconditional: 11, dependent: 28, dependent conditional: 8, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 21, independent conditional: 10, independent unconditional: 11, dependent: 36, dependent conditional: 16, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 21, independent conditional: 10, independent unconditional: 11, dependent: 36, dependent conditional: 16, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, independent: 20, independent conditional: 9, independent unconditional: 11, dependent: 34, dependent conditional: 14, dependent unconditional: 20, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 237, Positive cache size: 170, Positive conditional cache size: 35, Positive unconditional cache size: 135, Negative cache size: 67, Negative conditional cache size: 37, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 95 PlacesBefore, 93 PlacesAfterwards, 75 TransitionsBefore, 74 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 175, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 165, dependent conditional: 165, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 175, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 165, dependent conditional: 165, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 175, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 156, dependent conditional: 156, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 172, Positive conditional cache size: 35, Positive unconditional cache size: 137, Negative cache size: 76, Negative conditional cache size: 46, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 94 PlacesBefore, 94 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 70, independent: 42, independent conditional: 20, independent unconditional: 22, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 142, independent: 42, independent conditional: 20, independent unconditional: 22, dependent: 100, dependent conditional: 100, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 142, independent: 42, independent conditional: 20, independent unconditional: 22, dependent: 100, dependent conditional: 100, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 142, independent: 41, independent conditional: 20, independent unconditional: 21, dependent: 92, dependent conditional: 92, dependent unconditional: 0, unknown: 9, unknown conditional: 8, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 173, Positive conditional cache size: 35, Positive unconditional cache size: 138, Negative cache size: 84, Negative conditional cache size: 54, Negative unconditional cache size: 30, Unknown cache size: 7, Unknown conditional cache size: 3, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 94 PlacesBefore, 95 PlacesAfterwards, 67 TransitionsBefore, 69 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 136, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 136, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 60, dependent conditional: 52, dependent unconditional: 8, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 222, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 146, dependent conditional: 138, dependent unconditional: 8, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 146, dependent conditional: 138, dependent unconditional: 8, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2173, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 2162, unknown conditional: 2162, unknown unconditional: 0] ], Cache Queries: [ total: 222, independent: 73, independent conditional: 73, independent unconditional: 0, dependent: 144, dependent conditional: 136, dependent unconditional: 8, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 260, Positive cache size: 174, Positive conditional cache size: 36, Positive unconditional cache size: 138, Negative cache size: 86, Negative conditional cache size: 56, Negative unconditional cache size: 30, Unknown cache size: 8, Unknown conditional cache size: 4, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 83 PlacesBefore, 83 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 22, dependent conditional: 20, dependent unconditional: 2, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 56, dependent conditional: 54, dependent unconditional: 2, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 56, dependent conditional: 54, dependent unconditional: 2, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2195, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 2188, unknown conditional: 2188, unknown unconditional: 0] ], Cache Queries: [ total: 63, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 54, dependent conditional: 52, dependent unconditional: 2, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 174, Positive conditional cache size: 36, Positive unconditional cache size: 138, Negative cache size: 88, Negative conditional cache size: 58, Negative unconditional cache size: 30, Unknown cache size: 9, Unknown conditional cache size: 5, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 77 PlacesBefore, 72 PlacesAfterwards, 45 TransitionsBefore, 42 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 86, independent: 31, independent conditional: 7, independent unconditional: 24, dependent: 51, dependent conditional: 47, dependent unconditional: 4, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 31, independent conditional: 7, independent unconditional: 24, dependent: 69, dependent conditional: 65, dependent unconditional: 4, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 31, independent conditional: 7, independent unconditional: 24, dependent: 69, dependent conditional: 65, dependent unconditional: 4, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, independent: 30, independent conditional: 6, independent unconditional: 24, dependent: 66, dependent conditional: 62, dependent unconditional: 4, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 182, Positive conditional cache size: 37, Positive unconditional cache size: 145, Negative cache size: 91, Negative conditional cache size: 61, Negative unconditional cache size: 30, Unknown cache size: 9, Unknown conditional cache size: 5, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 47 PlacesBefore, 43 PlacesAfterwards, 29 TransitionsBefore, 25 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 10, 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: 20, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 201, Positive conditional cache size: 39, Positive unconditional cache size: 162, Negative cache size: 96, Negative conditional cache size: 66, Negative unconditional cache size: 30, Unknown cache size: 9, Unknown conditional cache size: 5, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 201, Positive conditional cache size: 39, Positive unconditional cache size: 162, Negative cache size: 96, Negative conditional cache size: 66, Negative unconditional cache size: 30, Unknown cache size: 9, Unknown conditional cache size: 5, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 40 PlacesBefore, 38 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 205, Positive conditional cache size: 39, Positive unconditional cache size: 166, Negative cache size: 96, Negative conditional cache size: 66, Negative unconditional cache size: 30, Unknown cache size: 9, Unknown conditional cache size: 5, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.9s, 31 PlacesBefore, 29 PlacesAfterwards, 13 TransitionsBefore, 12 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 207, Positive conditional cache size: 39, Positive unconditional cache size: 168, Negative cache size: 96, Negative conditional cache size: 66, Negative unconditional cache size: 30, Unknown cache size: 9, Unknown conditional cache size: 5, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.9s, 16 PlacesBefore, 17 PlacesAfterwards, 9 TransitionsBefore, 10 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 207, Positive conditional cache size: 39, Positive unconditional cache size: 168, Negative cache size: 96, Negative conditional cache size: 66, Negative unconditional cache size: 30, Unknown cache size: 9, Unknown conditional cache size: 5, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 207, Positive conditional cache size: 39, Positive unconditional cache size: 168, Negative cache size: 96, Negative conditional cache size: 66, Negative unconditional cache size: 30, Unknown cache size: 9, Unknown conditional cache size: 5, Unknown unconditional cache size: 4, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 183 locations, 8 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: 149.5s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 26.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 817 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 817 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 518 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8519 IncrementalHoareTripleChecker+Invalid, 9037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 518 mSolverCounterUnsat, 52 mSDtfsCounter, 8519 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 426 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=792occurred in iteration=19, InterpolantAutomatonStates: 282, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 21.9s InterpolantComputationTime, 446 NumberOfCodeBlocks, 446 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 416 ConstructedInterpolants, 0 QuantifiedInterpolants, 10041 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 06:49:35,253 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...