/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-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:47:20,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:47:20,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:47:20,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:47:20,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:47:20,515 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:47:20,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:47:20,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:47:20,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:47:20,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:47:20,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:47:20,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:47:20,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:47:20,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:47:20,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:47:20,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:47:20,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:47:20,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:47:20,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:47:20,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:47:20,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:47:20,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:47:20,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:47:20,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:47:20,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:47:20,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:47:20,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:47:20,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:47:20,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:47:20,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:47:20,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:47:20,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:47:20,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:47:20,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:47:20,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:47:20,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:47:20,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:47:20,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:47:20,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:47:20,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:47:20,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:47:20,563 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:20,591 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:47:20,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:47:20,593 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:47:20,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:47:20,593 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:47:20,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:47:20,594 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:47:20,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:47:20,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:47:20,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:47:20,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:47:20,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:47:20,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:47:20,596 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:47:20,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:47:20,596 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:47:20,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:47:20,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:47:20,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:47:20,597 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:47:20,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:47:20,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:47:20,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:47:20,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:47:20,598 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:47:20,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:47:20,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:47:20,598 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:47:20,598 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:20,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:47:20,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:47:20,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:47:20,915 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:47:20,915 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:47:20,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2022-12-06 06:47:21,972 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:47:22,318 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:47:22,319 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2022-12-06 06:47:22,358 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4718e64f/2dfc35f9f4be4703933a1035991b6bf6/FLAG5eb375077 [2022-12-06 06:47:22,369 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4718e64f/2dfc35f9f4be4703933a1035991b6bf6 [2022-12-06 06:47:22,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:47:22,372 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:47:22,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:47:22,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:47:22,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:47:22,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:47:22" (1/1) ... [2022-12-06 06:47:22,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58b9177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:47:22, skipping insertion in model container [2022-12-06 06:47:22,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:47:22" (1/1) ... [2022-12-06 06:47:22,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:47:22,442 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:47:22,836 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-3_1-container_of-global.i[76084,76097] [2022-12-06 06:47:22,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:47:22,874 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:47:22,922 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-3_1-container_of-global.i[76084,76097] [2022-12-06 06:47:22,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:47:22,998 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:47:22,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:47:22 WrapperNode [2022-12-06 06:47:22,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:47:23,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:47:23,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:47:23,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:47:23,006 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:22" (1/1) ... [2022-12-06 06:47:23,031 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:22" (1/1) ... [2022-12-06 06:47:23,049 INFO L138 Inliner]: procedures = 482, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 134 [2022-12-06 06:47:23,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:47:23,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:47:23,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:47:23,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:47:23,055 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:22" (1/1) ... [2022-12-06 06:47:23,055 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:22" (1/1) ... [2022-12-06 06:47:23,058 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:22" (1/1) ... [2022-12-06 06:47:23,058 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:22" (1/1) ... [2022-12-06 06:47:23,074 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:22" (1/1) ... [2022-12-06 06:47:23,075 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:22" (1/1) ... [2022-12-06 06:47:23,078 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:22" (1/1) ... [2022-12-06 06:47:23,079 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:22" (1/1) ... [2022-12-06 06:47:23,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:47:23,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:47:23,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:47:23,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:47:23,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:47:22" (1/1) ... [2022-12-06 06:47:23,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:47:23,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:47:23,106 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:23,111 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:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:47:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:47:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 06:47:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:47:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-06 06:47:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:47:23,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:47:23,136 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-12-06 06:47:23,136 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-12-06 06:47:23,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:47:23,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:47:23,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:47:23,137 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:23,390 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:47:23,392 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:47:23,612 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:47:23,621 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:47:23,624 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:47:23,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:47:23 BoogieIcfgContainer [2022-12-06 06:47:23,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:47:23,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:47:23,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:47:23,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:47:23,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:47:22" (1/3) ... [2022-12-06 06:47:23,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ec085a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:47:23, skipping insertion in model container [2022-12-06 06:47:23,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:47:22" (2/3) ... [2022-12-06 06:47:23,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ec085a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:47:23, skipping insertion in model container [2022-12-06 06:47:23,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:47:23" (3/3) ... [2022-12-06 06:47:23,633 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2022-12-06 06:47:23,645 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:47:23,646 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-06 06:47:23,646 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:47:23,708 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 06:47:23,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 173 transitions, 362 flow [2022-12-06 06:47:23,844 INFO L130 PetriNetUnfolder]: 10/211 cut-off events. [2022-12-06 06:47:23,845 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:47:23,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 211 events. 10/211 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 357 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 124. Up to 4 conditions per place. [2022-12-06 06:47:23,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 173 transitions, 362 flow [2022-12-06 06:47:23,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 161 transitions, 334 flow [2022-12-06 06:47:23,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:47:23,871 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 161 transitions, 334 flow [2022-12-06 06:47:23,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 161 transitions, 334 flow [2022-12-06 06:47:23,898 INFO L130 PetriNetUnfolder]: 7/192 cut-off events. [2022-12-06 06:47:23,898 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:47:23,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 192 events. 7/192 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 298 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 114. Up to 4 conditions per place. [2022-12-06 06:47:23,902 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 161 transitions, 334 flow [2022-12-06 06:47:23,902 INFO L188 LiptonReduction]: Number of co-enabled transitions 2392 [2022-12-06 06:47:24,032 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:24,033 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:24,035 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:24,036 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:24,141 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:24,143 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:24,145 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:24,146 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:26,849 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:26,850 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:26,852 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:26,852 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:27,346 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:27,347 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:27,349 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:27,350 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:27,558 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:27,572 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:27,576 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:27,577 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:27,579 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:27,580 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:27,581 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:27,582 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:27,871 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:27,873 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:27,875 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:27,876 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:27,912 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:27,913 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:27,915 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:27,916 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:28,052 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:28,053 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:28,054 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:28,063 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:28,222 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:28,223 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:28,224 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:28,225 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:28,493 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:28,494 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2022-12-06 06:47:28,497 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:28,497 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:28,500 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:28,500 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:28,503 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:28,504 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:29,302 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:29,303 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:29,304 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:29,305 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:29,337 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:29,337 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:29,339 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:29,340 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:29,616 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:29,616 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 06:47:29,619 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:29,620 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:29,622 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:29,622 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 06:47:29,637 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:29,638 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:30,998 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:30,999 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 06:47:31,003 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:31,003 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:31,006 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:31,007 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 06:47:31,029 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:31,029 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:32,119 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:32,131 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 06:47:32,135 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:32,136 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:32,140 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:32,140 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 06:47:32,145 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:32,145 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:33,513 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:33,515 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:33,518 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:33,522 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:38,159 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:38,160 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:38,161 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:38,162 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:43,563 INFO L203 LiptonReduction]: Total number of compositions: 131 [2022-12-06 06:47:43,582 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:47:43,586 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;@57e06b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:47:43,587 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-06 06:47:43,587 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 06:47:43,588 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:47:43,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:47:43,588 INFO L213 CegarLoopForPetriNet]: trace histogram [1] [2022-12-06 06:47:43,588 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:43,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:47:43,591 INFO L85 PathProgramCache]: Analyzing trace with hash 588, now seen corresponding path program 1 times [2022-12-06 06:47:43,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:47:43,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756538685] [2022-12-06 06:47:43,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:47:43,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:47:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:47:43,836 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:43,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:47:43,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756538685] [2022-12-06 06:47:43,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756538685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:47:43,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:47:43,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-06 06:47:43,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276935228] [2022-12-06 06:47:43,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:47:43,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 06:47:43,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:47:43,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 06:47:43,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 06:47:43,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-06 06:47:43,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 82 flow. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:47:43,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:47:43,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-06 06:47:43,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:47:44,003 INFO L130 PetriNetUnfolder]: 338/634 cut-off events. [2022-12-06 06:47:44,003 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-06 06:47:44,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 634 events. 338/634 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3186 event pairs, 337 based on Foata normal form. 31/510 useless extension candidates. Maximal degree in co-relation 1138. Up to 588 conditions per place. [2022-12-06 06:47:44,010 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2022-12-06 06:47:44,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 132 flow [2022-12-06 06:47:44,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 06:47:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 06:47:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2022-12-06 06:47:44,020 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2022-12-06 06:47:44,021 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 82 flow. Second operand 2 states and 39 transitions. [2022-12-06 06:47:44,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 132 flow [2022-12-06 06:47:44,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:47:44,025 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 68 flow [2022-12-06 06:47:44,027 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:44,030 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2022-12-06 06:47:44,030 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:47:44,030 INFO L89 Accepts]: Start accepts. Operand has 34 places, 32 transitions, 68 flow [2022-12-06 06:47:44,032 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:47:44,033 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:47:44,033 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 32 transitions, 68 flow [2022-12-06 06:47:44,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 32 transitions, 68 flow [2022-12-06 06:47:44,040 INFO L130 PetriNetUnfolder]: 1/38 cut-off events. [2022-12-06 06:47:44,040 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:47:44,040 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 89 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:44,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 32 transitions, 68 flow [2022-12-06 06:47:44,041 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 06:47:44,056 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:44,057 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:44,058 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:44,059 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:46,475 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:47:46,477 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2447 [2022-12-06 06:47:46,477 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 66 flow [2022-12-06 06:47:46,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:47:46,477 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:47:46,477 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-06 06:47:46,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:47:46,477 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:46,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:47:46,478 INFO L85 PathProgramCache]: Analyzing trace with hash 18236139, now seen corresponding path program 1 times [2022-12-06 06:47:46,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:47:46,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729442960] [2022-12-06 06:47:46,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:47:46,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:47:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:47:46,898 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:46,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:47:46,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729442960] [2022-12-06 06:47:46,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729442960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:47:46,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:47:46,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:47:46,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500763503] [2022-12-06 06:47:46,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:47:46,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:47:46,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:47:46,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:47:46,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:47:46,901 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 06:47:46,901 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:46,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:47:46,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 06:47:46,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:47:47,117 INFO L130 PetriNetUnfolder]: 861/1449 cut-off events. [2022-12-06 06:47:47,117 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:47:47,119 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 7191 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:47,125 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 40 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2022-12-06 06:47:47,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 46 transitions, 188 flow [2022-12-06 06:47:47,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:47:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:47:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 06:47:47,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5053763440860215 [2022-12-06 06:47:47,128 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:47,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 46 transitions, 188 flow [2022-12-06 06:47:47,128 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:47,129 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 102 flow [2022-12-06 06:47:47,130 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:47,130 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2022-12-06 06:47:47,130 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:47:47,130 INFO L89 Accepts]: Start accepts. Operand has 35 places, 35 transitions, 102 flow [2022-12-06 06:47:47,131 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:47:47,131 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:47:47,131 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 35 transitions, 102 flow [2022-12-06 06:47:47,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 35 transitions, 102 flow [2022-12-06 06:47:47,144 INFO L130 PetriNetUnfolder]: 29/133 cut-off events. [2022-12-06 06:47:47,144 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 06:47:47,145 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 615 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:47,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 35 transitions, 102 flow [2022-12-06 06:47:47,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-06 06:47:51,679 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:47:51,680 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4550 [2022-12-06 06:47:51,680 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 35 transitions, 102 flow [2022-12-06 06:47:51,680 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:51,680 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:47:51,680 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:47:51,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:47:51,680 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:51,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:47:51,681 INFO L85 PathProgramCache]: Analyzing trace with hash 565320332, now seen corresponding path program 1 times [2022-12-06 06:47:51,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:47:51,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638938623] [2022-12-06 06:47:51,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:47:51,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:47:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:47:51,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:47:51,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:47:51,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638938623] [2022-12-06 06:47:51,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638938623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:47:51,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:47:51,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:47:51,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612748375] [2022-12-06 06:47:51,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:47:51,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:47:51,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:47:51,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:47:51,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:47:51,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 06:47:51,886 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:51,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:47:51,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 06:47:51,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:47:52,095 INFO L130 PetriNetUnfolder]: 935/1593 cut-off events. [2022-12-06 06:47:52,095 INFO L131 PetriNetUnfolder]: For 324/324 co-relation queries the response was YES. [2022-12-06 06:47:52,097 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 108. Compared 8260 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:52,103 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 42 selfloop transitions, 9 changer transitions 2/53 dead transitions. [2022-12-06 06:47:52,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 53 transitions, 266 flow [2022-12-06 06:47:52,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:47:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:47:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 06:47:52,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4946236559139785 [2022-12-06 06:47:52,105 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:52,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 53 transitions, 266 flow [2022-12-06 06:47:52,109 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:52,110 INFO L231 Difference]: Finished difference. Result has 37 places, 41 transitions, 167 flow [2022-12-06 06:47:52,110 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:52,111 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2022-12-06 06:47:52,111 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:47:52,111 INFO L89 Accepts]: Start accepts. Operand has 37 places, 41 transitions, 167 flow [2022-12-06 06:47:52,112 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:47:52,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:47:52,112 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 41 transitions, 167 flow [2022-12-06 06:47:52,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 41 transitions, 167 flow [2022-12-06 06:47:52,127 INFO L130 PetriNetUnfolder]: 72/209 cut-off events. [2022-12-06 06:47:52,127 INFO L131 PetriNetUnfolder]: For 96/98 co-relation queries the response was YES. [2022-12-06 06:47:52,127 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 1053 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:52,128 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 41 transitions, 167 flow [2022-12-06 06:47:52,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-06 06:47:52,158 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:52,158 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:52,159 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:52,160 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:52,297 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [572] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_59|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_86|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_484|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_539|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_47|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_484|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_61|} 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 [440] L1712-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_37 28))) (and (= (store |v_#memory_$Pointer$.offset_48| v_my_callbackThread1of1ForFork1_~data~0.base_37 (store (select |v_#memory_$Pointer$.offset_48| v_my_callbackThread1of1ForFork1_~data~0.base_37) .cse0 (select (select |v_#memory_$Pointer$.offset_47| v_my_callbackThread1of1ForFork1_~data~0.base_37) .cse0))) |v_#memory_$Pointer$.offset_47|) (= (store |v_#memory_int_69| v_my_callbackThread1of1ForFork1_~data~0.base_37 (store (select |v_#memory_int_69| v_my_callbackThread1of1ForFork1_~data~0.base_37) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem32_16| 1))) |v_#memory_int_68|) (= (store |v_#memory_$Pointer$.base_48| v_my_callbackThread1of1ForFork1_~data~0.base_37 (store (select |v_#memory_$Pointer$.base_48| v_my_callbackThread1of1ForFork1_~data~0.base_37) .cse0 (select (select |v_#memory_$Pointer$.base_47| v_my_callbackThread1of1ForFork1_~data~0.base_37) .cse0))) |v_#memory_$Pointer$.base_47|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_16|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_37, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_37, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_48|, #memory_int=|v_#memory_int_69|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_48|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_37, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_37, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_47|, #memory_int=|v_#memory_int_68|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_47|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:47:52,301 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [572] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_59|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_86|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_484|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_539|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_47|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_484|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_61|} 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 [484] L1710-1-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_43 24))) (and (= (store |v_#memory_$Pointer$.offset_93| v_my_callbackThread1of1ForFork0_~data~0.base_43 (store (select |v_#memory_$Pointer$.offset_93| v_my_callbackThread1of1ForFork0_~data~0.base_43) .cse0 (select (select |v_#memory_$Pointer$.offset_92| v_my_callbackThread1of1ForFork0_~data~0.base_43) .cse0))) |v_#memory_$Pointer$.offset_92|) (= (store |v_#memory_int_129| v_my_callbackThread1of1ForFork0_~data~0.base_43 (store (select |v_#memory_int_129| v_my_callbackThread1of1ForFork0_~data~0.base_43) .cse0 1)) |v_#memory_int_128|) (= (store |v_#memory_$Pointer$.base_93| v_my_callbackThread1of1ForFork0_~data~0.base_43 (store (select |v_#memory_$Pointer$.base_93| v_my_callbackThread1of1ForFork0_~data~0.base_43) .cse0 (select (select |v_#memory_$Pointer$.base_92| v_my_callbackThread1of1ForFork0_~data~0.base_43) .cse0))) |v_#memory_$Pointer$.base_92|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_43, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_93|, #memory_int=|v_#memory_int_129|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_43, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_93|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_43, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_92|, #memory_int=|v_#memory_int_128|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_17|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_43, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_92|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#t~nondet31, #memory_$Pointer$.offset] [2022-12-06 06:47:52,304 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [572] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_59|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_86|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_484|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_539|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_47|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_484|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_61|} 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 [406] 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_int_37| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_int_37| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 1)) |v_#memory_int_36|) (= (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|))) 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_37|, #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_36|, 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:52,308 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [572] L1727-4-->L1757-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_59|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_86|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_484|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_539|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_47|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_484|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_61|} 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 [378] 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:52,318 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:47:52,319 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 06:47:52,319 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 40 transitions, 173 flow [2022-12-06 06:47:52,320 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:52,320 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:47:52,320 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:47:52,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:47:52,320 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:52,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:47:52,320 INFO L85 PathProgramCache]: Analyzing trace with hash 113814073, now seen corresponding path program 1 times [2022-12-06 06:47:52,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:47:52,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527552281] [2022-12-06 06:47:52,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:47:52,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:47:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:47:52,365 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:52,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:47:52,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527552281] [2022-12-06 06:47:52,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527552281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:47:52,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:47:52,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:47:52,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563699045] [2022-12-06 06:47:52,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:47:52,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 06:47:52,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:47:52,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 06:47:52,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 06:47:52,367 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-06 06:47:52,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 40 transitions, 173 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:52,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:47:52,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-06 06:47:52,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:47:52,442 INFO L130 PetriNetUnfolder]: 96/208 cut-off events. [2022-12-06 06:47:52,442 INFO L131 PetriNetUnfolder]: For 222/247 co-relation queries the response was YES. [2022-12-06 06:47:52,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 208 events. 96/208 cut-off events. For 222/247 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 721 event pairs, 96 based on Foata normal form. 55/227 useless extension candidates. Maximal degree in co-relation 504. Up to 189 conditions per place. [2022-12-06 06:47:52,444 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 18 selfloop transitions, 0 changer transitions 2/23 dead transitions. [2022-12-06 06:47:52,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 106 flow [2022-12-06 06:47:52,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 06:47:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 06:47:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2022-12-06 06:47:52,445 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.515625 [2022-12-06 06:47:52,445 INFO L175 Difference]: Start difference. First operand has 36 places, 40 transitions, 173 flow. Second operand 2 states and 33 transitions. [2022-12-06 06:47:52,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 106 flow [2022-12-06 06:47:52,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 23 transitions, 98 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 06:47:52,446 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 54 flow [2022-12-06 06:47:52,446 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:52,447 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -10 predicate places. [2022-12-06 06:47:52,447 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:47:52,447 INFO L89 Accepts]: Start accepts. Operand has 29 places, 21 transitions, 54 flow [2022-12-06 06:47:52,448 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:47:52,448 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:47:52,448 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 21 transitions, 54 flow [2022-12-06 06:47:52,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 54 flow [2022-12-06 06:47:52,454 INFO L130 PetriNetUnfolder]: 4/39 cut-off events. [2022-12-06 06:47:52,454 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:47:52,454 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 77 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:52,454 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 54 flow [2022-12-06 06:47:52,454 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-06 06:47:52,457 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:47:52,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 06:47:52,458 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 54 flow [2022-12-06 06:47:52,458 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:52,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:47:52,458 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:52,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:47:52,459 INFO L420 AbstractCegarLoop]: === Iteration 5 === 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:52,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:47:52,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1566630701, now seen corresponding path program 1 times [2022-12-06 06:47:52,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:47:52,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764377925] [2022-12-06 06:47:52,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:47:52,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:47:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:47:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:47:54,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:47:54,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764377925] [2022-12-06 06:47:54,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764377925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:47:54,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:47:54,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 06:47:54,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929127520] [2022-12-06 06:47:54,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:47:54,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 06:47:54,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:47:54,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 06:47:54,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-12-06 06:47:54,258 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:47:54,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 54 flow. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:47:54,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:47:54,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:47:55,262 INFO L130 PetriNetUnfolder]: 197/410 cut-off events. [2022-12-06 06:47:55,263 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-06 06:47:55,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 410 events. 197/410 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1733 event pairs, 22 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 191. Up to 178 conditions per place. [2022-12-06 06:47:55,265 INFO L137 encePairwiseOnDemand]: 7/21 looper letters, 74 selfloop transitions, 32 changer transitions 0/106 dead transitions. [2022-12-06 06:47:55,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 106 transitions, 489 flow [2022-12-06 06:47:55,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 06:47:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 06:47:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 107 transitions. [2022-12-06 06:47:55,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31845238095238093 [2022-12-06 06:47:55,268 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 54 flow. Second operand 16 states and 107 transitions. [2022-12-06 06:47:55,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 106 transitions, 489 flow [2022-12-06 06:47:55,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 106 transitions, 489 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:47:55,270 INFO L231 Difference]: Finished difference. Result has 50 places, 53 transitions, 289 flow [2022-12-06 06:47:55,270 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=289, PETRI_PLACES=50, PETRI_TRANSITIONS=53} [2022-12-06 06:47:55,271 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2022-12-06 06:47:55,271 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:47:55,271 INFO L89 Accepts]: Start accepts. Operand has 50 places, 53 transitions, 289 flow [2022-12-06 06:47:55,272 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:47:55,272 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:47:55,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 53 transitions, 289 flow [2022-12-06 06:47:55,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 53 transitions, 289 flow [2022-12-06 06:47:55,290 INFO L130 PetriNetUnfolder]: 27/135 cut-off events. [2022-12-06 06:47:55,291 INFO L131 PetriNetUnfolder]: For 94/99 co-relation queries the response was YES. [2022-12-06 06:47:55,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 135 events. 27/135 cut-off events. For 94/99 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 650 event pairs, 3 based on Foata normal form. 1/127 useless extension candidates. Maximal degree in co-relation 335. Up to 39 conditions per place. [2022-12-06 06:47:55,292 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 53 transitions, 289 flow [2022-12-06 06:47:55,292 INFO L188 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-06 06:47:55,328 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:55,328 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:55,330 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:55,330 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:55,370 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:55,371 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:55,372 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:55,373 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:47:55,374 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [377] 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] and [406] 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_int_37| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_int_37| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 1)) |v_#memory_int_36|) (= (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|))) 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_37|, #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_36|, 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:55,452 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:55,453 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 06:47:55,460 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L1712-1-->my_callbackEXIT: Formula: (and (= |v_my_callbackThread1of1ForFork0_#res.base_9| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_9| 0) (= (store |v_#pthreadsMutex_144| v_my_callbackThread1of1ForFork0_~data~0.base_77 (store (select |v_#pthreadsMutex_144| v_my_callbackThread1of1ForFork0_~data~0.base_77) v_my_callbackThread1of1ForFork0_~data~0.offset_77 0)) |v_#pthreadsMutex_143|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_144|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_77, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_77} OutVars{#pthreadsMutex=|v_#pthreadsMutex_143|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_77, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_9|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_31|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_9|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_77} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, my_callbackThread1of1ForFork0_#res.offset] and [553] L1736-2-->ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (store |v_#memory_$Pointer$.base_250| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_68| (store (select |v_#memory_$Pointer$.base_250| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_68|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_60| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_43|)) |v_#memory_$Pointer$.base_249|) (= |v_ULTIMATE.start_main_#t~mem46#1_51| (select (select |v_#memory_int_304| |v_ULTIMATE.start_main_~#data~1#1.base_119|) (+ |v_ULTIMATE.start_main_~#data~1#1.offset_119| 24))) (= |v_ULTIMATE.start_ldv_assert_~expression#1_157| 0) (= (store |v_#memory_$Pointer$.offset_250| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_68| (store (select |v_#memory_$Pointer$.offset_250| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_68|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_60| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_43|)) |v_#memory_$Pointer$.offset_249|) (= (ite (= |v_ULTIMATE.start_main_#t~mem46#1_51| 1) 1 0) |v_ULTIMATE.start_ldv_assert_#in~expression#1_131|) (= |v_#memory_int_304| (store |v_#memory_int_305| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_68| (store (select |v_#memory_int_305| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_68|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_60| (select (select |v_#memory_int_304| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_68|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_60|)))) (= (store |v_#valid_141| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_68| 0) |v_#valid_140|) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_131| |v_ULTIMATE.start_ldv_assert_~expression#1_157|)) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_60|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_250|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_68|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_43|, #valid=|v_#valid_141|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_43|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_119|, #memory_int=|v_#memory_int_305|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_250|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_119|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_157|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_249|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_119|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_38|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_131|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_51|, #valid=|v_#valid_140|, #memory_int=|v_#memory_int_304|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_249|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_119|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_ldv_assert_~expression#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_main_#t~mem46#1, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_ldv_assert_#in~expression#1, #memory_$Pointer$.offset] [2022-12-06 06:47:55,566 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:47:55,567 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 06:47:55,572 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [440] L1712-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_37 28))) (and (= (store |v_#memory_$Pointer$.offset_48| v_my_callbackThread1of1ForFork1_~data~0.base_37 (store (select |v_#memory_$Pointer$.offset_48| v_my_callbackThread1of1ForFork1_~data~0.base_37) .cse0 (select (select |v_#memory_$Pointer$.offset_47| v_my_callbackThread1of1ForFork1_~data~0.base_37) .cse0))) |v_#memory_$Pointer$.offset_47|) (= (store |v_#memory_int_69| v_my_callbackThread1of1ForFork1_~data~0.base_37 (store (select |v_#memory_int_69| v_my_callbackThread1of1ForFork1_~data~0.base_37) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem32_16| 1))) |v_#memory_int_68|) (= (store |v_#memory_$Pointer$.base_48| v_my_callbackThread1of1ForFork1_~data~0.base_37 (store (select |v_#memory_$Pointer$.base_48| v_my_callbackThread1of1ForFork1_~data~0.base_37) .cse0 (select (select |v_#memory_$Pointer$.base_47| v_my_callbackThread1of1ForFork1_~data~0.base_37) .cse0))) |v_#memory_$Pointer$.base_47|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_16|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_37, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_37, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_48|, #memory_int=|v_#memory_int_69|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_48|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_37, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_37, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_47|, #memory_int=|v_#memory_int_68|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_47|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] and [580] L1712-1-->ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (store |v_#pthreadsMutex_218| v_my_callbackThread1of1ForFork0_~data~0.base_162 (store (select |v_#pthreadsMutex_218| v_my_callbackThread1of1ForFork0_~data~0.base_162) v_my_callbackThread1of1ForFork0_~data~0.offset_162 0)) |v_#pthreadsMutex_217|) (= (store |v_#memory_$Pointer$.offset_575| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_120| (store (select |v_#memory_$Pointer$.offset_575| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_120|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_106| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_77|)) |v_#memory_$Pointer$.offset_574|) (= |v_ULTIMATE.start_main_#t~mem46#1_71| (select (select |v_#memory_int_636| |v_ULTIMATE.start_main_~#data~1#1.base_239|) (+ |v_ULTIMATE.start_main_~#data~1#1.offset_239| 24))) (= |v_ULTIMATE.start_ldv_assert_~expression#1_233| 0) (= (store |v_#memory_$Pointer$.base_575| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_120| (store (select |v_#memory_$Pointer$.base_575| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_120|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_106| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_77|)) |v_#memory_$Pointer$.base_574|) (= |v_my_callbackThread1of1ForFork0_#res.base_18| 0) (= |v_#valid_226| (store |v_#valid_227| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_120| 0)) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_196| |v_ULTIMATE.start_ldv_assert_~expression#1_233|) (= |v_my_callbackThread1of1ForFork0_#res.offset_18| 0) (= (ite (= |v_ULTIMATE.start_main_#t~mem46#1_71| 1) 1 0) |v_ULTIMATE.start_ldv_assert_#in~expression#1_196|) (= |v_#memory_int_636| (store |v_#memory_int_637| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_120| (store (select |v_#memory_int_637| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_120|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_106| (select (select |v_#memory_int_636| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_120|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_106|))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_218|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_575|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_120|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_77|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_239|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_162, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_106|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_162, #valid=|v_#valid_227|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_77|, #memory_int=|v_#memory_int_637|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_575|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_239|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_217|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_233|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_79|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_574|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_239|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_69|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_196|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_162, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_162, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_18|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_71|, #valid=|v_#valid_226|, #memory_int=|v_#memory_int_636|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_574|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_239|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_ldv_assert_~expression#1, my_callbackThread1of1ForFork0_#t~mem32, #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_#t~mem42#1, ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, my_callbackThread1of1ForFork0_#res.base, ULTIMATE.start_main_#t~mem46#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] [2022-12-06 06:47:55,786 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 0)) (= |v_#valid_212| (store |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 1)) (= |v_ULTIMATE.start_main_~#data~1#1.base_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_100| 0) (< |v_#StackHeapBarrier_70| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_57| |v_ULTIMATE.start_main_~probe_ret~0#1_100|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|) (= (store |v_#length_154| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 4) |v_#length_153|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|) (= (select |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) 0) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46| (select (select |v_#memory_int_537| |v_~#t1~0.base_61|) |v_~#t1~0.offset_61|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_70|, ~#t1~0.base=|v_~#t1~0.base_61|, #valid=|v_#valid_213|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_217|, #memory_int=|v_#memory_int_537|, ~#t1~0.offset=|v_~#t1~0.offset_61|, #length=|v_#length_154|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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_101|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_74|, ~#t1~0.offset=|v_~#t1~0.offset_61|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|, 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_57|, ~#t1~0.base=|v_~#t1~0.base_61|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_82|, 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_100|, #length=|v_#length_153|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_45|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|, 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_217|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_64|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93|, #StackHeapBarrier=|v_#StackHeapBarrier_70|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|, #valid=|v_#valid_212|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_74|, #memory_int=|v_#memory_int_537|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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 [554] L1712-1-->my_callbackEXIT: Formula: (and (= |v_my_callbackThread1of1ForFork0_#res.base_9| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_9| 0) (= (store |v_#pthreadsMutex_144| v_my_callbackThread1of1ForFork0_~data~0.base_77 (store (select |v_#pthreadsMutex_144| v_my_callbackThread1of1ForFork0_~data~0.base_77) v_my_callbackThread1of1ForFork0_~data~0.offset_77 0)) |v_#pthreadsMutex_143|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_144|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_77, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_77} OutVars{#pthreadsMutex=|v_#pthreadsMutex_143|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_77, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_9|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_31|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_9|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_77} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, my_callbackThread1of1ForFork0_#res.offset] [2022-12-06 06:47:58,400 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] 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 [554] L1712-1-->my_callbackEXIT: Formula: (and (= |v_my_callbackThread1of1ForFork0_#res.base_9| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_9| 0) (= (store |v_#pthreadsMutex_144| v_my_callbackThread1of1ForFork0_~data~0.base_77 (store (select |v_#pthreadsMutex_144| v_my_callbackThread1of1ForFork0_~data~0.base_77) v_my_callbackThread1of1ForFork0_~data~0.offset_77 0)) |v_#pthreadsMutex_143|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_144|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_77, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_77} OutVars{#pthreadsMutex=|v_#pthreadsMutex_143|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_77, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_9|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_31|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_9|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_77} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, my_callbackThread1of1ForFork0_#res.offset] [2022-12-06 06:47:58,428 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_128| v_my_callbackThread1of1ForFork1_~data~0.base_89))) (and (= v_~my_dev~0.offset_42 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_13) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_89) 0) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_13 v_~my_dev~0.base_42) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_89 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_13) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_27| 0) (= v_my_callbackThread1of1ForFork1_~arg.base_11 |v_my_callbackThread1of1ForFork1_#in~arg.base_11|) (= (store |v_#pthreadsMutex_128| v_my_callbackThread1of1ForFork1_~data~0.base_89 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_89 1)) |v_#pthreadsMutex_127|) (= v_my_callbackThread1of1ForFork1_~arg.offset_11 |v_my_callbackThread1of1ForFork1_#in~arg.offset_11|) (= v_my_callbackThread1of1ForFork1_~data~0.base_89 v_my_callbackThread1of1ForFork1_~__mptr~0.base_13))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_11|, #pthreadsMutex=|v_#pthreadsMutex_128|, ~my_dev~0.base=v_~my_dev~0.base_42, ~my_dev~0.offset=v_~my_dev~0.offset_42, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_11|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_11|, #pthreadsMutex=|v_#pthreadsMutex_127|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_89, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_89, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_11, ~my_dev~0.base=v_~my_dev~0.base_42, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_11, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_13, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_13, ~my_dev~0.offset=v_~my_dev~0.offset_42, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_27|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_11|} 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_#t~nondet31] and [554] L1712-1-->my_callbackEXIT: Formula: (and (= |v_my_callbackThread1of1ForFork0_#res.base_9| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_9| 0) (= (store |v_#pthreadsMutex_144| v_my_callbackThread1of1ForFork0_~data~0.base_77 (store (select |v_#pthreadsMutex_144| v_my_callbackThread1of1ForFork0_~data~0.base_77) v_my_callbackThread1of1ForFork0_~data~0.offset_77 0)) |v_#pthreadsMutex_143|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_144|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_77, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_77} OutVars{#pthreadsMutex=|v_#pthreadsMutex_143|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_77, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_9|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_31|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_9|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_77} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, my_callbackThread1of1ForFork0_#res.offset] [2022-12-06 06:47:58,814 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 06:47:58,815 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3544 [2022-12-06 06:47:58,815 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 50 transitions, 300 flow [2022-12-06 06:47:58,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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,816 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:47:58,816 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:58,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:47:58,816 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:58,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:47:58,817 INFO L85 PathProgramCache]: Analyzing trace with hash 349663459, now seen corresponding path program 1 times [2022-12-06 06:47:58,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:47:58,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736056030] [2022-12-06 06:47:58,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:47:58,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:47:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:47:59,914 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:59,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:47:59,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736056030] [2022-12-06 06:47:59,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736056030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:47:59,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:47:59,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 06:47:59,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378561370] [2022-12-06 06:47:59,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:47:59,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 06:47:59,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:47:59,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 06:47:59,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-06 06:47:59,918 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:47:59,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 50 transitions, 300 flow. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 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,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:47:59,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:47:59,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:00,355 INFO L130 PetriNetUnfolder]: 368/785 cut-off events. [2022-12-06 06:48:00,355 INFO L131 PetriNetUnfolder]: For 1468/1468 co-relation queries the response was YES. [2022-12-06 06:48:00,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2898 conditions, 785 events. 368/785 cut-off events. For 1468/1468 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4443 event pairs, 100 based on Foata normal form. 3/787 useless extension candidates. Maximal degree in co-relation 2748. Up to 391 conditions per place. [2022-12-06 06:48:00,359 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 96 selfloop transitions, 31 changer transitions 6/133 dead transitions. [2022-12-06 06:48:00,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 133 transitions, 1054 flow [2022-12-06 06:48:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:48:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:48:00,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2022-12-06 06:48:00,361 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4336734693877551 [2022-12-06 06:48:00,361 INFO L175 Difference]: Start difference. First operand has 47 places, 50 transitions, 300 flow. Second operand 7 states and 85 transitions. [2022-12-06 06:48:00,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 133 transitions, 1054 flow [2022-12-06 06:48:00,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 133 transitions, 1020 flow, removed 17 selfloop flow, removed 1 redundant places. [2022-12-06 06:48:00,365 INFO L231 Difference]: Finished difference. Result has 54 places, 69 transitions, 534 flow [2022-12-06 06:48:00,365 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=534, PETRI_PLACES=54, PETRI_TRANSITIONS=69} [2022-12-06 06:48:00,366 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 15 predicate places. [2022-12-06 06:48:00,366 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:00,366 INFO L89 Accepts]: Start accepts. Operand has 54 places, 69 transitions, 534 flow [2022-12-06 06:48:00,367 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:00,367 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:00,367 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 69 transitions, 534 flow [2022-12-06 06:48:00,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 69 transitions, 534 flow [2022-12-06 06:48:00,388 INFO L130 PetriNetUnfolder]: 73/278 cut-off events. [2022-12-06 06:48:00,388 INFO L131 PetriNetUnfolder]: For 548/594 co-relation queries the response was YES. [2022-12-06 06:48:00,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 278 events. 73/278 cut-off events. For 548/594 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1693 event pairs, 9 based on Foata normal form. 11/271 useless extension candidates. Maximal degree in co-relation 909. Up to 104 conditions per place. [2022-12-06 06:48:00,389 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 69 transitions, 534 flow [2022-12-06 06:48:00,390 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-06 06:48:00,399 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:48:00,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 06:48:00,400 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 69 transitions, 534 flow [2022-12-06 06:48:00,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 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,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:00,400 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:00,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:48:00,401 INFO L420 AbstractCegarLoop]: === Iteration 7 === 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:00,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:00,401 INFO L85 PathProgramCache]: Analyzing trace with hash -864805043, now seen corresponding path program 1 times [2022-12-06 06:48:00,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:00,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194377435] [2022-12-06 06:48:00,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:00,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:00,653 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,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:00,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194377435] [2022-12-06 06:48:00,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194377435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:00,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:00,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:48:00,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527349675] [2022-12-06 06:48:00,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:00,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:48:00,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:00,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:48:00,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:48:00,655 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 06:48:00,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 69 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:00,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 06:48:00,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:00,821 INFO L130 PetriNetUnfolder]: 361/816 cut-off events. [2022-12-06 06:48:00,821 INFO L131 PetriNetUnfolder]: For 2200/2222 co-relation queries the response was YES. [2022-12-06 06:48:00,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3368 conditions, 816 events. 361/816 cut-off events. For 2200/2222 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4975 event pairs, 64 based on Foata normal form. 11/816 useless extension candidates. Maximal degree in co-relation 3237. Up to 469 conditions per place. [2022-12-06 06:48:00,827 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 82 selfloop transitions, 11 changer transitions 2/98 dead transitions. [2022-12-06 06:48:00,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 98 transitions, 951 flow [2022-12-06 06:48:00,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:48:00,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:48:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 06:48:00,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 06:48:00,829 INFO L175 Difference]: Start difference. First operand has 54 places, 69 transitions, 534 flow. Second operand 3 states and 45 transitions. [2022-12-06 06:48:00,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 98 transitions, 951 flow [2022-12-06 06:48:00,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 98 transitions, 936 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 06:48:00,835 INFO L231 Difference]: Finished difference. Result has 55 places, 74 transitions, 594 flow [2022-12-06 06:48:00,836 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=55, PETRI_TRANSITIONS=74} [2022-12-06 06:48:00,836 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2022-12-06 06:48:00,836 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:00,836 INFO L89 Accepts]: Start accepts. Operand has 55 places, 74 transitions, 594 flow [2022-12-06 06:48:00,837 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:00,838 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:00,838 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 74 transitions, 594 flow [2022-12-06 06:48:00,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 74 transitions, 594 flow [2022-12-06 06:48:00,866 INFO L130 PetriNetUnfolder]: 100/368 cut-off events. [2022-12-06 06:48:00,866 INFO L131 PetriNetUnfolder]: For 815/865 co-relation queries the response was YES. [2022-12-06 06:48:00,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 368 events. 100/368 cut-off events. For 815/865 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2502 event pairs, 11 based on Foata normal form. 17/368 useless extension candidates. Maximal degree in co-relation 1293. Up to 123 conditions per place. [2022-12-06 06:48:00,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 74 transitions, 594 flow [2022-12-06 06:48:00,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-06 06:48:00,873 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:48:00,875 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 06:48:00,875 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 74 transitions, 594 flow [2022-12-06 06:48:00,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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,875 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:00,875 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:00,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:48:00,875 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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:00,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:00,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1210901059, now seen corresponding path program 2 times [2022-12-06 06:48:00,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:00,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649013404] [2022-12-06 06:48:00,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:00,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:01,159 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,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:01,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649013404] [2022-12-06 06:48:01,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649013404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:01,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:01,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:48:01,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933253885] [2022-12-06 06:48:01,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:01,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:48:01,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:01,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:48:01,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:48:01,161 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 06:48:01,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 74 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:01,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 06:48:01,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:01,237 INFO L130 PetriNetUnfolder]: 95/282 cut-off events. [2022-12-06 06:48:01,237 INFO L131 PetriNetUnfolder]: For 1148/1148 co-relation queries the response was YES. [2022-12-06 06:48:01,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1232 conditions, 282 events. 95/282 cut-off events. For 1148/1148 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1372 event pairs, 56 based on Foata normal form. 16/298 useless extension candidates. Maximal degree in co-relation 1153. Up to 221 conditions per place. [2022-12-06 06:48:01,239 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 43 selfloop transitions, 6 changer transitions 2/52 dead transitions. [2022-12-06 06:48:01,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 487 flow [2022-12-06 06:48:01,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:48:01,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:48:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-06 06:48:01,240 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38271604938271603 [2022-12-06 06:48:01,240 INFO L175 Difference]: Start difference. First operand has 55 places, 74 transitions, 594 flow. Second operand 3 states and 31 transitions. [2022-12-06 06:48:01,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 487 flow [2022-12-06 06:48:01,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 439 flow, removed 20 selfloop flow, removed 4 redundant places. [2022-12-06 06:48:01,244 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 312 flow [2022-12-06 06:48:01,244 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2022-12-06 06:48:01,246 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2022-12-06 06:48:01,246 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:01,246 INFO L89 Accepts]: Start accepts. Operand has 52 places, 46 transitions, 312 flow [2022-12-06 06:48:01,247 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:01,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:01,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 46 transitions, 312 flow [2022-12-06 06:48:01,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 46 transitions, 312 flow [2022-12-06 06:48:01,258 INFO L130 PetriNetUnfolder]: 17/129 cut-off events. [2022-12-06 06:48:01,258 INFO L131 PetriNetUnfolder]: For 215/222 co-relation queries the response was YES. [2022-12-06 06:48:01,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 129 events. 17/129 cut-off events. For 215/222 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 632 event pairs, 2 based on Foata normal form. 3/128 useless extension candidates. Maximal degree in co-relation 380. Up to 40 conditions per place. [2022-12-06 06:48:01,259 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 46 transitions, 312 flow [2022-12-06 06:48:01,259 INFO L188 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-06 06:48:01,285 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:01,286 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:01,287 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:01,288 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:01,374 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:01,375 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:01,376 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:01,376 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:01,414 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1711-1-->L1712-1: Formula: (let ((.cse1 (select |v_#memory_int_631| v_my_callbackThread1of1ForFork0_~data~0.base_156)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_156 28))) (and (= (store |v_#memory_$Pointer$.offset_571| v_my_callbackThread1of1ForFork0_~data~0.base_156 (store (select |v_#memory_$Pointer$.offset_571| v_my_callbackThread1of1ForFork0_~data~0.base_156) .cse0 (select (select |v_#memory_$Pointer$.offset_570| v_my_callbackThread1of1ForFork0_~data~0.base_156) .cse0))) |v_#memory_$Pointer$.offset_570|) (= (select .cse1 .cse0) |v_my_callbackThread1of1ForFork0_#t~mem32_72|) (= |v_#memory_$Pointer$.base_570| (store |v_#memory_$Pointer$.base_571| v_my_callbackThread1of1ForFork0_~data~0.base_156 (store (select |v_#memory_$Pointer$.base_571| v_my_callbackThread1of1ForFork0_~data~0.base_156) .cse0 (select (select |v_#memory_$Pointer$.base_570| v_my_callbackThread1of1ForFork0_~data~0.base_156) .cse0)))) (= (store |v_#memory_int_631| v_my_callbackThread1of1ForFork0_~data~0.base_156 (store .cse1 .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_72| 1))) |v_#memory_int_630|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_156, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_571|, #memory_int=|v_#memory_int_631|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_156, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_571|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_156, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_72|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_570|, #memory_int=|v_#memory_int_630|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_156, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_570|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] and [582] L1727-4-->my_callbackEXIT: Formula: (and (= (store |v_#length_164| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_132| 4) |v_#length_163|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_34| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_36|) (< |v_#StackHeapBarrier_75| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_132|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_76| |v_ULTIMATE.start_main_~probe_ret~0#1_119|) (= (store |v_#pthreadsMutex_234| v_my_callbackThread1of1ForFork0_~data~0.base_172 (store (select |v_#pthreadsMutex_234| v_my_callbackThread1of1ForFork0_~data~0.base_172) v_my_callbackThread1of1ForFork0_~data~0.offset_172 0)) |v_#pthreadsMutex_233|) (= |v_my_callbackThread1of1ForFork0_#res.base_25| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_34| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_36|) (= |v_ULTIMATE.start_main_~#data~1#1.base_249| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_34|) (= (select |v_#valid_244| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_132|) 0) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_61| (select (select |v_#memory_int_655| |v_~#t1~0.base_66|) |v_~#t1~0.offset_66|)) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_116| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_132| 0)) (= |v_ULTIMATE.start_main_~probe_ret~0#1_119| 0) (= |v_ULTIMATE.start_main_~#data~1#1.offset_249| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_34|) (= |v_my_callbackThread1of1ForFork0_#res.offset_25| 0) (= (store |v_#valid_244| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_132| 1) |v_#valid_243|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_234|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_172, #StackHeapBarrier=|v_#StackHeapBarrier_75|, ~#t1~0.base=|v_~#t1~0.base_66|, #valid=|v_#valid_244|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_249|, #memory_int=|v_#memory_int_655|, ~#t1~0.offset=|v_~#t1~0.offset_66|, #length=|v_#length_164|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_172, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_249|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_61|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_132|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_87|, ~#t1~0.offset=|v_~#t1~0.offset_66|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_172, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_36|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_83|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_172, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_76|, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_25|, ~#t1~0.base=|v_~#t1~0.base_66|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_105|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_68|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_119|, #length=|v_#length_163|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_64|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_25|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_34|, #pthreadsMutex=|v_#pthreadsMutex_233|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_90|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_36|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_68|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_249|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_76|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_116|, #StackHeapBarrier=|v_#StackHeapBarrier_75|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_34|, #valid=|v_#valid_243|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_87|, #memory_int=|v_#memory_int_655|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_249|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, #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_~#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, my_callbackThread1of1ForFork0_#res.base, 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, my_callbackThread1of1ForFork0_#res.offset] [2022-12-06 06:48:01,584 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L1711-1-->L1712-1: Formula: (let ((.cse1 (select |v_#memory_int_631| v_my_callbackThread1of1ForFork0_~data~0.base_156)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_156 28))) (and (= (store |v_#memory_$Pointer$.offset_571| v_my_callbackThread1of1ForFork0_~data~0.base_156 (store (select |v_#memory_$Pointer$.offset_571| v_my_callbackThread1of1ForFork0_~data~0.base_156) .cse0 (select (select |v_#memory_$Pointer$.offset_570| v_my_callbackThread1of1ForFork0_~data~0.base_156) .cse0))) |v_#memory_$Pointer$.offset_570|) (= (select .cse1 .cse0) |v_my_callbackThread1of1ForFork0_#t~mem32_72|) (= |v_#memory_$Pointer$.base_570| (store |v_#memory_$Pointer$.base_571| v_my_callbackThread1of1ForFork0_~data~0.base_156 (store (select |v_#memory_$Pointer$.base_571| v_my_callbackThread1of1ForFork0_~data~0.base_156) .cse0 (select (select |v_#memory_$Pointer$.base_570| v_my_callbackThread1of1ForFork0_~data~0.base_156) .cse0)))) (= (store |v_#memory_int_631| v_my_callbackThread1of1ForFork0_~data~0.base_156 (store .cse1 .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_72| 1))) |v_#memory_int_630|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_156, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_571|, #memory_int=|v_#memory_int_631|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_156, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_571|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_156, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_72|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_570|, #memory_int=|v_#memory_int_630|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_156, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_570|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] and [516] L1726-4-->L1727-3: Formula: (and (= (store |v_#memory_int_199| |v_~#t2~0.base_25| (store (select |v_#memory_int_199| |v_~#t2~0.base_25|) |v_~#t2~0.offset_25| |v_ULTIMATE.start_my_drv_probe_#t~pre38#1_25|)) |v_#memory_int_198|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_#memory_$Pointer$.offset_149| (store |v_#memory_$Pointer$.offset_150| |v_~#t2~0.base_25| (store (select |v_#memory_$Pointer$.offset_150| |v_~#t2~0.base_25|) |v_~#t2~0.offset_25| (select (select |v_#memory_$Pointer$.offset_149| |v_~#t2~0.base_25|) |v_~#t2~0.offset_25|)))) (= |v_#pthreadsForks_24| |v_ULTIMATE.start_my_drv_probe_#t~pre38#1_25|) (= (store |v_#memory_$Pointer$.base_150| |v_~#t2~0.base_25| (store (select |v_#memory_$Pointer$.base_150| |v_~#t2~0.base_25|) |v_~#t2~0.offset_25| (select (select |v_#memory_$Pointer$.base_149| |v_~#t2~0.base_25|) |v_~#t2~0.offset_25|))) |v_#memory_$Pointer$.base_149|)) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_150|, #pthreadsForks=|v_#pthreadsForks_24|, ~#t2~0.offset=|v_~#t2~0.offset_25|, #memory_int=|v_#memory_int_199|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_150|, ~#t2~0.base=|v_~#t2~0.base_25|} OutVars{ULTIMATE.start_my_drv_probe_#t~nondet37#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet37#1_17|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_149|, #pthreadsForks=|v_#pthreadsForks_23|, ~#t2~0.offset=|v_~#t2~0.offset_25|, #memory_int=|v_#memory_int_198|, ULTIMATE.start_my_drv_probe_#t~pre36#1=|v_ULTIMATE.start_my_drv_probe_#t~pre36#1_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_149|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_25|, ~#t2~0.base=|v_~#t2~0.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~nondet37#1, #memory_$Pointer$.base, #pthreadsForks, #memory_int, ULTIMATE.start_my_drv_probe_#t~pre36#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] [2022-12-06 06:48:01,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] L1711-1-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_205 28))) (and (= (store |v_#memory_$Pointer$.base_660| v_my_callbackThread1of1ForFork0_~data~0.base_205 (store (select |v_#memory_$Pointer$.base_660| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0 (select (select |v_#memory_$Pointer$.base_659| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0))) |v_#memory_$Pointer$.base_659|) (= (store |v_#pthreadsMutex_274| v_my_callbackThread1of1ForFork0_~data~0.base_205 (store (select |v_#pthreadsMutex_274| v_my_callbackThread1of1ForFork0_~data~0.base_205) v_my_callbackThread1of1ForFork0_~data~0.offset_205 0)) |v_#pthreadsMutex_273|) (= |v_my_callbackThread1of1ForFork0_#res.base_37| 0) (= (store |v_#memory_$Pointer$.offset_660| v_my_callbackThread1of1ForFork0_~data~0.base_205 (store (select |v_#memory_$Pointer$.offset_660| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0 (select (select |v_#memory_$Pointer$.offset_659| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0))) |v_#memory_$Pointer$.offset_659|) (= |v_my_callbackThread1of1ForFork0_#res.offset_37| 0) (= (store |v_#memory_int_726| v_my_callbackThread1of1ForFork0_~data~0.base_205 (let ((.cse1 (select |v_#memory_int_726| v_my_callbackThread1of1ForFork0_~data~0.base_205))) (store .cse1 .cse0 (+ (select .cse1 .cse0) 1)))) |v_#memory_int_725|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_274|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_205, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_660|, #memory_int=|v_#memory_int_726|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_205, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_660|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_273|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_205, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_37|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_108|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_659|, #memory_int=|v_#memory_int_725|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_37|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_205, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_659|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] and [516] L1726-4-->L1727-3: Formula: (and (= (store |v_#memory_int_199| |v_~#t2~0.base_25| (store (select |v_#memory_int_199| |v_~#t2~0.base_25|) |v_~#t2~0.offset_25| |v_ULTIMATE.start_my_drv_probe_#t~pre38#1_25|)) |v_#memory_int_198|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_#memory_$Pointer$.offset_149| (store |v_#memory_$Pointer$.offset_150| |v_~#t2~0.base_25| (store (select |v_#memory_$Pointer$.offset_150| |v_~#t2~0.base_25|) |v_~#t2~0.offset_25| (select (select |v_#memory_$Pointer$.offset_149| |v_~#t2~0.base_25|) |v_~#t2~0.offset_25|)))) (= |v_#pthreadsForks_24| |v_ULTIMATE.start_my_drv_probe_#t~pre38#1_25|) (= (store |v_#memory_$Pointer$.base_150| |v_~#t2~0.base_25| (store (select |v_#memory_$Pointer$.base_150| |v_~#t2~0.base_25|) |v_~#t2~0.offset_25| (select (select |v_#memory_$Pointer$.base_149| |v_~#t2~0.base_25|) |v_~#t2~0.offset_25|))) |v_#memory_$Pointer$.base_149|)) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_150|, #pthreadsForks=|v_#pthreadsForks_24|, ~#t2~0.offset=|v_~#t2~0.offset_25|, #memory_int=|v_#memory_int_199|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_150|, ~#t2~0.base=|v_~#t2~0.base_25|} OutVars{ULTIMATE.start_my_drv_probe_#t~nondet37#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet37#1_17|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_149|, #pthreadsForks=|v_#pthreadsForks_23|, ~#t2~0.offset=|v_~#t2~0.offset_25|, #memory_int=|v_#memory_int_198|, ULTIMATE.start_my_drv_probe_#t~pre36#1=|v_ULTIMATE.start_my_drv_probe_#t~pre36#1_27|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_149|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_25|, ~#t2~0.base=|v_~#t2~0.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~nondet37#1, #memory_$Pointer$.base, #pthreadsForks, #memory_int, ULTIMATE.start_my_drv_probe_#t~pre36#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] [2022-12-06 06:48:01,890 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [589] L1711-1-->L1727-3: Formula: (let ((.cse2 (select |v_#memory_int_721| v_my_callbackThread1of1ForFork0_~data~0.base_203)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_203 28))) (and (= |v_#memory_$Pointer$.base_654| (store |v_#memory_$Pointer$.base_655| v_my_callbackThread1of1ForFork0_~data~0.base_203 (store (select |v_#memory_$Pointer$.base_655| v_my_callbackThread1of1ForFork0_~data~0.base_203) .cse0 (select (select |v_#memory_$Pointer$.base_654| v_my_callbackThread1of1ForFork0_~data~0.base_203) .cse0)))) (= |v_#pthreadsForks_58| |v_ULTIMATE.start_my_drv_probe_#t~pre38#1_89|) (= (store |v_#memory_$Pointer$.offset_654| |v_~#t2~0.base_76| (store (select |v_#memory_$Pointer$.offset_654| |v_~#t2~0.base_76|) |v_~#t2~0.offset_75| (select (select |v_#memory_$Pointer$.offset_653| |v_~#t2~0.base_76|) |v_~#t2~0.offset_75|))) |v_#memory_$Pointer$.offset_653|) (= (let ((.cse1 (store |v_#memory_int_721| v_my_callbackThread1of1ForFork0_~data~0.base_203 (store .cse2 .cse0 (+ |v_my_callbackThread1of1ForFork0_#t~mem32_106| 1))))) (store .cse1 |v_~#t2~0.base_76| (store (select .cse1 |v_~#t2~0.base_76|) |v_~#t2~0.offset_75| |v_ULTIMATE.start_my_drv_probe_#t~pre38#1_89|))) |v_#memory_int_719|) (= |v_my_callbackThread1of1ForFork0_#t~mem32_106| (select .cse2 .cse0)) (= (store |v_#memory_$Pointer$.offset_655| v_my_callbackThread1of1ForFork0_~data~0.base_203 (store (select |v_#memory_$Pointer$.offset_655| v_my_callbackThread1of1ForFork0_~data~0.base_203) .cse0 (select (select |v_#memory_$Pointer$.offset_654| v_my_callbackThread1of1ForFork0_~data~0.base_203) .cse0))) |v_#memory_$Pointer$.offset_654|) (= (+ |v_#pthreadsForks_58| 1) |v_#pthreadsForks_57|) (= (store |v_#memory_$Pointer$.base_654| |v_~#t2~0.base_76| (store (select |v_#memory_$Pointer$.base_654| |v_~#t2~0.base_76|) |v_~#t2~0.offset_75| (select (select |v_#memory_$Pointer$.base_653| |v_~#t2~0.base_76|) |v_~#t2~0.offset_75|))) |v_#memory_$Pointer$.base_653|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_203, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_655|, #pthreadsForks=|v_#pthreadsForks_58|, ~#t2~0.offset=|v_~#t2~0.offset_75|, #memory_int=|v_#memory_int_721|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_203, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_655|, ~#t2~0.base=|v_~#t2~0.base_76|} OutVars{ULTIMATE.start_my_drv_probe_#t~nondet37#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet37#1_56|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_203, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_106|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_653|, #pthreadsForks=|v_#pthreadsForks_57|, ~#t2~0.offset=|v_~#t2~0.offset_75|, #memory_int=|v_#memory_int_719|, ULTIMATE.start_my_drv_probe_#t~pre36#1=|v_ULTIMATE.start_my_drv_probe_#t~pre36#1_70|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_203, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_653|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_89|, ~#t2~0.base=|v_~#t2~0.base_76|} AuxVars[|v_#memory_$Pointer$.offset_654|, |v_#memory_$Pointer$.base_654|] AssignedVars[ULTIMATE.start_my_drv_probe_#t~nondet37#1, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #pthreadsForks, #memory_int, ULTIMATE.start_my_drv_probe_#t~pre36#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre38#1] and [554] L1712-1-->my_callbackEXIT: Formula: (and (= |v_my_callbackThread1of1ForFork0_#res.base_9| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_9| 0) (= (store |v_#pthreadsMutex_144| v_my_callbackThread1of1ForFork0_~data~0.base_77 (store (select |v_#pthreadsMutex_144| v_my_callbackThread1of1ForFork0_~data~0.base_77) v_my_callbackThread1of1ForFork0_~data~0.offset_77 0)) |v_#pthreadsMutex_143|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_144|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_77, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_77} OutVars{#pthreadsMutex=|v_#pthreadsMutex_143|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_77, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_9|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_31|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_9|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_77} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, my_callbackThread1of1ForFork0_#res.offset] [2022-12-06 06:48:02,279 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 06:48:02,279 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1033 [2022-12-06 06:48:02,280 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 320 flow [2022-12-06 06:48:02,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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,280 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:02,280 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:02,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:48:02,280 INFO L420 AbstractCegarLoop]: === Iteration 9 === 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:02,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:02,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1545350732, now seen corresponding path program 1 times [2022-12-06 06:48:02,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:02,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019926691] [2022-12-06 06:48:02,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:02,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:02,793 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:02,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:02,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019926691] [2022-12-06 06:48:02,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019926691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:02,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:02,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:48:02,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345898662] [2022-12-06 06:48:02,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:02,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:48:02,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:02,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:48:02,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:48:02,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:48:02,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 320 flow. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:02,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:02,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:48:02,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:03,144 INFO L130 PetriNetUnfolder]: 115/314 cut-off events. [2022-12-06 06:48:03,144 INFO L131 PetriNetUnfolder]: For 774/774 co-relation queries the response was YES. [2022-12-06 06:48:03,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1265 conditions, 314 events. 115/314 cut-off events. For 774/774 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1642 event pairs, 1 based on Foata normal form. 2/316 useless extension candidates. Maximal degree in co-relation 1213. Up to 120 conditions per place. [2022-12-06 06:48:03,146 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 64 selfloop transitions, 22 changer transitions 3/89 dead transitions. [2022-12-06 06:48:03,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 89 transitions, 804 flow [2022-12-06 06:48:03,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 06:48:03,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 06:48:03,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2022-12-06 06:48:03,147 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2435064935064935 [2022-12-06 06:48:03,147 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 320 flow. Second operand 11 states and 75 transitions. [2022-12-06 06:48:03,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 89 transitions, 804 flow [2022-12-06 06:48:03,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 89 transitions, 750 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-06 06:48:03,151 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 402 flow [2022-12-06 06:48:03,151 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=402, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2022-12-06 06:48:03,152 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2022-12-06 06:48:03,152 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:03,152 INFO L89 Accepts]: Start accepts. Operand has 55 places, 49 transitions, 402 flow [2022-12-06 06:48:03,154 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:03,154 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:03,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 49 transitions, 402 flow [2022-12-06 06:48:03,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 49 transitions, 402 flow [2022-12-06 06:48:03,169 INFO L130 PetriNetUnfolder]: 19/144 cut-off events. [2022-12-06 06:48:03,169 INFO L131 PetriNetUnfolder]: For 350/360 co-relation queries the response was YES. [2022-12-06 06:48:03,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 144 events. 19/144 cut-off events. For 350/360 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 791 event pairs, 4 based on Foata normal form. 5/146 useless extension candidates. Maximal degree in co-relation 475. Up to 52 conditions per place. [2022-12-06 06:48:03,170 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 49 transitions, 402 flow [2022-12-06 06:48:03,170 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 06:48:03,173 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:03,173 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:03,174 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:03,175 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:03,264 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:03,265 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:03,266 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:03,266 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:03,572 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:03,573 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:03,574 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:03,574 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:03,661 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:48:03,662 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 510 [2022-12-06 06:48:03,662 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 402 flow [2022-12-06 06:48:03,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:03,662 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:03,662 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:03,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:48:03,662 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:48:03,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:03,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1703108352, now seen corresponding path program 1 times [2022-12-06 06:48:03,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:03,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854580621] [2022-12-06 06:48:03,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:03,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:04,644 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:04,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:04,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854580621] [2022-12-06 06:48:04,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854580621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:04,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:04,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 06:48:04,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643284876] [2022-12-06 06:48:04,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:04,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 06:48:04,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:04,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 06:48:04,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-06 06:48:04,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 06:48:04,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 402 flow. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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:04,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:04,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 06:48:04,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:05,077 INFO L130 PetriNetUnfolder]: 92/268 cut-off events. [2022-12-06 06:48:05,077 INFO L131 PetriNetUnfolder]: For 931/931 co-relation queries the response was YES. [2022-12-06 06:48:05,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 268 events. 92/268 cut-off events. For 931/931 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1373 event pairs, 12 based on Foata normal form. 1/269 useless extension candidates. Maximal degree in co-relation 1149. Up to 108 conditions per place. [2022-12-06 06:48:05,078 INFO L137 encePairwiseOnDemand]: 14/30 looper letters, 50 selfloop transitions, 19 changer transitions 13/82 dead transitions. [2022-12-06 06:48:05,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 789 flow [2022-12-06 06:48:05,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 06:48:05,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 06:48:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2022-12-06 06:48:05,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24814814814814815 [2022-12-06 06:48:05,081 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 402 flow. Second operand 9 states and 67 transitions. [2022-12-06 06:48:05,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 789 flow [2022-12-06 06:48:05,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 82 transitions, 738 flow, removed 25 selfloop flow, removed 4 redundant places. [2022-12-06 06:48:05,084 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 471 flow [2022-12-06 06:48:05,084 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=471, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2022-12-06 06:48:05,085 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 20 predicate places. [2022-12-06 06:48:05,085 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:05,085 INFO L89 Accepts]: Start accepts. Operand has 59 places, 51 transitions, 471 flow [2022-12-06 06:48:05,086 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:05,086 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:05,086 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 51 transitions, 471 flow [2022-12-06 06:48:05,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 51 transitions, 471 flow [2022-12-06 06:48:05,098 INFO L130 PetriNetUnfolder]: 17/126 cut-off events. [2022-12-06 06:48:05,098 INFO L131 PetriNetUnfolder]: For 447/463 co-relation queries the response was YES. [2022-12-06 06:48:05,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 126 events. 17/126 cut-off events. For 447/463 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 671 event pairs, 2 based on Foata normal form. 7/131 useless extension candidates. Maximal degree in co-relation 484. Up to 48 conditions per place. [2022-12-06 06:48:05,099 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 51 transitions, 471 flow [2022-12-06 06:48:05,099 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-06 06:48:05,108 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:05,109 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:05,110 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:05,111 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:05,203 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:48:05,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-06 06:48:05,204 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 467 flow [2022-12-06 06:48:05,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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:05,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:05,204 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:05,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:48:05,204 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:48:05,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:05,205 INFO L85 PathProgramCache]: Analyzing trace with hash -264856493, now seen corresponding path program 1 times [2022-12-06 06:48:05,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:05,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133273677] [2022-12-06 06:48:05,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:05,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:05,995 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,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:05,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133273677] [2022-12-06 06:48:05,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133273677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:05,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:05,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 06:48:05,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544277598] [2022-12-06 06:48:05,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:05,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 06:48:05,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:05,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 06:48:05,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-06 06:48:05,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 06:48:05,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 467 flow. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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:05,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:05,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 06:48:05,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:06,466 INFO L130 PetriNetUnfolder]: 94/280 cut-off events. [2022-12-06 06:48:06,467 INFO L131 PetriNetUnfolder]: For 1136/1136 co-relation queries the response was YES. [2022-12-06 06:48:06,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1372 conditions, 280 events. 94/280 cut-off events. For 1136/1136 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1443 event pairs, 14 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 1351. Up to 145 conditions per place. [2022-12-06 06:48:06,469 INFO L137 encePairwiseOnDemand]: 12/31 looper letters, 54 selfloop transitions, 38 changer transitions 4/96 dead transitions. [2022-12-06 06:48:06,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 96 transitions, 1054 flow [2022-12-06 06:48:06,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 06:48:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 06:48:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-12-06 06:48:06,470 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23548387096774193 [2022-12-06 06:48:06,470 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 467 flow. Second operand 10 states and 73 transitions. [2022-12-06 06:48:06,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 96 transitions, 1054 flow [2022-12-06 06:48:06,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 96 transitions, 1027 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-06 06:48:06,477 INFO L231 Difference]: Finished difference. Result has 65 places, 74 transitions, 854 flow [2022-12-06 06:48:06,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=854, PETRI_PLACES=65, PETRI_TRANSITIONS=74} [2022-12-06 06:48:06,478 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 26 predicate places. [2022-12-06 06:48:06,478 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:06,478 INFO L89 Accepts]: Start accepts. Operand has 65 places, 74 transitions, 854 flow [2022-12-06 06:48:06,480 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:06,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:06,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 74 transitions, 854 flow [2022-12-06 06:48:06,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 74 transitions, 854 flow [2022-12-06 06:48:06,497 INFO L130 PetriNetUnfolder]: 32/172 cut-off events. [2022-12-06 06:48:06,497 INFO L131 PetriNetUnfolder]: For 862/864 co-relation queries the response was YES. [2022-12-06 06:48:06,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 172 events. 32/172 cut-off events. For 862/864 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 996 event pairs, 2 based on Foata normal form. 1/168 useless extension candidates. Maximal degree in co-relation 761. Up to 65 conditions per place. [2022-12-06 06:48:06,498 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 74 transitions, 854 flow [2022-12-06 06:48:06,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-06 06:48:06,502 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:06,503 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-06 06:48:06,508 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] $Ultimate##0-->L1711-1: Formula: (let ((.cse1 (select |v_#pthreadsMutex_334| v_my_callbackThread1of1ForFork1_~data~0.base_288)) (.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_288 24))) (and (= v_my_callbackThread1of1ForFork1_~data~0.base_288 v_my_callbackThread1of1ForFork1_~__mptr~0.base_35) (= v_my_callbackThread1of1ForFork1_~arg.base_33 |v_my_callbackThread1of1ForFork1_#in~arg.base_33|) (= (store |v_#memory_int_873| v_my_callbackThread1of1ForFork1_~data~0.base_288 (store (select |v_#memory_int_873| v_my_callbackThread1of1ForFork1_~data~0.base_288) .cse0 1)) |v_#memory_int_872|) (= v_~my_dev~0.offset_142 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_35) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_35 v_~my_dev~0.base_142) (= (select .cse1 v_my_callbackThread1of1ForFork1_~data~0.offset_288) 0) (= (store |v_#memory_$Pointer$.offset_805| v_my_callbackThread1of1ForFork1_~data~0.base_288 (store (select |v_#memory_$Pointer$.offset_805| v_my_callbackThread1of1ForFork1_~data~0.base_288) .cse0 (select (select |v_#memory_$Pointer$.offset_804| v_my_callbackThread1of1ForFork1_~data~0.base_288) .cse0))) |v_#memory_$Pointer$.offset_804|) (= v_my_callbackThread1of1ForFork1_~arg.offset_33 |v_my_callbackThread1of1ForFork1_#in~arg.offset_33|) (= (store |v_#pthreadsMutex_334| v_my_callbackThread1of1ForFork1_~data~0.base_288 (store .cse1 v_my_callbackThread1of1ForFork1_~data~0.offset_288 1)) |v_#pthreadsMutex_333|) (= (store |v_#memory_$Pointer$.base_805| v_my_callbackThread1of1ForFork1_~data~0.base_288 (store (select |v_#memory_$Pointer$.base_805| v_my_callbackThread1of1ForFork1_~data~0.base_288) .cse0 (select (select |v_#memory_$Pointer$.base_804| v_my_callbackThread1of1ForFork1_~data~0.base_288) .cse0))) |v_#memory_$Pointer$.base_804|) (= .cse0 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_35))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_33|, #pthreadsMutex=|v_#pthreadsMutex_334|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_805|, ~my_dev~0.base=v_~my_dev~0.base_142, #memory_int=|v_#memory_int_873|, ~my_dev~0.offset=v_~my_dev~0.offset_142, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_805|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_333|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_804|, ~my_dev~0.base=v_~my_dev~0.base_142, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_33, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_35, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_99|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_33|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_33|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_288, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_288, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_33, #memory_int=|v_#memory_int_872|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_35, ~my_dev~0.offset=v_~my_dev~0.offset_142, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_804|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, #memory_$Pointer$.base, my_callbackThread1of1ForFork1_~arg.base, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_#t~nondet31, #memory_$Pointer$.offset] and [568] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_366| |v_ULTIMATE.start_main_~#data~1#1.base_139|))) (and (= |v_ULTIMATE.start_ldv_assert_~expression#1_187| 0) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_157| |v_ULTIMATE.start_ldv_assert_~expression#1_187|) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_139| 28)) |v_ULTIMATE.start_main_#t~mem47#1_63|) (= (store |v_#memory_int_367| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76| (store (select |v_#memory_int_367| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_68| (select (select |v_#memory_int_366| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_68|))) |v_#memory_int_366|) (= (store |v_#valid_173| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76| 0) |v_#valid_172|) (= (store |v_#memory_$Pointer$.offset_319| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76| (store (select |v_#memory_$Pointer$.offset_319| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_68| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_51|)) |v_#memory_$Pointer$.offset_318|) (not (= (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_139| 24)) 1) 1 0) 0)) (= (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_63|) 1 0) |v_ULTIMATE.start_ldv_assert_#in~expression#1_157|) (= (store |v_#memory_$Pointer$.base_319| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76| (store (select |v_#memory_$Pointer$.base_319| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_68| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_51|)) |v_#memory_$Pointer$.base_318|))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_68|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_319|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_51|, #valid=|v_#valid_173|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_51|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_139|, #memory_int=|v_#memory_int_367|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_319|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_139|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_187|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_318|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_63|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_139|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_42|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_157|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_67|, #valid=|v_#valid_172|, #memory_int=|v_#memory_int_366|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_318|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_139|} 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,790 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:06,791 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:06,792 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:06,792 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:06,793 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:06,794 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:06,940 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] 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 [571] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 0)) (= |v_#valid_212| (store |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 1)) (= |v_ULTIMATE.start_main_~#data~1#1.base_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_100| 0) (< |v_#StackHeapBarrier_70| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_57| |v_ULTIMATE.start_main_~probe_ret~0#1_100|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|) (= (store |v_#length_154| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 4) |v_#length_153|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|) (= (select |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) 0) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46| (select (select |v_#memory_int_537| |v_~#t1~0.base_61|) |v_~#t1~0.offset_61|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_70|, ~#t1~0.base=|v_~#t1~0.base_61|, #valid=|v_#valid_213|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_217|, #memory_int=|v_#memory_int_537|, ~#t1~0.offset=|v_~#t1~0.offset_61|, #length=|v_#length_154|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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_101|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_74|, ~#t1~0.offset=|v_~#t1~0.offset_61|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|, 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_57|, ~#t1~0.base=|v_~#t1~0.base_61|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_82|, 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_100|, #length=|v_#length_153|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_45|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|, 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_217|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_64|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93|, #StackHeapBarrier=|v_#StackHeapBarrier_70|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|, #valid=|v_#valid_212|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_74|, #memory_int=|v_#memory_int_537|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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] [2022-12-06 06:48:07,029 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] 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 [488] L1735-1-->L1735-3: Formula: (and (= (store |v_#memory_$Pointer$.offset_101| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37| (store (select |v_#memory_$Pointer$.offset_101| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_20|)) |v_#memory_$Pointer$.offset_100|) (= (store |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37| (store (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_20|)) |v_#memory_$Pointer$.base_100|) (= |v_#memory_int_136| (store |v_#memory_int_137| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37| (store (select |v_#memory_int_137| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_29| (select (select |v_#memory_int_136| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_29|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_29|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_20|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_101|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_20|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37|, #memory_int=|v_#memory_int_137|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_101|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_14|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_29|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_20|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_100|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_20|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37|, #memory_int=|v_#memory_int_136|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_100|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:48:07,104 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] 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 [571] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 0)) (= |v_#valid_212| (store |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 1)) (= |v_ULTIMATE.start_main_~#data~1#1.base_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_100| 0) (< |v_#StackHeapBarrier_70| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_57| |v_ULTIMATE.start_main_~probe_ret~0#1_100|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|) (= (store |v_#length_154| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 4) |v_#length_153|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|) (= (select |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) 0) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46| (select (select |v_#memory_int_537| |v_~#t1~0.base_61|) |v_~#t1~0.offset_61|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_70|, ~#t1~0.base=|v_~#t1~0.base_61|, #valid=|v_#valid_213|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_217|, #memory_int=|v_#memory_int_537|, ~#t1~0.offset=|v_~#t1~0.offset_61|, #length=|v_#length_154|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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_101|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_74|, ~#t1~0.offset=|v_~#t1~0.offset_61|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|, 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_57|, ~#t1~0.base=|v_~#t1~0.base_61|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_82|, 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_100|, #length=|v_#length_153|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_45|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|, 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_217|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_64|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93|, #StackHeapBarrier=|v_#StackHeapBarrier_70|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|, #valid=|v_#valid_212|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_74|, #memory_int=|v_#memory_int_537|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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] [2022-12-06 06:48:07,190 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] 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 [488] L1735-1-->L1735-3: Formula: (and (= (store |v_#memory_$Pointer$.offset_101| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37| (store (select |v_#memory_$Pointer$.offset_101| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_20|)) |v_#memory_$Pointer$.offset_100|) (= (store |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37| (store (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_20|)) |v_#memory_$Pointer$.base_100|) (= |v_#memory_int_136| (store |v_#memory_int_137| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37| (store (select |v_#memory_int_137| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_29| (select (select |v_#memory_int_136| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_29|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_29|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_20|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_101|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_20|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37|, #memory_int=|v_#memory_int_137|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_101|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_14|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_29|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_20|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_100|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_20|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37|, #memory_int=|v_#memory_int_136|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_100|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:48:07,317 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] 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 [488] L1735-1-->L1735-3: Formula: (and (= (store |v_#memory_$Pointer$.offset_101| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37| (store (select |v_#memory_$Pointer$.offset_101| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_20|)) |v_#memory_$Pointer$.offset_100|) (= (store |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37| (store (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_20|)) |v_#memory_$Pointer$.base_100|) (= |v_#memory_int_136| (store |v_#memory_int_137| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37| (store (select |v_#memory_int_137| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_29| (select (select |v_#memory_int_136| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_29|))))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_29|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_20|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_101|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_20|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37|, #memory_int=|v_#memory_int_137|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_101|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_14|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_29|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_20|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_100|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_20|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_37|, #memory_int=|v_#memory_int_136|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_100|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 06:48:07,404 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] 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 [571] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 0)) (= |v_#valid_212| (store |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 1)) (= |v_ULTIMATE.start_main_~#data~1#1.base_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_100| 0) (< |v_#StackHeapBarrier_70| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_57| |v_ULTIMATE.start_main_~probe_ret~0#1_100|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|) (= (store |v_#length_154| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 4) |v_#length_153|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|) (= (select |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) 0) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46| (select (select |v_#memory_int_537| |v_~#t1~0.base_61|) |v_~#t1~0.offset_61|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_70|, ~#t1~0.base=|v_~#t1~0.base_61|, #valid=|v_#valid_213|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_217|, #memory_int=|v_#memory_int_537|, ~#t1~0.offset=|v_~#t1~0.offset_61|, #length=|v_#length_154|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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_101|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_74|, ~#t1~0.offset=|v_~#t1~0.offset_61|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|, 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_57|, ~#t1~0.base=|v_~#t1~0.base_61|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_82|, 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_100|, #length=|v_#length_153|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_45|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|, 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_217|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_64|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93|, #StackHeapBarrier=|v_#StackHeapBarrier_70|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|, #valid=|v_#valid_212|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_74|, #memory_int=|v_#memory_int_537|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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] [2022-12-06 06:48:17,654 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:48:17,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11176 [2022-12-06 06:48:17,655 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 73 transitions, 887 flow [2022-12-06 06:48:17,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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:17,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:17,655 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:17,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:48:17,655 INFO L420 AbstractCegarLoop]: === Iteration 12 === 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,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:17,655 INFO L85 PathProgramCache]: Analyzing trace with hash 962648259, now seen corresponding path program 2 times [2022-12-06 06:48:17,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:17,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475397819] [2022-12-06 06:48:17,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:17,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:18,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:48:18,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:18,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475397819] [2022-12-06 06:48:18,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475397819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:18,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:18,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 06:48:18,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579542470] [2022-12-06 06:48:18,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:18,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 06:48:18,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:18,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 06:48:18,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-06 06:48:18,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 06:48:18,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 73 transitions, 887 flow. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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:18,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:18,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 06:48:18,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:18,965 INFO L130 PetriNetUnfolder]: 86/256 cut-off events. [2022-12-06 06:48:18,965 INFO L131 PetriNetUnfolder]: For 1626/1626 co-relation queries the response was YES. [2022-12-06 06:48:18,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 256 events. 86/256 cut-off events. For 1626/1626 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1302 event pairs, 3 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 1337. Up to 98 conditions per place. [2022-12-06 06:48:18,968 INFO L137 encePairwiseOnDemand]: 13/42 looper letters, 50 selfloop transitions, 43 changer transitions 3/96 dead transitions. [2022-12-06 06:48:18,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 96 transitions, 1221 flow [2022-12-06 06:48:18,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 06:48:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 06:48:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2022-12-06 06:48:18,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19576719576719576 [2022-12-06 06:48:18,969 INFO L175 Difference]: Start difference. First operand has 64 places, 73 transitions, 887 flow. Second operand 9 states and 74 transitions. [2022-12-06 06:48:18,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 96 transitions, 1221 flow [2022-12-06 06:48:18,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 96 transitions, 1169 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-12-06 06:48:18,977 INFO L231 Difference]: Finished difference. Result has 72 places, 74 transitions, 949 flow [2022-12-06 06:48:18,977 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=949, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2022-12-06 06:48:18,978 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 33 predicate places. [2022-12-06 06:48:18,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:18,978 INFO L89 Accepts]: Start accepts. Operand has 72 places, 74 transitions, 949 flow [2022-12-06 06:48:18,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:18,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:18,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 74 transitions, 949 flow [2022-12-06 06:48:18,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 74 transitions, 949 flow [2022-12-06 06:48:19,003 INFO L130 PetriNetUnfolder]: 31/163 cut-off events. [2022-12-06 06:48:19,003 INFO L131 PetriNetUnfolder]: For 1034/1047 co-relation queries the response was YES. [2022-12-06 06:48:19,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 163 events. 31/163 cut-off events. For 1034/1047 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 909 event pairs, 2 based on Foata normal form. 6/167 useless extension candidates. Maximal degree in co-relation 779. Up to 60 conditions per place. [2022-12-06 06:48:19,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 74 transitions, 949 flow [2022-12-06 06:48:19,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-06 06:48:19,017 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:48:19,017 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 06:48:19,018 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 74 transitions, 949 flow [2022-12-06 06:48:19,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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:19,018 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:19,018 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:19,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:48:19,018 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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:19,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:19,018 INFO L85 PathProgramCache]: Analyzing trace with hash 317446426, now seen corresponding path program 1 times [2022-12-06 06:48:19,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:19,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973302977] [2022-12-06 06:48:19,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:19,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:48:19,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:19,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973302977] [2022-12-06 06:48:19,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973302977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:19,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:19,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:48:19,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907880416] [2022-12-06 06:48:19,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:19,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:48:19,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:19,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:48:19,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:48:19,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 06:48:19,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 74 transitions, 949 flow. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:48:19,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:19,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 06:48:19,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:19,756 INFO L130 PetriNetUnfolder]: 109/332 cut-off events. [2022-12-06 06:48:19,756 INFO L131 PetriNetUnfolder]: For 2405/2405 co-relation queries the response was YES. [2022-12-06 06:48:19,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2044 conditions, 332 events. 109/332 cut-off events. For 2405/2405 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1896 event pairs, 15 based on Foata normal form. 2/333 useless extension candidates. Maximal degree in co-relation 1857. Up to 106 conditions per place. [2022-12-06 06:48:19,758 INFO L137 encePairwiseOnDemand]: 24/41 looper letters, 66 selfloop transitions, 32 changer transitions 21/119 dead transitions. [2022-12-06 06:48:19,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 119 transitions, 1689 flow [2022-12-06 06:48:19,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:48:19,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:48:19,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-06 06:48:19,759 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2967479674796748 [2022-12-06 06:48:19,759 INFO L175 Difference]: Start difference. First operand has 72 places, 74 transitions, 949 flow. Second operand 6 states and 73 transitions. [2022-12-06 06:48:19,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 119 transitions, 1689 flow [2022-12-06 06:48:19,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 119 transitions, 1503 flow, removed 21 selfloop flow, removed 9 redundant places. [2022-12-06 06:48:19,767 INFO L231 Difference]: Finished difference. Result has 69 places, 77 transitions, 910 flow [2022-12-06 06:48:19,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=69, PETRI_TRANSITIONS=77} [2022-12-06 06:48:19,768 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 30 predicate places. [2022-12-06 06:48:19,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:19,768 INFO L89 Accepts]: Start accepts. Operand has 69 places, 77 transitions, 910 flow [2022-12-06 06:48:19,769 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:19,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:19,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 77 transitions, 910 flow [2022-12-06 06:48:19,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 77 transitions, 910 flow [2022-12-06 06:48:19,785 INFO L130 PetriNetUnfolder]: 32/180 cut-off events. [2022-12-06 06:48:19,785 INFO L131 PetriNetUnfolder]: For 907/909 co-relation queries the response was YES. [2022-12-06 06:48:19,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 907 conditions, 180 events. 32/180 cut-off events. For 907/909 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1033 event pairs, 1 based on Foata normal form. 1/179 useless extension candidates. Maximal degree in co-relation 876. Up to 60 conditions per place. [2022-12-06 06:48:19,787 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 77 transitions, 910 flow [2022-12-06 06:48:19,787 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-06 06:48:19,791 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:48:19,793 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 06:48:19,793 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 77 transitions, 910 flow [2022-12-06 06:48:19,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:48:19,793 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:19,793 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:19,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:48:19,793 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:19,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:19,794 INFO L85 PathProgramCache]: Analyzing trace with hash -636923646, now seen corresponding path program 1 times [2022-12-06 06:48:19,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:19,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116387326] [2022-12-06 06:48:19,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:19,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:20,834 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,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:20,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116387326] [2022-12-06 06:48:20,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116387326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:20,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:20,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 06:48:20,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754648770] [2022-12-06 06:48:20,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:20,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 06:48:20,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:20,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 06:48:20,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 06:48:20,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 06:48:20,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 77 transitions, 910 flow. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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:20,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:20,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 06:48:20,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:21,400 INFO L130 PetriNetUnfolder]: 81/276 cut-off events. [2022-12-06 06:48:21,401 INFO L131 PetriNetUnfolder]: For 1433/1433 co-relation queries the response was YES. [2022-12-06 06:48:21,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1565 conditions, 276 events. 81/276 cut-off events. For 1433/1433 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1528 event pairs, 24 based on Foata normal form. 2/277 useless extension candidates. Maximal degree in co-relation 1531. Up to 213 conditions per place. [2022-12-06 06:48:21,404 INFO L137 encePairwiseOnDemand]: 26/38 looper letters, 73 selfloop transitions, 16 changer transitions 5/94 dead transitions. [2022-12-06 06:48:21,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 94 transitions, 1211 flow [2022-12-06 06:48:21,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:48:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:48:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-12-06 06:48:21,405 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20394736842105263 [2022-12-06 06:48:21,406 INFO L175 Difference]: Start difference. First operand has 67 places, 77 transitions, 910 flow. Second operand 8 states and 62 transitions. [2022-12-06 06:48:21,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 94 transitions, 1211 flow [2022-12-06 06:48:21,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 94 transitions, 1173 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 06:48:21,418 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 980 flow [2022-12-06 06:48:21,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=980, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2022-12-06 06:48:21,418 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 35 predicate places. [2022-12-06 06:48:21,419 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:21,419 INFO L89 Accepts]: Start accepts. Operand has 74 places, 81 transitions, 980 flow [2022-12-06 06:48:21,420 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:21,420 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:21,420 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 81 transitions, 980 flow [2022-12-06 06:48:21,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 81 transitions, 980 flow [2022-12-06 06:48:21,446 INFO L130 PetriNetUnfolder]: 30/182 cut-off events. [2022-12-06 06:48:21,447 INFO L131 PetriNetUnfolder]: For 977/980 co-relation queries the response was YES. [2022-12-06 06:48:21,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 182 events. 30/182 cut-off events. For 977/980 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1078 event pairs, 1 based on Foata normal form. 2/183 useless extension candidates. Maximal degree in co-relation 906. Up to 57 conditions per place. [2022-12-06 06:48:21,448 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 81 transitions, 980 flow [2022-12-06 06:48:21,449 INFO L188 LiptonReduction]: Number of co-enabled transitions 52 [2022-12-06 06:48:21,449 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] L1711-1-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_205 28))) (and (= (store |v_#memory_$Pointer$.base_660| v_my_callbackThread1of1ForFork0_~data~0.base_205 (store (select |v_#memory_$Pointer$.base_660| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0 (select (select |v_#memory_$Pointer$.base_659| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0))) |v_#memory_$Pointer$.base_659|) (= (store |v_#pthreadsMutex_274| v_my_callbackThread1of1ForFork0_~data~0.base_205 (store (select |v_#pthreadsMutex_274| v_my_callbackThread1of1ForFork0_~data~0.base_205) v_my_callbackThread1of1ForFork0_~data~0.offset_205 0)) |v_#pthreadsMutex_273|) (= |v_my_callbackThread1of1ForFork0_#res.base_37| 0) (= (store |v_#memory_$Pointer$.offset_660| v_my_callbackThread1of1ForFork0_~data~0.base_205 (store (select |v_#memory_$Pointer$.offset_660| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0 (select (select |v_#memory_$Pointer$.offset_659| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0))) |v_#memory_$Pointer$.offset_659|) (= |v_my_callbackThread1of1ForFork0_#res.offset_37| 0) (= (store |v_#memory_int_726| v_my_callbackThread1of1ForFork0_~data~0.base_205 (let ((.cse1 (select |v_#memory_int_726| v_my_callbackThread1of1ForFork0_~data~0.base_205))) (store .cse1 .cse0 (+ (select .cse1 .cse0) 1)))) |v_#memory_int_725|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_274|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_205, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_660|, #memory_int=|v_#memory_int_726|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_205, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_660|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_273|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_205, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_37|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_108|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_659|, #memory_int=|v_#memory_int_725|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_37|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_205, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_659|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] and [604] $Ultimate##0-->L1711-1: Formula: (let ((.cse1 (select |v_#pthreadsMutex_334| v_my_callbackThread1of1ForFork1_~data~0.base_288)) (.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_288 24))) (and (= v_my_callbackThread1of1ForFork1_~data~0.base_288 v_my_callbackThread1of1ForFork1_~__mptr~0.base_35) (= v_my_callbackThread1of1ForFork1_~arg.base_33 |v_my_callbackThread1of1ForFork1_#in~arg.base_33|) (= (store |v_#memory_int_873| v_my_callbackThread1of1ForFork1_~data~0.base_288 (store (select |v_#memory_int_873| v_my_callbackThread1of1ForFork1_~data~0.base_288) .cse0 1)) |v_#memory_int_872|) (= v_~my_dev~0.offset_142 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_35) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_35 v_~my_dev~0.base_142) (= (select .cse1 v_my_callbackThread1of1ForFork1_~data~0.offset_288) 0) (= (store |v_#memory_$Pointer$.offset_805| v_my_callbackThread1of1ForFork1_~data~0.base_288 (store (select |v_#memory_$Pointer$.offset_805| v_my_callbackThread1of1ForFork1_~data~0.base_288) .cse0 (select (select |v_#memory_$Pointer$.offset_804| v_my_callbackThread1of1ForFork1_~data~0.base_288) .cse0))) |v_#memory_$Pointer$.offset_804|) (= v_my_callbackThread1of1ForFork1_~arg.offset_33 |v_my_callbackThread1of1ForFork1_#in~arg.offset_33|) (= (store |v_#pthreadsMutex_334| v_my_callbackThread1of1ForFork1_~data~0.base_288 (store .cse1 v_my_callbackThread1of1ForFork1_~data~0.offset_288 1)) |v_#pthreadsMutex_333|) (= (store |v_#memory_$Pointer$.base_805| v_my_callbackThread1of1ForFork1_~data~0.base_288 (store (select |v_#memory_$Pointer$.base_805| v_my_callbackThread1of1ForFork1_~data~0.base_288) .cse0 (select (select |v_#memory_$Pointer$.base_804| v_my_callbackThread1of1ForFork1_~data~0.base_288) .cse0))) |v_#memory_$Pointer$.base_804|) (= .cse0 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_35))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_33|, #pthreadsMutex=|v_#pthreadsMutex_334|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_805|, ~my_dev~0.base=v_~my_dev~0.base_142, #memory_int=|v_#memory_int_873|, ~my_dev~0.offset=v_~my_dev~0.offset_142, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_805|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_333|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_804|, ~my_dev~0.base=v_~my_dev~0.base_142, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_33, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_35, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_99|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_33|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_33|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_288, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_288, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_33, #memory_int=|v_#memory_int_872|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_35, ~my_dev~0.offset=v_~my_dev~0.offset_142, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_804|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, #memory_$Pointer$.base, my_callbackThread1of1ForFork1_~arg.base, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_#t~nondet31, #memory_$Pointer$.offset] [2022-12-06 06:48:22,014 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] L1711-1-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_205 28))) (and (= (store |v_#memory_$Pointer$.base_660| v_my_callbackThread1of1ForFork0_~data~0.base_205 (store (select |v_#memory_$Pointer$.base_660| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0 (select (select |v_#memory_$Pointer$.base_659| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0))) |v_#memory_$Pointer$.base_659|) (= (store |v_#pthreadsMutex_274| v_my_callbackThread1of1ForFork0_~data~0.base_205 (store (select |v_#pthreadsMutex_274| v_my_callbackThread1of1ForFork0_~data~0.base_205) v_my_callbackThread1of1ForFork0_~data~0.offset_205 0)) |v_#pthreadsMutex_273|) (= |v_my_callbackThread1of1ForFork0_#res.base_37| 0) (= (store |v_#memory_$Pointer$.offset_660| v_my_callbackThread1of1ForFork0_~data~0.base_205 (store (select |v_#memory_$Pointer$.offset_660| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0 (select (select |v_#memory_$Pointer$.offset_659| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0))) |v_#memory_$Pointer$.offset_659|) (= |v_my_callbackThread1of1ForFork0_#res.offset_37| 0) (= (store |v_#memory_int_726| v_my_callbackThread1of1ForFork0_~data~0.base_205 (let ((.cse1 (select |v_#memory_int_726| v_my_callbackThread1of1ForFork0_~data~0.base_205))) (store .cse1 .cse0 (+ (select .cse1 .cse0) 1)))) |v_#memory_int_725|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_274|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_205, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_660|, #memory_int=|v_#memory_int_726|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_205, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_660|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_273|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_205, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_37|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_108|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_659|, #memory_int=|v_#memory_int_725|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_37|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_205, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_659|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] and [603] $Ultimate##0-->L1711-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_330| v_my_callbackThread1of1ForFork1_~data~0.base_277)) (.cse1 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_277 24))) (and (= |v_#pthreadsMutex_329| (store |v_#pthreadsMutex_330| v_my_callbackThread1of1ForFork1_~data~0.base_277 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_277 1))) (= (store |v_#memory_$Pointer$.offset_780| v_my_callbackThread1of1ForFork1_~data~0.base_277 (store (select |v_#memory_$Pointer$.offset_780| v_my_callbackThread1of1ForFork1_~data~0.base_277) .cse1 (select (select |v_#memory_$Pointer$.offset_779| v_my_callbackThread1of1ForFork1_~data~0.base_277) .cse1))) |v_#memory_$Pointer$.offset_779|) (= v_my_callbackThread1of1ForFork1_~data~0.base_277 v_my_callbackThread1of1ForFork1_~__mptr~0.base_33) (= v_my_callbackThread1of1ForFork1_~arg.base_31 |v_my_callbackThread1of1ForFork1_#in~arg.base_31|) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_33 v_~my_dev~0.base_134) (= v_my_callbackThread1of1ForFork1_~arg.offset_31 |v_my_callbackThread1of1ForFork1_#in~arg.offset_31|) (= .cse1 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_33) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_277) 0) (= (store |v_#memory_int_848| v_my_callbackThread1of1ForFork1_~data~0.base_277 (store (select |v_#memory_int_848| v_my_callbackThread1of1ForFork1_~data~0.base_277) .cse1 1)) |v_#memory_int_847|) (= (store |v_#memory_$Pointer$.base_780| v_my_callbackThread1of1ForFork1_~data~0.base_277 (store (select |v_#memory_$Pointer$.base_780| v_my_callbackThread1of1ForFork1_~data~0.base_277) .cse1 (select (select |v_#memory_$Pointer$.base_779| v_my_callbackThread1of1ForFork1_~data~0.base_277) .cse1))) |v_#memory_$Pointer$.base_779|) (= v_~my_dev~0.offset_134 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_33))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_31|, #pthreadsMutex=|v_#pthreadsMutex_330|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_780|, ~my_dev~0.base=v_~my_dev~0.base_134, #memory_int=|v_#memory_int_848|, ~my_dev~0.offset=v_~my_dev~0.offset_134, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_780|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_329|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_779|, ~my_dev~0.base=v_~my_dev~0.base_134, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_31, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_33, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_92|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_31|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_31|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_277, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_277, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_31, #memory_int=|v_#memory_int_847|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_33, ~my_dev~0.offset=v_~my_dev~0.offset_134, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_779|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, #memory_$Pointer$.base, my_callbackThread1of1ForFork1_~arg.base, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_#t~nondet31, #memory_$Pointer$.offset] [2022-12-06 06:48:22,605 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:48:22,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1187 [2022-12-06 06:48:22,606 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 81 transitions, 998 flow [2022-12-06 06:48:22,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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:22,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:22,606 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:22,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:48:22,606 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:22,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:22,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1114981424, now seen corresponding path program 1 times [2022-12-06 06:48:22,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:22,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031450882] [2022-12-06 06:48:22,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:22,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:23,648 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:23,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:23,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031450882] [2022-12-06 06:48:23,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031450882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:23,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:23,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 06:48:23,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266734012] [2022-12-06 06:48:23,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:23,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 06:48:23,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:23,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 06:48:23,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 06:48:23,650 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 06:48:23,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 81 transitions, 998 flow. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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:23,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:23,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 06:48:23,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:24,093 INFO L130 PetriNetUnfolder]: 75/263 cut-off events. [2022-12-06 06:48:24,093 INFO L131 PetriNetUnfolder]: For 1509/1509 co-relation queries the response was YES. [2022-12-06 06:48:24,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1529 conditions, 263 events. 75/263 cut-off events. For 1509/1509 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1423 event pairs, 25 based on Foata normal form. 2/264 useless extension candidates. Maximal degree in co-relation 1502. Up to 216 conditions per place. [2022-12-06 06:48:24,096 INFO L137 encePairwiseOnDemand]: 26/39 looper letters, 67 selfloop transitions, 10 changer transitions 13/90 dead transitions. [2022-12-06 06:48:24,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 90 transitions, 1214 flow [2022-12-06 06:48:24,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:48:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:48:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-12-06 06:48:24,098 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1858974358974359 [2022-12-06 06:48:24,098 INFO L175 Difference]: Start difference. First operand has 73 places, 81 transitions, 998 flow. Second operand 8 states and 58 transitions. [2022-12-06 06:48:24,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 90 transitions, 1214 flow [2022-12-06 06:48:24,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 90 transitions, 1164 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-06 06:48:24,107 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 862 flow [2022-12-06 06:48:24,107 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=862, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2022-12-06 06:48:24,108 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 40 predicate places. [2022-12-06 06:48:24,108 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:24,108 INFO L89 Accepts]: Start accepts. Operand has 79 places, 74 transitions, 862 flow [2022-12-06 06:48:24,108 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:24,108 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:24,109 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 74 transitions, 862 flow [2022-12-06 06:48:24,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 74 transitions, 862 flow [2022-12-06 06:48:24,131 INFO L130 PetriNetUnfolder]: 26/160 cut-off events. [2022-12-06 06:48:24,131 INFO L131 PetriNetUnfolder]: For 833/836 co-relation queries the response was YES. [2022-12-06 06:48:24,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 160 events. 26/160 cut-off events. For 833/836 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 881 event pairs, 1 based on Foata normal form. 2/161 useless extension candidates. Maximal degree in co-relation 778. Up to 49 conditions per place. [2022-12-06 06:48:24,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 74 transitions, 862 flow [2022-12-06 06:48:24,133 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 06:48:24,138 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:24,138 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:24,139 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:24,140 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:24,141 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 0)) (= |v_#valid_212| (store |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 1)) (= |v_ULTIMATE.start_main_~#data~1#1.base_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_100| 0) (< |v_#StackHeapBarrier_70| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_57| |v_ULTIMATE.start_main_~probe_ret~0#1_100|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|) (= (store |v_#length_154| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 4) |v_#length_153|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|) (= (select |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) 0) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46| (select (select |v_#memory_int_537| |v_~#t1~0.base_61|) |v_~#t1~0.offset_61|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_70|, ~#t1~0.base=|v_~#t1~0.base_61|, #valid=|v_#valid_213|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_217|, #memory_int=|v_#memory_int_537|, ~#t1~0.offset=|v_~#t1~0.offset_61|, #length=|v_#length_154|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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_101|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_74|, ~#t1~0.offset=|v_~#t1~0.offset_61|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|, 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_57|, ~#t1~0.base=|v_~#t1~0.base_61|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_82|, 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_100|, #length=|v_#length_153|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_45|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|, 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_217|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_64|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93|, #StackHeapBarrier=|v_#StackHeapBarrier_70|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|, #valid=|v_#valid_212|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_74|, #memory_int=|v_#memory_int_537|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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 [590] L1711-1-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_205 28))) (and (= (store |v_#memory_$Pointer$.base_660| v_my_callbackThread1of1ForFork0_~data~0.base_205 (store (select |v_#memory_$Pointer$.base_660| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0 (select (select |v_#memory_$Pointer$.base_659| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0))) |v_#memory_$Pointer$.base_659|) (= (store |v_#pthreadsMutex_274| v_my_callbackThread1of1ForFork0_~data~0.base_205 (store (select |v_#pthreadsMutex_274| v_my_callbackThread1of1ForFork0_~data~0.base_205) v_my_callbackThread1of1ForFork0_~data~0.offset_205 0)) |v_#pthreadsMutex_273|) (= |v_my_callbackThread1of1ForFork0_#res.base_37| 0) (= (store |v_#memory_$Pointer$.offset_660| v_my_callbackThread1of1ForFork0_~data~0.base_205 (store (select |v_#memory_$Pointer$.offset_660| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0 (select (select |v_#memory_$Pointer$.offset_659| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0))) |v_#memory_$Pointer$.offset_659|) (= |v_my_callbackThread1of1ForFork0_#res.offset_37| 0) (= (store |v_#memory_int_726| v_my_callbackThread1of1ForFork0_~data~0.base_205 (let ((.cse1 (select |v_#memory_int_726| v_my_callbackThread1of1ForFork0_~data~0.base_205))) (store .cse1 .cse0 (+ (select .cse1 .cse0) 1)))) |v_#memory_int_725|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_274|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_205, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_660|, #memory_int=|v_#memory_int_726|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_205, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_660|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_273|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_205, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_37|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_108|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_659|, #memory_int=|v_#memory_int_725|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_37|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_205, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_659|} 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:24,357 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:48:24,357 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 249 [2022-12-06 06:48:24,358 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 73 transitions, 856 flow [2022-12-06 06:48:24,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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:24,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:24,358 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:24,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:48:24,358 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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:24,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:24,358 INFO L85 PathProgramCache]: Analyzing trace with hash -549340698, now seen corresponding path program 1 times [2022-12-06 06:48:24,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:24,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258082144] [2022-12-06 06:48:24,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:24,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:24,933 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,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:24,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258082144] [2022-12-06 06:48:24,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258082144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:24,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:24,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:48:24,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512413791] [2022-12-06 06:48:24,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:24,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:48:24,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:24,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:48:24,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:48:24,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 06:48:24,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 73 transitions, 856 flow. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:24,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:24,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 06:48:24,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:25,272 INFO L130 PetriNetUnfolder]: 64/231 cut-off events. [2022-12-06 06:48:25,272 INFO L131 PetriNetUnfolder]: For 1215/1215 co-relation queries the response was YES. [2022-12-06 06:48:25,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1318 conditions, 231 events. 64/231 cut-off events. For 1215/1215 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1188 event pairs, 7 based on Foata normal form. 2/232 useless extension candidates. Maximal degree in co-relation 1289. Up to 86 conditions per place. [2022-12-06 06:48:25,274 INFO L137 encePairwiseOnDemand]: 25/37 looper letters, 53 selfloop transitions, 26 changer transitions 18/97 dead transitions. [2022-12-06 06:48:25,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 97 transitions, 1222 flow [2022-12-06 06:48:25,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 06:48:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 06:48:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2022-12-06 06:48:25,278 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1918918918918919 [2022-12-06 06:48:25,278 INFO L175 Difference]: Start difference. First operand has 73 places, 73 transitions, 856 flow. Second operand 10 states and 71 transitions. [2022-12-06 06:48:25,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 97 transitions, 1222 flow [2022-12-06 06:48:25,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 97 transitions, 1172 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-12-06 06:48:25,289 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 689 flow [2022-12-06 06:48:25,289 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=689, PETRI_PLACES=79, PETRI_TRANSITIONS=59} [2022-12-06 06:48:25,290 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 40 predicate places. [2022-12-06 06:48:25,291 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:25,291 INFO L89 Accepts]: Start accepts. Operand has 79 places, 59 transitions, 689 flow [2022-12-06 06:48:25,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:25,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:25,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 59 transitions, 689 flow [2022-12-06 06:48:25,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 59 transitions, 689 flow [2022-12-06 06:48:25,311 INFO L130 PetriNetUnfolder]: 13/111 cut-off events. [2022-12-06 06:48:25,311 INFO L131 PetriNetUnfolder]: For 679/681 co-relation queries the response was YES. [2022-12-06 06:48:25,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 111 events. 13/111 cut-off events. For 679/681 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 489 event pairs, 1 based on Foata normal form. 1/111 useless extension candidates. Maximal degree in co-relation 535. Up to 35 conditions per place. [2022-12-06 06:48:25,312 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 59 transitions, 689 flow [2022-12-06 06:48:25,312 INFO L188 LiptonReduction]: Number of co-enabled transitions 26 [2022-12-06 06:48:25,317 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:48:25,317 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 06:48:25,317 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 689 flow [2022-12-06 06:48:25,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:25,318 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:25,318 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:25,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:48:25,318 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:25,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:25,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1451744469, now seen corresponding path program 1 times [2022-12-06 06:48:25,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:25,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398085225] [2022-12-06 06:48:25,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:25,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:26,491 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:26,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:26,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398085225] [2022-12-06 06:48:26,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398085225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:26,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:26,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 06:48:26,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071495808] [2022-12-06 06:48:26,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:26,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 06:48:26,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:26,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 06:48:26,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 06:48:26,493 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 06:48:26,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 689 flow. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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:26,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:26,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 06:48:26,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:26,927 INFO L130 PetriNetUnfolder]: 29/143 cut-off events. [2022-12-06 06:48:26,927 INFO L131 PetriNetUnfolder]: For 896/896 co-relation queries the response was YES. [2022-12-06 06:48:26,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 143 events. 29/143 cut-off events. For 896/896 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 610 event pairs, 9 based on Foata normal form. 1/143 useless extension candidates. Maximal degree in co-relation 794. Up to 95 conditions per place. [2022-12-06 06:48:26,928 INFO L137 encePairwiseOnDemand]: 19/31 looper letters, 52 selfloop transitions, 16 changer transitions 5/73 dead transitions. [2022-12-06 06:48:26,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 73 transitions, 919 flow [2022-12-06 06:48:26,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:48:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:48:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-12-06 06:48:26,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22580645161290322 [2022-12-06 06:48:26,930 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 689 flow. Second operand 8 states and 56 transitions. [2022-12-06 06:48:26,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 73 transitions, 919 flow [2022-12-06 06:48:26,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 73 transitions, 816 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-12-06 06:48:26,934 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 652 flow [2022-12-06 06:48:26,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=652, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2022-12-06 06:48:26,934 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 36 predicate places. [2022-12-06 06:48:26,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:26,935 INFO L89 Accepts]: Start accepts. Operand has 75 places, 60 transitions, 652 flow [2022-12-06 06:48:26,936 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:26,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:26,936 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 60 transitions, 652 flow [2022-12-06 06:48:26,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 60 transitions, 652 flow [2022-12-06 06:48:26,948 INFO L130 PetriNetUnfolder]: 12/108 cut-off events. [2022-12-06 06:48:26,948 INFO L131 PetriNetUnfolder]: For 533/535 co-relation queries the response was YES. [2022-12-06 06:48:26,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 108 events. 12/108 cut-off events. For 533/535 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 471 event pairs, 1 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 482. Up to 33 conditions per place. [2022-12-06 06:48:26,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 60 transitions, 652 flow [2022-12-06 06:48:26,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 24 [2022-12-06 06:48:26,950 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] L1711-1-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_205 28))) (and (= (store |v_#memory_$Pointer$.base_660| v_my_callbackThread1of1ForFork0_~data~0.base_205 (store (select |v_#memory_$Pointer$.base_660| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0 (select (select |v_#memory_$Pointer$.base_659| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0))) |v_#memory_$Pointer$.base_659|) (= (store |v_#pthreadsMutex_274| v_my_callbackThread1of1ForFork0_~data~0.base_205 (store (select |v_#pthreadsMutex_274| v_my_callbackThread1of1ForFork0_~data~0.base_205) v_my_callbackThread1of1ForFork0_~data~0.offset_205 0)) |v_#pthreadsMutex_273|) (= |v_my_callbackThread1of1ForFork0_#res.base_37| 0) (= (store |v_#memory_$Pointer$.offset_660| v_my_callbackThread1of1ForFork0_~data~0.base_205 (store (select |v_#memory_$Pointer$.offset_660| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0 (select (select |v_#memory_$Pointer$.offset_659| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0))) |v_#memory_$Pointer$.offset_659|) (= |v_my_callbackThread1of1ForFork0_#res.offset_37| 0) (= (store |v_#memory_int_726| v_my_callbackThread1of1ForFork0_~data~0.base_205 (let ((.cse1 (select |v_#memory_int_726| v_my_callbackThread1of1ForFork0_~data~0.base_205))) (store .cse1 .cse0 (+ (select .cse1 .cse0) 1)))) |v_#memory_int_725|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_274|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_205, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_660|, #memory_int=|v_#memory_int_726|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_205, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_660|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_273|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_205, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_37|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_108|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_659|, #memory_int=|v_#memory_int_725|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_37|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_205, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_659|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] and [550] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_128| v_my_callbackThread1of1ForFork1_~data~0.base_89))) (and (= v_~my_dev~0.offset_42 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_13) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_89) 0) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_13 v_~my_dev~0.base_42) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_89 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_13) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_27| 0) (= v_my_callbackThread1of1ForFork1_~arg.base_11 |v_my_callbackThread1of1ForFork1_#in~arg.base_11|) (= (store |v_#pthreadsMutex_128| v_my_callbackThread1of1ForFork1_~data~0.base_89 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_89 1)) |v_#pthreadsMutex_127|) (= v_my_callbackThread1of1ForFork1_~arg.offset_11 |v_my_callbackThread1of1ForFork1_#in~arg.offset_11|) (= v_my_callbackThread1of1ForFork1_~data~0.base_89 v_my_callbackThread1of1ForFork1_~__mptr~0.base_13))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_11|, #pthreadsMutex=|v_#pthreadsMutex_128|, ~my_dev~0.base=v_~my_dev~0.base_42, ~my_dev~0.offset=v_~my_dev~0.offset_42, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_11|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_11|, #pthreadsMutex=|v_#pthreadsMutex_127|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_89, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_89, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_11, ~my_dev~0.base=v_~my_dev~0.base_42, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_11, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_13, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_13, ~my_dev~0.offset=v_~my_dev~0.offset_42, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_27|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_11|} 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_#t~nondet31] [2022-12-06 06:48:28,076 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:28,085 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:28,086 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:28,087 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:30,470 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:48:30,473 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3539 [2022-12-06 06:48:30,474 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 673 flow [2022-12-06 06:48:30,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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:30,474 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:30,474 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:30,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 06:48:30,474 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:30,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:30,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1566362331, now seen corresponding path program 1 times [2022-12-06 06:48:30,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:30,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967739406] [2022-12-06 06:48:30,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:30,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:31,381 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,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:31,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967739406] [2022-12-06 06:48:31,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967739406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:31,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:31,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:48:31,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166896215] [2022-12-06 06:48:31,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:31,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:48:31,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:31,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:48:31,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:48:31,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 06:48:31,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 673 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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:31,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:31,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 06:48:31,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:31,776 INFO L130 PetriNetUnfolder]: 26/140 cut-off events. [2022-12-06 06:48:31,777 INFO L131 PetriNetUnfolder]: For 845/845 co-relation queries the response was YES. [2022-12-06 06:48:31,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 140 events. 26/140 cut-off events. For 845/845 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 621 event pairs, 11 based on Foata normal form. 1/140 useless extension candidates. Maximal degree in co-relation 734. Up to 108 conditions per place. [2022-12-06 06:48:31,778 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 49 selfloop transitions, 12 changer transitions 10/71 dead transitions. [2022-12-06 06:48:31,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 71 transitions, 884 flow [2022-12-06 06:48:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:48:31,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:48:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-12-06 06:48:31,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22510822510822512 [2022-12-06 06:48:31,779 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 673 flow. Second operand 7 states and 52 transitions. [2022-12-06 06:48:31,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 71 transitions, 884 flow [2022-12-06 06:48:31,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 71 transitions, 810 flow, removed 16 selfloop flow, removed 7 redundant places. [2022-12-06 06:48:31,785 INFO L231 Difference]: Finished difference. Result has 75 places, 56 transitions, 581 flow [2022-12-06 06:48:31,785 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=581, PETRI_PLACES=75, PETRI_TRANSITIONS=56} [2022-12-06 06:48:31,786 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 36 predicate places. [2022-12-06 06:48:31,786 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:31,786 INFO L89 Accepts]: Start accepts. Operand has 75 places, 56 transitions, 581 flow [2022-12-06 06:48:31,786 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:31,786 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:31,787 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 56 transitions, 581 flow [2022-12-06 06:48:31,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 56 transitions, 581 flow [2022-12-06 06:48:31,802 INFO L130 PetriNetUnfolder]: 10/102 cut-off events. [2022-12-06 06:48:31,802 INFO L131 PetriNetUnfolder]: For 497/498 co-relation queries the response was YES. [2022-12-06 06:48:31,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 102 events. 10/102 cut-off events. For 497/498 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 450 event pairs, 1 based on Foata normal form. 1/102 useless extension candidates. Maximal degree in co-relation 420. Up to 29 conditions per place. [2022-12-06 06:48:31,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 56 transitions, 581 flow [2022-12-06 06:48:31,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-06 06:48:31,804 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:48:31,804 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 06:48:31,804 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 581 flow [2022-12-06 06:48:31,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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:31,805 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:31,805 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:31,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 06:48:31,805 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:31,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:31,805 INFO L85 PathProgramCache]: Analyzing trace with hash -258939492, now seen corresponding path program 1 times [2022-12-06 06:48:31,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:31,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41137136] [2022-12-06 06:48:31,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:31,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:32,641 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:32,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:32,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41137136] [2022-12-06 06:48:32,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41137136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:32,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:32,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:48:32,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41033657] [2022-12-06 06:48:32,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:32,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:48:32,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:32,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:48:32,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:48:32,643 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 06:48:32,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 581 flow. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:32,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:32,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 06:48:32,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:32,952 INFO L130 PetriNetUnfolder]: 26/142 cut-off events. [2022-12-06 06:48:32,952 INFO L131 PetriNetUnfolder]: For 643/643 co-relation queries the response was YES. [2022-12-06 06:48:32,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 142 events. 26/142 cut-off events. For 643/643 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 630 event pairs, 11 based on Foata normal form. 2/143 useless extension candidates. Maximal degree in co-relation 671. Up to 98 conditions per place. [2022-12-06 06:48:32,953 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 44 selfloop transitions, 9 changer transitions 13/66 dead transitions. [2022-12-06 06:48:32,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 66 transitions, 754 flow [2022-12-06 06:48:32,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:48:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:48:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-12-06 06:48:32,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22380952380952382 [2022-12-06 06:48:32,955 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 581 flow. Second operand 7 states and 47 transitions. [2022-12-06 06:48:32,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 66 transitions, 754 flow [2022-12-06 06:48:32,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 66 transitions, 694 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-12-06 06:48:32,960 INFO L231 Difference]: Finished difference. Result has 74 places, 51 transitions, 474 flow [2022-12-06 06:48:32,960 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=474, PETRI_PLACES=74, PETRI_TRANSITIONS=51} [2022-12-06 06:48:32,960 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 35 predicate places. [2022-12-06 06:48:32,960 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:32,960 INFO L89 Accepts]: Start accepts. Operand has 74 places, 51 transitions, 474 flow [2022-12-06 06:48:32,961 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:32,961 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:32,961 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 51 transitions, 474 flow [2022-12-06 06:48:32,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 51 transitions, 474 flow [2022-12-06 06:48:32,975 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-06 06:48:32,975 INFO L131 PetriNetUnfolder]: For 329/330 co-relation queries the response was YES. [2022-12-06 06:48:32,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 91 events. 7/91 cut-off events. For 329/330 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 348 event pairs, 1 based on Foata normal form. 1/91 useless extension candidates. Maximal degree in co-relation 341. Up to 25 conditions per place. [2022-12-06 06:48:32,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 51 transitions, 474 flow [2022-12-06 06:48:32,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 18 [2022-12-06 06:48:32,982 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:32,983 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:32,985 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:32,986 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:33,257 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:33,258 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:33,259 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:33,260 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:33,693 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:48:33,693 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 733 [2022-12-06 06:48:33,694 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 49 transitions, 480 flow [2022-12-06 06:48:33,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:33,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:33,694 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:33,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 06:48:33,694 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:33,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:33,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1637633996, now seen corresponding path program 1 times [2022-12-06 06:48:33,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:33,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689540532] [2022-12-06 06:48:33,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:33,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:34,544 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:34,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:34,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689540532] [2022-12-06 06:48:34,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689540532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:34,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:34,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:48:34,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407275917] [2022-12-06 06:48:34,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:34,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:48:34,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:34,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:48:34,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:48:34,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 06:48:34,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 49 transitions, 480 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:34,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 06:48:34,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:34,728 INFO L130 PetriNetUnfolder]: 13/100 cut-off events. [2022-12-06 06:48:34,728 INFO L131 PetriNetUnfolder]: For 462/462 co-relation queries the response was YES. [2022-12-06 06:48:34,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 100 events. 13/100 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 391 event pairs, 4 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 483. Up to 79 conditions per place. [2022-12-06 06:48:34,729 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 41 selfloop transitions, 7 changer transitions 7/55 dead transitions. [2022-12-06 06:48:34,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 55 transitions, 606 flow [2022-12-06 06:48:34,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:48:34,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:48:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-12-06 06:48:34,729 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23563218390804597 [2022-12-06 06:48:34,729 INFO L175 Difference]: Start difference. First operand has 67 places, 49 transitions, 480 flow. Second operand 6 states and 41 transitions. [2022-12-06 06:48:34,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 55 transitions, 606 flow [2022-12-06 06:48:34,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 55 transitions, 550 flow, removed 19 selfloop flow, removed 8 redundant places. [2022-12-06 06:48:34,732 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 409 flow [2022-12-06 06:48:34,732 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=409, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2022-12-06 06:48:34,732 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 26 predicate places. [2022-12-06 06:48:34,733 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:34,733 INFO L89 Accepts]: Start accepts. Operand has 65 places, 46 transitions, 409 flow [2022-12-06 06:48:34,733 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:34,733 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:34,733 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 46 transitions, 409 flow [2022-12-06 06:48:34,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 46 transitions, 409 flow [2022-12-06 06:48:34,741 INFO L130 PetriNetUnfolder]: 6/80 cut-off events. [2022-12-06 06:48:34,742 INFO L131 PetriNetUnfolder]: For 244/244 co-relation queries the response was YES. [2022-12-06 06:48:34,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 80 events. 6/80 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 289 event pairs, 1 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 296. Up to 22 conditions per place. [2022-12-06 06:48:34,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 46 transitions, 409 flow [2022-12-06 06:48:34,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-06 06:48:34,746 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:48:34,746 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 06:48:34,746 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 409 flow [2022-12-06 06:48:34,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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,746 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:34,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:34,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 06:48:34,747 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:34,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:34,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2091587508, now seen corresponding path program 1 times [2022-12-06 06:48:34,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:34,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076888618] [2022-12-06 06:48:34,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:34,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:35,431 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,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:35,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076888618] [2022-12-06 06:48:35,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076888618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:35,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:35,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 06:48:35,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666720433] [2022-12-06 06:48:35,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:35,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 06:48:35,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:35,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 06:48:35,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 06:48:35,432 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 06:48:35,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 409 flow. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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:35,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:35,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 06:48:35,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:35,687 INFO L130 PetriNetUnfolder]: 11/91 cut-off events. [2022-12-06 06:48:35,687 INFO L131 PetriNetUnfolder]: For 300/300 co-relation queries the response was YES. [2022-12-06 06:48:35,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 91 events. 11/91 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 332 event pairs, 4 based on Foata normal form. 1/91 useless extension candidates. Maximal degree in co-relation 417. Up to 61 conditions per place. [2022-12-06 06:48:35,688 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 38 selfloop transitions, 8 changer transitions 8/54 dead transitions. [2022-12-06 06:48:35,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 54 transitions, 547 flow [2022-12-06 06:48:35,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:48:35,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:48:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-12-06 06:48:35,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19907407407407407 [2022-12-06 06:48:35,689 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 409 flow. Second operand 8 states and 43 transitions. [2022-12-06 06:48:35,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 54 transitions, 547 flow [2022-12-06 06:48:35,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 54 transitions, 526 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-06 06:48:35,691 INFO L231 Difference]: Finished difference. Result has 65 places, 42 transitions, 372 flow [2022-12-06 06:48:35,691 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=372, PETRI_PLACES=65, PETRI_TRANSITIONS=42} [2022-12-06 06:48:35,691 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 26 predicate places. [2022-12-06 06:48:35,691 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:35,691 INFO L89 Accepts]: Start accepts. Operand has 65 places, 42 transitions, 372 flow [2022-12-06 06:48:35,691 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:35,692 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:35,692 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 42 transitions, 372 flow [2022-12-06 06:48:35,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 42 transitions, 372 flow [2022-12-06 06:48:35,699 INFO L130 PetriNetUnfolder]: 5/71 cut-off events. [2022-12-06 06:48:35,699 INFO L131 PetriNetUnfolder]: For 209/209 co-relation queries the response was YES. [2022-12-06 06:48:35,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 71 events. 5/71 cut-off events. For 209/209 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 235 event pairs, 1 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 198. Up to 21 conditions per place. [2022-12-06 06:48:35,703 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 42 transitions, 372 flow [2022-12-06 06:48:35,703 INFO L188 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-06 06:48:35,703 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_128| v_my_callbackThread1of1ForFork1_~data~0.base_89))) (and (= v_~my_dev~0.offset_42 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_13) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_89) 0) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_13 v_~my_dev~0.base_42) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_89 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_13) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_27| 0) (= v_my_callbackThread1of1ForFork1_~arg.base_11 |v_my_callbackThread1of1ForFork1_#in~arg.base_11|) (= (store |v_#pthreadsMutex_128| v_my_callbackThread1of1ForFork1_~data~0.base_89 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_89 1)) |v_#pthreadsMutex_127|) (= v_my_callbackThread1of1ForFork1_~arg.offset_11 |v_my_callbackThread1of1ForFork1_#in~arg.offset_11|) (= v_my_callbackThread1of1ForFork1_~data~0.base_89 v_my_callbackThread1of1ForFork1_~__mptr~0.base_13))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_11|, #pthreadsMutex=|v_#pthreadsMutex_128|, ~my_dev~0.base=v_~my_dev~0.base_42, ~my_dev~0.offset=v_~my_dev~0.offset_42, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_11|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_11|, #pthreadsMutex=|v_#pthreadsMutex_127|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_89, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_89, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_11, ~my_dev~0.base=v_~my_dev~0.base_42, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_11, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_13, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_13, ~my_dev~0.offset=v_~my_dev~0.offset_42, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_27|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_11|} 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_#t~nondet31] and [571] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 0)) (= |v_#valid_212| (store |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 1)) (= |v_ULTIMATE.start_main_~#data~1#1.base_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_100| 0) (< |v_#StackHeapBarrier_70| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_57| |v_ULTIMATE.start_main_~probe_ret~0#1_100|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|) (= (store |v_#length_154| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 4) |v_#length_153|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|) (= (select |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) 0) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46| (select (select |v_#memory_int_537| |v_~#t1~0.base_61|) |v_~#t1~0.offset_61|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_70|, ~#t1~0.base=|v_~#t1~0.base_61|, #valid=|v_#valid_213|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_217|, #memory_int=|v_#memory_int_537|, ~#t1~0.offset=|v_~#t1~0.offset_61|, #length=|v_#length_154|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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_101|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_74|, ~#t1~0.offset=|v_~#t1~0.offset_61|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|, 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_57|, ~#t1~0.base=|v_~#t1~0.base_61|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_82|, 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_100|, #length=|v_#length_153|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_45|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|, 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_217|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_64|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93|, #StackHeapBarrier=|v_#StackHeapBarrier_70|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|, #valid=|v_#valid_212|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_74|, #memory_int=|v_#memory_int_537|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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] [2022-12-06 06:48:35,873 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:48:35,874 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 06:48:35,874 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 377 flow [2022-12-06 06:48:35,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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:35,874 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:35,874 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,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 06:48:35,874 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:35,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:35,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1189139625, now seen corresponding path program 1 times [2022-12-06 06:48:35,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:35,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898380174] [2022-12-06 06:48:35,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:35,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:36,524 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,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:36,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898380174] [2022-12-06 06:48:36,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898380174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:36,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:36,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:48:36,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592989705] [2022-12-06 06:48:36,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:36,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:48:36,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:36,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:48:36,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:48:36,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:48:36,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 377 flow. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:36,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:48:36,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:36,695 INFO L130 PetriNetUnfolder]: 11/82 cut-off events. [2022-12-06 06:48:36,695 INFO L131 PetriNetUnfolder]: For 268/268 co-relation queries the response was YES. [2022-12-06 06:48:36,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 82 events. 11/82 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 273 event pairs, 2 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 272. Up to 56 conditions per place. [2022-12-06 06:48:36,696 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 32 selfloop transitions, 5 changer transitions 11/48 dead transitions. [2022-12-06 06:48:36,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 48 transitions, 487 flow [2022-12-06 06:48:36,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:48:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:48:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-12-06 06:48:36,696 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22285714285714286 [2022-12-06 06:48:36,696 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 377 flow. Second operand 7 states and 39 transitions. [2022-12-06 06:48:36,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 48 transitions, 487 flow [2022-12-06 06:48:36,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 48 transitions, 461 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-12-06 06:48:36,699 INFO L231 Difference]: Finished difference. Result has 61 places, 36 transitions, 302 flow [2022-12-06 06:48:36,699 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=302, PETRI_PLACES=61, PETRI_TRANSITIONS=36} [2022-12-06 06:48:36,699 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 22 predicate places. [2022-12-06 06:48:36,699 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:36,699 INFO L89 Accepts]: Start accepts. Operand has 61 places, 36 transitions, 302 flow [2022-12-06 06:48:36,700 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:36,700 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:36,700 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 36 transitions, 302 flow [2022-12-06 06:48:36,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 36 transitions, 302 flow [2022-12-06 06:48:36,706 INFO L130 PetriNetUnfolder]: 5/61 cut-off events. [2022-12-06 06:48:36,706 INFO L131 PetriNetUnfolder]: For 168/168 co-relation queries the response was YES. [2022-12-06 06:48:36,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 61 events. 5/61 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 165 event pairs, 1 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 158. Up to 19 conditions per place. [2022-12-06 06:48:36,707 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 36 transitions, 302 flow [2022-12-06 06:48:36,707 INFO L188 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-06 06:48:36,725 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] L1711-1-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_205 28))) (and (= (store |v_#memory_$Pointer$.base_660| v_my_callbackThread1of1ForFork0_~data~0.base_205 (store (select |v_#memory_$Pointer$.base_660| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0 (select (select |v_#memory_$Pointer$.base_659| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0))) |v_#memory_$Pointer$.base_659|) (= (store |v_#pthreadsMutex_274| v_my_callbackThread1of1ForFork0_~data~0.base_205 (store (select |v_#pthreadsMutex_274| v_my_callbackThread1of1ForFork0_~data~0.base_205) v_my_callbackThread1of1ForFork0_~data~0.offset_205 0)) |v_#pthreadsMutex_273|) (= |v_my_callbackThread1of1ForFork0_#res.base_37| 0) (= (store |v_#memory_$Pointer$.offset_660| v_my_callbackThread1of1ForFork0_~data~0.base_205 (store (select |v_#memory_$Pointer$.offset_660| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0 (select (select |v_#memory_$Pointer$.offset_659| v_my_callbackThread1of1ForFork0_~data~0.base_205) .cse0))) |v_#memory_$Pointer$.offset_659|) (= |v_my_callbackThread1of1ForFork0_#res.offset_37| 0) (= (store |v_#memory_int_726| v_my_callbackThread1of1ForFork0_~data~0.base_205 (let ((.cse1 (select |v_#memory_int_726| v_my_callbackThread1of1ForFork0_~data~0.base_205))) (store .cse1 .cse0 (+ (select .cse1 .cse0) 1)))) |v_#memory_int_725|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_274|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_205, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_660|, #memory_int=|v_#memory_int_726|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_205, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_660|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_273|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_205, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_37|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_108|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_659|, #memory_int=|v_#memory_int_725|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_37|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_205, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_659|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] and [550] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_128| v_my_callbackThread1of1ForFork1_~data~0.base_89))) (and (= v_~my_dev~0.offset_42 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_13) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_89) 0) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_13 v_~my_dev~0.base_42) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_89 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_13) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_27| 0) (= v_my_callbackThread1of1ForFork1_~arg.base_11 |v_my_callbackThread1of1ForFork1_#in~arg.base_11|) (= (store |v_#pthreadsMutex_128| v_my_callbackThread1of1ForFork1_~data~0.base_89 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_89 1)) |v_#pthreadsMutex_127|) (= v_my_callbackThread1of1ForFork1_~arg.offset_11 |v_my_callbackThread1of1ForFork1_#in~arg.offset_11|) (= v_my_callbackThread1of1ForFork1_~data~0.base_89 v_my_callbackThread1of1ForFork1_~__mptr~0.base_13))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_11|, #pthreadsMutex=|v_#pthreadsMutex_128|, ~my_dev~0.base=v_~my_dev~0.base_42, ~my_dev~0.offset=v_~my_dev~0.offset_42, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_11|} OutVars{my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_11|, #pthreadsMutex=|v_#pthreadsMutex_127|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_89, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_89, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_11, ~my_dev~0.base=v_~my_dev~0.base_42, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_11, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_13, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_13, ~my_dev~0.offset=v_~my_dev~0.offset_42, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_27|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_11|} 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_#t~nondet31] [2022-12-06 06:48:36,925 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:36,926 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:36,927 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:36,927 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:36,928 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [631] $Ultimate##0-->L1735: Formula: (let ((.cse0 (select |v_#pthreadsMutex_596| v_my_callbackThread1of1ForFork1_~data~0.base_438))) (and (= (store |v_#pthreadsMutex_596| v_my_callbackThread1of1ForFork1_~data~0.base_438 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_438 1)) |v_#pthreadsMutex_595|) (= |v_ULTIMATE.start_main_~#data~1#1.base_373| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_64|) (= v_my_callbackThread1of1ForFork1_~arg.offset_59 |v_my_callbackThread1of1ForFork1_#in~arg.offset_59|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_373| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_64|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_202| 0) (= v_~my_dev~0.offset_224 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_61) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_64| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_66|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_106| |v_ULTIMATE.start_main_~probe_ret~0#1_149|) (= (+ v_my_callbackThread1of1ForFork1_~data~0.offset_438 24) v_my_callbackThread1of1ForFork1_~__mptr~0.offset_61) (= (select |v_#valid_394| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_272|) 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_272| 0)) (= |v_#valid_393| (store |v_#valid_394| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_272| 1)) (= v_my_callbackThread1of1ForFork1_~arg.base_59 |v_my_callbackThread1of1ForFork1_#in~arg.base_59|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_64| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_66|) (= v_my_callbackThread1of1ForFork1_~data~0.base_438 v_my_callbackThread1of1ForFork1_~__mptr~0.base_61) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_139| (select (select |v_#memory_int_1208| |v_~#t1~0.base_96|) |v_~#t1~0.offset_96|)) (= (store |v_#length_224| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_272| 4) |v_#length_223|) (= |v_my_callbackThread1of1ForFork1_#t~nondet31_136| 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_149| 0) (< |v_#StackHeapBarrier_105| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_272|) (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_438) 0) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_61 v_~my_dev~0.base_224))) InVars {#pthreadsMutex=|v_#pthreadsMutex_596|, ~my_dev~0.base=v_~my_dev~0.base_224, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_373|, ~#t1~0.offset=|v_~#t1~0.offset_96|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_59|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_59|, #StackHeapBarrier=|v_#StackHeapBarrier_105|, ~#t1~0.base=|v_~#t1~0.base_96|, #valid=|v_#valid_394|, #memory_int=|v_#memory_int_1208|, #length=|v_#length_224|, ~my_dev~0.offset=v_~my_dev~0.offset_224, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_373|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_139|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_272|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_125|, ~#t1~0.offset=|v_~#t1~0.offset_96|, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_61, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_136|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_66|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_125|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_59|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_438, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_106|, ~#t1~0.base=|v_~#t1~0.base_96|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_135|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_231|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_149|, #length=|v_#length_223|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_94|, ~my_dev~0.offset=v_~my_dev~0.offset_224, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_64|, #pthreadsMutex=|v_#pthreadsMutex_595|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_66|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_231|, ~my_dev~0.base=v_~my_dev~0.base_224, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_59, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_373|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_195|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_59|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_202|, #StackHeapBarrier=|v_#StackHeapBarrier_105|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_438, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_59, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_64|, #valid=|v_#valid_393|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_125|, #memory_int=|v_#memory_int_1208|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_61, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_373|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, my_callbackThread1of1ForFork1_~__mptr~0.offset, 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, 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, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, #pthreadsMutex, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, my_callbackThread1of1ForFork1_~arg.base, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, my_callbackThread1of1ForFork1_~__mptr~0.base] and [406] 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_int_37| v_my_callbackThread1of1ForFork1_~data~0.base_17 (store (select |v_#memory_int_37| v_my_callbackThread1of1ForFork1_~data~0.base_17) .cse0 1)) |v_#memory_int_36|) (= (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|))) 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_37|, #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_36|, 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:48:37,258 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:48:37,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 560 [2022-12-06 06:48:37,259 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 288 flow [2022-12-06 06:48:37,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:37,259 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:37,259 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:37,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 06:48:37,259 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:37,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:37,260 INFO L85 PathProgramCache]: Analyzing trace with hash 943702348, now seen corresponding path program 1 times [2022-12-06 06:48:37,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:37,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805433206] [2022-12-06 06:48:37,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:37,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:37,939 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:37,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:37,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805433206] [2022-12-06 06:48:37,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805433206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:37,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:37,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:48:37,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196756552] [2022-12-06 06:48:37,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:37,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:48:37,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:37,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:48:37,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:48:37,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:48:37,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 288 flow. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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:37,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:37,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:48:37,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:38,147 INFO L130 PetriNetUnfolder]: 5/58 cut-off events. [2022-12-06 06:48:38,147 INFO L131 PetriNetUnfolder]: For 223/223 co-relation queries the response was YES. [2022-12-06 06:48:38,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 58 events. 5/58 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 155 event pairs, 2 based on Foata normal form. 1/58 useless extension candidates. Maximal degree in co-relation 208. Up to 41 conditions per place. [2022-12-06 06:48:38,148 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 28 selfloop transitions, 3 changer transitions 7/38 dead transitions. [2022-12-06 06:48:38,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 38 transitions, 393 flow [2022-12-06 06:48:38,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:48:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:48:38,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-12-06 06:48:38,148 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19254658385093168 [2022-12-06 06:48:38,149 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 288 flow. Second operand 7 states and 31 transitions. [2022-12-06 06:48:38,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 38 transitions, 393 flow [2022-12-06 06:48:38,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 331 flow, removed 13 selfloop flow, removed 9 redundant places. [2022-12-06 06:48:38,150 INFO L231 Difference]: Finished difference. Result has 50 places, 31 transitions, 221 flow [2022-12-06 06:48:38,150 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=221, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2022-12-06 06:48:38,150 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2022-12-06 06:48:38,150 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:38,150 INFO L89 Accepts]: Start accepts. Operand has 50 places, 31 transitions, 221 flow [2022-12-06 06:48:38,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:38,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:38,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 31 transitions, 221 flow [2022-12-06 06:48:38,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 31 transitions, 221 flow [2022-12-06 06:48:38,156 INFO L130 PetriNetUnfolder]: 4/49 cut-off events. [2022-12-06 06:48:38,156 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2022-12-06 06:48:38,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 49 events. 4/49 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 1 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 156. Up to 17 conditions per place. [2022-12-06 06:48:38,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 31 transitions, 221 flow [2022-12-06 06:48:38,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-06 06:48:38,157 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:48:38,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 06:48:38,158 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 221 flow [2022-12-06 06:48:38,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:38,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:38,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 06:48:38,158 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:38,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:38,158 INFO L85 PathProgramCache]: Analyzing trace with hash 863817626, now seen corresponding path program 1 times [2022-12-06 06:48:38,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:38,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394523058] [2022-12-06 06:48:38,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:38,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:39,020 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:39,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:39,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394523058] [2022-12-06 06:48:39,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394523058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:39,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:39,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:48:39,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142695770] [2022-12-06 06:48:39,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:39,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:48:39,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:39,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:48:39,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:48:39,022 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:48:39,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 221 flow. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:39,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:39,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:48:39,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:39,224 INFO L130 PetriNetUnfolder]: 5/50 cut-off events. [2022-12-06 06:48:39,225 INFO L131 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2022-12-06 06:48:39,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 50 events. 5/50 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 105 event pairs, 1 based on Foata normal form. 1/50 useless extension candidates. Maximal degree in co-relation 208. Up to 30 conditions per place. [2022-12-06 06:48:39,225 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 22 selfloop transitions, 2 changer transitions 11/35 dead transitions. [2022-12-06 06:48:39,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 35 transitions, 306 flow [2022-12-06 06:48:39,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:48:39,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:48:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-12-06 06:48:39,226 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19480519480519481 [2022-12-06 06:48:39,227 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 221 flow. Second operand 7 states and 30 transitions. [2022-12-06 06:48:39,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 35 transitions, 306 flow [2022-12-06 06:48:39,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 35 transitions, 294 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-06 06:48:39,228 INFO L231 Difference]: Finished difference. Result has 47 places, 24 transitions, 160 flow [2022-12-06 06:48:39,228 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=160, PETRI_PLACES=47, PETRI_TRANSITIONS=24} [2022-12-06 06:48:39,229 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2022-12-06 06:48:39,229 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:39,229 INFO L89 Accepts]: Start accepts. Operand has 47 places, 24 transitions, 160 flow [2022-12-06 06:48:39,229 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:39,230 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:39,230 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 24 transitions, 160 flow [2022-12-06 06:48:39,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 24 transitions, 160 flow [2022-12-06 06:48:39,238 INFO L130 PetriNetUnfolder]: 3/34 cut-off events. [2022-12-06 06:48:39,238 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-12-06 06:48:39,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 34 events. 3/34 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 82. Up to 12 conditions per place. [2022-12-06 06:48:39,239 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 24 transitions, 160 flow [2022-12-06 06:48:39,239 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 06:48:39,243 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:39,244 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-06 06:48:39,249 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 0)) (= |v_#valid_212| (store |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 1)) (= |v_ULTIMATE.start_main_~#data~1#1.base_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_100| 0) (< |v_#StackHeapBarrier_70| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_57| |v_ULTIMATE.start_main_~probe_ret~0#1_100|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|) (= (store |v_#length_154| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 4) |v_#length_153|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|) (= (select |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) 0) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46| (select (select |v_#memory_int_537| |v_~#t1~0.base_61|) |v_~#t1~0.offset_61|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_70|, ~#t1~0.base=|v_~#t1~0.base_61|, #valid=|v_#valid_213|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_217|, #memory_int=|v_#memory_int_537|, ~#t1~0.offset=|v_~#t1~0.offset_61|, #length=|v_#length_154|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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_101|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_74|, ~#t1~0.offset=|v_~#t1~0.offset_61|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|, 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_57|, ~#t1~0.base=|v_~#t1~0.base_61|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_82|, 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_100|, #length=|v_#length_153|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_45|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|, 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_217|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_64|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93|, #StackHeapBarrier=|v_#StackHeapBarrier_70|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|, #valid=|v_#valid_212|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_74|, #memory_int=|v_#memory_int_537|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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 [568] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_366| |v_ULTIMATE.start_main_~#data~1#1.base_139|))) (and (= |v_ULTIMATE.start_ldv_assert_~expression#1_187| 0) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_157| |v_ULTIMATE.start_ldv_assert_~expression#1_187|) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_139| 28)) |v_ULTIMATE.start_main_#t~mem47#1_63|) (= (store |v_#memory_int_367| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76| (store (select |v_#memory_int_367| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_68| (select (select |v_#memory_int_366| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_68|))) |v_#memory_int_366|) (= (store |v_#valid_173| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76| 0) |v_#valid_172|) (= (store |v_#memory_$Pointer$.offset_319| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76| (store (select |v_#memory_$Pointer$.offset_319| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_68| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_51|)) |v_#memory_$Pointer$.offset_318|) (not (= (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_139| 24)) 1) 1 0) 0)) (= (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_63|) 1 0) |v_ULTIMATE.start_ldv_assert_#in~expression#1_157|) (= (store |v_#memory_$Pointer$.base_319| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76| (store (select |v_#memory_$Pointer$.base_319| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_68| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_51|)) |v_#memory_$Pointer$.base_318|))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_68|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_319|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_51|, #valid=|v_#valid_173|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_51|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_139|, #memory_int=|v_#memory_int_367|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_319|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_139|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_187|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_318|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_63|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_139|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_42|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_157|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_67|, #valid=|v_#valid_172|, #memory_int=|v_#memory_int_366|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_318|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_139|} 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:39,435 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:39,436 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:39,437 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:39,437 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:39,533 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:39,533 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:39,534 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:39,535 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:39,536 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 0)) (= |v_#valid_212| (store |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 1)) (= |v_ULTIMATE.start_main_~#data~1#1.base_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_100| 0) (< |v_#StackHeapBarrier_70| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_57| |v_ULTIMATE.start_main_~probe_ret~0#1_100|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|) (= (store |v_#length_154| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 4) |v_#length_153|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|) (= (select |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) 0) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46| (select (select |v_#memory_int_537| |v_~#t1~0.base_61|) |v_~#t1~0.offset_61|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_70|, ~#t1~0.base=|v_~#t1~0.base_61|, #valid=|v_#valid_213|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_217|, #memory_int=|v_#memory_int_537|, ~#t1~0.offset=|v_~#t1~0.offset_61|, #length=|v_#length_154|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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_101|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_74|, ~#t1~0.offset=|v_~#t1~0.offset_61|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|, 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_57|, ~#t1~0.base=|v_~#t1~0.base_61|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_82|, 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_100|, #length=|v_#length_153|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_45|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|, 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_217|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_64|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93|, #StackHeapBarrier=|v_#StackHeapBarrier_70|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|, #valid=|v_#valid_212|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_74|, #memory_int=|v_#memory_int_537|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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 [593] L1711-1-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_215 28))) (and (= (store |v_#memory_$Pointer$.offset_686| v_my_callbackThread1of1ForFork0_~data~0.base_215 (store (select |v_#memory_$Pointer$.offset_686| v_my_callbackThread1of1ForFork0_~data~0.base_215) .cse0 (select (select |v_#memory_$Pointer$.offset_685| v_my_callbackThread1of1ForFork0_~data~0.base_215) .cse0))) |v_#memory_$Pointer$.offset_685|) (= |v_#memory_int_750| (store |v_#memory_int_751| v_my_callbackThread1of1ForFork0_~data~0.base_215 (let ((.cse1 (select |v_#memory_int_751| v_my_callbackThread1of1ForFork0_~data~0.base_215))) (store .cse1 .cse0 (+ (select .cse1 .cse0) 1))))) (= |v_my_callbackThread1of1ForFork0_#res.base_43| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_43| 0) (= (store |v_#pthreadsMutex_286| v_my_callbackThread1of1ForFork0_~data~0.base_215 (store (select |v_#pthreadsMutex_286| v_my_callbackThread1of1ForFork0_~data~0.base_215) v_my_callbackThread1of1ForFork0_~data~0.offset_215 0)) |v_#pthreadsMutex_285|) (= (store |v_#memory_$Pointer$.base_686| v_my_callbackThread1of1ForFork0_~data~0.base_215 (store (select |v_#memory_$Pointer$.base_686| v_my_callbackThread1of1ForFork0_~data~0.base_215) .cse0 (select (select |v_#memory_$Pointer$.base_685| v_my_callbackThread1of1ForFork0_~data~0.base_215) .cse0))) |v_#memory_$Pointer$.base_685|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_286|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_215, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_686|, #memory_int=|v_#memory_int_751|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_215, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_686|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_285|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_215, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_43|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_121|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_685|, #memory_int=|v_#memory_int_750|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_43|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_215, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_685|} 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:39,703 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:48:39,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 475 [2022-12-06 06:48:39,704 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 160 flow [2022-12-06 06:48:39,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:39,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:39,704 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:39,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 06:48:39,704 INFO L420 AbstractCegarLoop]: === Iteration 25 === 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:39,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:39,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1813081833, now seen corresponding path program 1 times [2022-12-06 06:48:39,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:39,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627692568] [2022-12-06 06:48:39,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:39,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:40,681 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:40,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:40,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627692568] [2022-12-06 06:48:40,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627692568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:40,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:40,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 06:48:40,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386199445] [2022-12-06 06:48:40,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:40,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 06:48:40,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:40,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 06:48:40,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 06:48:40,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:48:40,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 23 transitions, 160 flow. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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:40,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:40,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:48:40,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:41,013 INFO L130 PetriNetUnfolder]: 1/36 cut-off events. [2022-12-06 06:48:41,013 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-12-06 06:48:41,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 36 events. 1/36 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 0 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 117. Up to 18 conditions per place. [2022-12-06 06:48:41,014 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 16 selfloop transitions, 7 changer transitions 7/30 dead transitions. [2022-12-06 06:48:41,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 30 transitions, 247 flow [2022-12-06 06:48:41,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:48:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:48:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2022-12-06 06:48:41,015 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17763157894736842 [2022-12-06 06:48:41,015 INFO L175 Difference]: Start difference. First operand has 40 places, 23 transitions, 160 flow. Second operand 8 states and 27 transitions. [2022-12-06 06:48:41,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 30 transitions, 247 flow [2022-12-06 06:48:41,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 195 flow, removed 7 selfloop flow, removed 13 redundant places. [2022-12-06 06:48:41,016 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 126 flow [2022-12-06 06:48:41,016 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=126, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2022-12-06 06:48:41,017 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2022-12-06 06:48:41,017 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:41,017 INFO L89 Accepts]: Start accepts. Operand has 37 places, 22 transitions, 126 flow [2022-12-06 06:48:41,017 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:41,017 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:41,017 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 22 transitions, 126 flow [2022-12-06 06:48:41,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 22 transitions, 126 flow [2022-12-06 06:48:41,023 INFO L130 PetriNetUnfolder]: 1/29 cut-off events. [2022-12-06 06:48:41,023 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 06:48:41,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 29 events. 1/29 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 73. Up to 9 conditions per place. [2022-12-06 06:48:41,023 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 22 transitions, 126 flow [2022-12-06 06:48:41,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 06:48:41,024 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [637] $Ultimate##0-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_444 24)) (.cse1 (select |v_#pthreadsMutex_610| v_my_callbackThread1of1ForFork1_~data~0.base_444))) (and (= (store |v_#memory_$Pointer$.base_1180| v_my_callbackThread1of1ForFork1_~data~0.base_444 (store (select |v_#memory_$Pointer$.base_1180| v_my_callbackThread1of1ForFork1_~data~0.base_444) .cse0 (select (select |v_#memory_$Pointer$.base_1179| v_my_callbackThread1of1ForFork1_~data~0.base_444) .cse0))) |v_#memory_$Pointer$.base_1179|) (= .cse0 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_67) (= |v_#memory_int_1230| (store |v_#memory_int_1231| v_my_callbackThread1of1ForFork1_~data~0.base_444 (store (select |v_#memory_int_1231| v_my_callbackThread1of1ForFork1_~data~0.base_444) .cse0 1))) (= v_my_callbackThread1of1ForFork1_~arg.base_65 |v_my_callbackThread1of1ForFork1_#in~arg.base_65|) (= v_~my_dev~0.offset_230 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_67) (= (store |v_#memory_$Pointer$.offset_1180| v_my_callbackThread1of1ForFork1_~data~0.base_444 (store (select |v_#memory_$Pointer$.offset_1180| v_my_callbackThread1of1ForFork1_~data~0.base_444) .cse0 (select (select |v_#memory_$Pointer$.offset_1179| v_my_callbackThread1of1ForFork1_~data~0.base_444) .cse0))) |v_#memory_$Pointer$.offset_1179|) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_67 v_~my_dev~0.base_230) (= v_my_callbackThread1of1ForFork1_~arg.offset_65 |v_my_callbackThread1of1ForFork1_#in~arg.offset_65|) (= (select .cse1 v_my_callbackThread1of1ForFork1_~data~0.offset_444) 0) (= |v_#pthreadsMutex_609| (store |v_#pthreadsMutex_610| v_my_callbackThread1of1ForFork1_~data~0.base_444 (store .cse1 v_my_callbackThread1of1ForFork1_~data~0.offset_444 1))) (= v_my_callbackThread1of1ForFork1_~data~0.base_444 v_my_callbackThread1of1ForFork1_~__mptr~0.base_67))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_65|, #pthreadsMutex=|v_#pthreadsMutex_610|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1180|, ~my_dev~0.base=v_~my_dev~0.base_230, #memory_int=|v_#memory_int_1231|, ~my_dev~0.offset=v_~my_dev~0.offset_230, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1180|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_65|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_609|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1179|, ~my_dev~0.base=v_~my_dev~0.base_230, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_65, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_67, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_144|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_65|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_65|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_444, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_444, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_65, #memory_int=|v_#memory_int_1230|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_67, ~my_dev~0.offset=v_~my_dev~0.offset_230, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1179|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, #memory_$Pointer$.base, my_callbackThread1of1ForFork1_~arg.base, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_#t~nondet31, #memory_$Pointer$.offset] and [571] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 0)) (= |v_#valid_212| (store |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 1)) (= |v_ULTIMATE.start_main_~#data~1#1.base_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_100| 0) (< |v_#StackHeapBarrier_70| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_57| |v_ULTIMATE.start_main_~probe_ret~0#1_100|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|) (= (store |v_#length_154| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 4) |v_#length_153|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|) (= (select |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) 0) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46| (select (select |v_#memory_int_537| |v_~#t1~0.base_61|) |v_~#t1~0.offset_61|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_70|, ~#t1~0.base=|v_~#t1~0.base_61|, #valid=|v_#valid_213|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_217|, #memory_int=|v_#memory_int_537|, ~#t1~0.offset=|v_~#t1~0.offset_61|, #length=|v_#length_154|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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_101|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_74|, ~#t1~0.offset=|v_~#t1~0.offset_61|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|, 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_57|, ~#t1~0.base=|v_~#t1~0.base_61|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_82|, 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_100|, #length=|v_#length_153|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_45|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|, 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_217|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_64|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93|, #StackHeapBarrier=|v_#StackHeapBarrier_70|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|, #valid=|v_#valid_212|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_74|, #memory_int=|v_#memory_int_537|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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] [2022-12-06 06:48:41,316 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:41,317 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:41,318 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:41,318 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:41,319 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [639] $Ultimate##0-->L1735: Formula: (let ((.cse1 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_446 24)) (.cse0 (select |v_#pthreadsMutex_618| v_my_callbackThread1of1ForFork1_~data~0.base_446))) (and (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_446) 0) (= (store |v_#memory_$Pointer$.offset_1190| v_my_callbackThread1of1ForFork1_~data~0.base_446 (store (select |v_#memory_$Pointer$.offset_1190| v_my_callbackThread1of1ForFork1_~data~0.base_446) .cse1 (select (select |v_#memory_$Pointer$.offset_1189| v_my_callbackThread1of1ForFork1_~data~0.base_446) .cse1))) |v_#memory_$Pointer$.offset_1189|) (= |v_ULTIMATE.start_main_~#data~1#1.base_381| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_72|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_381| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_72|) (= (select |v_#valid_412| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_286|) 0) (= v_~my_dev~0.offset_232 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_69) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_69 v_~my_dev~0.base_232) (= (store |v_#length_240| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_286| 4) |v_#length_239|) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_286| 0)) (= v_my_callbackThread1of1ForFork1_~arg.offset_67 |v_my_callbackThread1of1ForFork1_#in~arg.offset_67|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_151| (select (select |v_#memory_int_1238| |v_~#t1~0.base_104|) |v_~#t1~0.offset_104|)) (= v_my_callbackThread1of1ForFork1_~__mptr~0.offset_69 .cse1) (= (store |v_#memory_$Pointer$.base_1190| v_my_callbackThread1of1ForFork1_~data~0.base_446 (store (select |v_#memory_$Pointer$.base_1190| v_my_callbackThread1of1ForFork1_~data~0.base_446) .cse1 (select (select |v_#memory_$Pointer$.base_1189| v_my_callbackThread1of1ForFork1_~data~0.base_446) .cse1))) |v_#memory_$Pointer$.base_1189|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_216| 0) (= v_my_callbackThread1of1ForFork1_~arg.base_67 |v_my_callbackThread1of1ForFork1_#in~arg.base_67|) (= (store |v_#memory_int_1239| v_my_callbackThread1of1ForFork1_~data~0.base_446 (store (select |v_#memory_int_1239| v_my_callbackThread1of1ForFork1_~data~0.base_446) .cse1 1)) |v_#memory_int_1238|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_114| |v_ULTIMATE.start_main_~probe_ret~0#1_157|) (= v_my_callbackThread1of1ForFork1_~data~0.base_446 v_my_callbackThread1of1ForFork1_~__mptr~0.base_69) (= |v_ULTIMATE.start_main_~probe_ret~0#1_157| 0) (= |v_#valid_411| (store |v_#valid_412| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_286| 1)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_72| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_74|) (< |v_#StackHeapBarrier_113| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_286|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_72| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_74|) (= (store |v_#pthreadsMutex_618| v_my_callbackThread1of1ForFork1_~data~0.base_446 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_446 1)) |v_#pthreadsMutex_617|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_618|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1190|, ~my_dev~0.base=v_~my_dev~0.base_232, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_381|, ~#t1~0.offset=|v_~#t1~0.offset_104|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_67|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_67|, #StackHeapBarrier=|v_#StackHeapBarrier_113|, ~#t1~0.base=|v_~#t1~0.base_104|, #valid=|v_#valid_412|, #memory_int=|v_#memory_int_1239|, #length=|v_#length_240|, ~my_dev~0.offset=v_~my_dev~0.offset_232, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1190|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_381|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_151|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_286|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1189|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_135|, ~#t1~0.offset=|v_~#t1~0.offset_104|, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_69, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_148|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_74|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_133|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_67|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_446, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_114|, ~#t1~0.base=|v_~#t1~0.base_104|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_143|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_247|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_157|, #length=|v_#length_239|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_102|, ~my_dev~0.offset=v_~my_dev~0.offset_232, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_72|, #pthreadsMutex=|v_#pthreadsMutex_617|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_74|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_247|, ~my_dev~0.base=v_~my_dev~0.base_232, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_67, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_381|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_209|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_67|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_216|, #StackHeapBarrier=|v_#StackHeapBarrier_113|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_446, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_67, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_72|, #valid=|v_#valid_411|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_135|, #memory_int=|v_#memory_int_1238|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_69, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1189|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_381|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, my_callbackThread1of1ForFork1_~__mptr~0.offset, 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, 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, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, #pthreadsMutex, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, my_callbackThread1of1ForFork1_~arg.base, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.base, #memory_$Pointer$.offset] and [629] L1711-1-->my_callbackEXIT: Formula: (let ((.cse1 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_426 28))) (and (= |v_my_callbackThread1of1ForFork1_#res.offset_132| 0) (= |v_#pthreadsMutex_579| (store |v_#pthreadsMutex_580| v_my_callbackThread1of1ForFork1_~data~0.base_426 (store (select |v_#pthreadsMutex_580| v_my_callbackThread1of1ForFork1_~data~0.base_426) v_my_callbackThread1of1ForFork1_~data~0.offset_426 0))) (= |v_#memory_int_1185| (store |v_#memory_int_1186| v_my_callbackThread1of1ForFork1_~data~0.base_426 (let ((.cse0 (select |v_#memory_int_1186| v_my_callbackThread1of1ForFork1_~data~0.base_426))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))))) (= |v_my_callbackThread1of1ForFork1_#res.base_132| 0) (= |v_#memory_$Pointer$.base_1125| (store |v_#memory_$Pointer$.base_1126| v_my_callbackThread1of1ForFork1_~data~0.base_426 (store (select |v_#memory_$Pointer$.base_1126| v_my_callbackThread1of1ForFork1_~data~0.base_426) .cse1 (select (select |v_#memory_$Pointer$.base_1125| v_my_callbackThread1of1ForFork1_~data~0.base_426) .cse1)))) (= (store |v_#memory_$Pointer$.offset_1126| v_my_callbackThread1of1ForFork1_~data~0.base_426 (store (select |v_#memory_$Pointer$.offset_1126| v_my_callbackThread1of1ForFork1_~data~0.base_426) .cse1 (select (select |v_#memory_$Pointer$.offset_1125| v_my_callbackThread1of1ForFork1_~data~0.base_426) .cse1))) |v_#memory_$Pointer$.offset_1125|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_580|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_426, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_426, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1126|, #memory_int=|v_#memory_int_1186|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1126|} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_396|, #pthreadsMutex=|v_#pthreadsMutex_579|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_426, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_132|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_426, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1125|, #memory_int=|v_#memory_int_1185|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_132|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1125|} 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:42,277 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:42,278 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:42,279 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:42,280 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:42,281 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [640] $Ultimate##0-->my_callbackEXIT: Formula: (let ((.cse4 (select |v_#memory_int_1244| v_my_callbackThread1of1ForFork1_~data~0.base_448)) (.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_448 24))) (let ((.cse2 (store .cse4 .cse0 1)) (.cse1 (select |v_#memory_$Pointer$.base_1194| v_my_callbackThread1of1ForFork1_~data~0.base_448)) (.cse5 (select |v_#memory_$Pointer$.offset_1194| v_my_callbackThread1of1ForFork1_~data~0.base_448)) (.cse3 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_448 28)) (.cse6 (select |v_#pthreadsMutex_623| v_my_callbackThread1of1ForFork1_~data~0.base_448))) (and (= v_my_callbackThread1of1ForFork1_~arg.base_69 |v_my_callbackThread1of1ForFork1_#in~arg.base_69|) (= (store |v_#memory_$Pointer$.base_1195| v_my_callbackThread1of1ForFork1_~data~0.base_448 (store (select |v_#memory_$Pointer$.base_1195| v_my_callbackThread1of1ForFork1_~data~0.base_448) .cse0 (select .cse1 .cse0))) |v_#memory_$Pointer$.base_1194|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_153| (select (select (store |v_#memory_int_1244| v_my_callbackThread1of1ForFork1_~data~0.base_448 .cse2) |v_~#t1~0.base_106|) |v_~#t1~0.offset_106|)) (= |v_ULTIMATE.start_main_~probe_ret~0#1_159| 0) (= .cse0 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_71) (= |v_#length_243| (store |v_#length_244| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_288| 4)) (= (select |v_#valid_416| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_288|) 0) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_218| 0) (= (store |v_#memory_int_1244| v_my_callbackThread1of1ForFork1_~data~0.base_448 (store .cse2 .cse3 (+ (select .cse4 .cse3) 1))) |v_#memory_int_1242|) (= v_my_callbackThread1of1ForFork1_~data~0.base_448 v_my_callbackThread1of1ForFork1_~__mptr~0.base_71) (= (store |v_#memory_$Pointer$.offset_1195| v_my_callbackThread1of1ForFork1_~data~0.base_448 (store (select |v_#memory_$Pointer$.offset_1195| v_my_callbackThread1of1ForFork1_~data~0.base_448) .cse0 (select .cse5 .cse0))) |v_#memory_$Pointer$.offset_1194|) (= |v_my_callbackThread1of1ForFork1_#res.offset_139| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_74| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_76|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_116| |v_ULTIMATE.start_main_~probe_ret~0#1_159|) (= v_~my_dev~0.offset_234 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_71) (= |v_#memory_$Pointer$.base_1193| (store |v_#memory_$Pointer$.base_1194| v_my_callbackThread1of1ForFork1_~data~0.base_448 (store .cse1 .cse3 (select (select |v_#memory_$Pointer$.base_1193| v_my_callbackThread1of1ForFork1_~data~0.base_448) .cse3)))) (= |v_#memory_$Pointer$.offset_1193| (store |v_#memory_$Pointer$.offset_1194| v_my_callbackThread1of1ForFork1_~data~0.base_448 (store .cse5 .cse3 (select (select |v_#memory_$Pointer$.offset_1193| v_my_callbackThread1of1ForFork1_~data~0.base_448) .cse3)))) (= (store |v_#valid_416| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_288| 1) |v_#valid_415|) (= |v_#pthreadsMutex_621| (store |v_#pthreadsMutex_623| v_my_callbackThread1of1ForFork1_~data~0.base_448 (store .cse6 v_my_callbackThread1of1ForFork1_~data~0.offset_448 0))) (= (select .cse6 v_my_callbackThread1of1ForFork1_~data~0.offset_448) 0) (= |v_ULTIMATE.start_main_~#data~1#1.base_383| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_74|) (< |v_#StackHeapBarrier_115| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_288|) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_288| 0)) (= |v_my_callbackThread1of1ForFork1_#res.base_139| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_74| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_76|) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_71 v_~my_dev~0.base_234) (= |v_ULTIMATE.start_main_~#data~1#1.offset_383| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_74|) (= v_my_callbackThread1of1ForFork1_~arg.offset_69 |v_my_callbackThread1of1ForFork1_#in~arg.offset_69|)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_623|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1195|, ~my_dev~0.base=v_~my_dev~0.base_234, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_383|, ~#t1~0.offset=|v_~#t1~0.offset_106|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_69|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_69|, #StackHeapBarrier=|v_#StackHeapBarrier_115|, ~#t1~0.base=|v_~#t1~0.base_106|, #valid=|v_#valid_416|, #memory_int=|v_#memory_int_1244|, #length=|v_#length_244|, ~my_dev~0.offset=v_~my_dev~0.offset_234, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1195|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_383|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_153|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1193|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_288|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_137|, ~#t1~0.offset=|v_~#t1~0.offset_106|, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_71, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_150|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_76|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_135|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_69|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_448, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_139|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_116|, ~#t1~0.base=|v_~#t1~0.base_106|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_145|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_249|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_159|, #length=|v_#length_243|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_104|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_139|, ~my_dev~0.offset=v_~my_dev~0.offset_234, my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_405|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_74|, #pthreadsMutex=|v_#pthreadsMutex_621|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_76|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_249|, ~my_dev~0.base=v_~my_dev~0.base_234, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_69, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_383|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_211|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_69|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_448, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_218|, #StackHeapBarrier=|v_#StackHeapBarrier_115|, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_69, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_74|, #valid=|v_#valid_415|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_137|, #memory_int=|v_#memory_int_1242|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_71, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1193|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_383|} AuxVars[|v_#memory_$Pointer$.base_1194|, |v_#memory_$Pointer$.offset_1194|] 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_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, 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, my_callbackThread1of1ForFork1_#t~mem32, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, #pthreadsMutex, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, my_callbackThread1of1ForFork1_~arg.base, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, my_callbackThread1of1ForFork1_~data~0.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, my_callbackThread1of1ForFork1_~arg.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.base, #memory_$Pointer$.offset] and [599] $Ultimate##0-->L1711-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_314| v_my_callbackThread1of1ForFork0_~data~0.base_217)) (.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_217 24))) (and (= v_my_callbackThread1of1ForFork0_~__mptr~0.base_40 v_~my_dev~0.base_114) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_40 v_~my_dev~0.offset_114) (= (select .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_217) 0) (= (store |v_#memory_int_779| v_my_callbackThread1of1ForFork0_~data~0.base_217 (store (select |v_#memory_int_779| v_my_callbackThread1of1ForFork0_~data~0.base_217) .cse1 1)) |v_#memory_int_778|) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_40 .cse1) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_26| v_my_callbackThread1of1ForFork0_~arg.base_26) (= (store |v_#memory_$Pointer$.offset_716| v_my_callbackThread1of1ForFork0_~data~0.base_217 (store (select |v_#memory_$Pointer$.offset_716| v_my_callbackThread1of1ForFork0_~data~0.base_217) .cse1 (select (select |v_#memory_$Pointer$.offset_715| v_my_callbackThread1of1ForFork0_~data~0.base_217) .cse1))) |v_#memory_$Pointer$.offset_715|) (= (store |v_#pthreadsMutex_314| v_my_callbackThread1of1ForFork0_~data~0.base_217 (store .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_217 1)) |v_#pthreadsMutex_313|) (= v_my_callbackThread1of1ForFork0_~data~0.base_217 v_my_callbackThread1of1ForFork0_~__mptr~0.base_40) (= (store |v_#memory_$Pointer$.base_716| v_my_callbackThread1of1ForFork0_~data~0.base_217 (store (select |v_#memory_$Pointer$.base_716| v_my_callbackThread1of1ForFork0_~data~0.base_217) .cse1 (select (select |v_#memory_$Pointer$.base_715| v_my_callbackThread1of1ForFork0_~data~0.base_217) .cse1))) |v_#memory_$Pointer$.base_715|) (= v_my_callbackThread1of1ForFork0_~arg.offset_26 |v_my_callbackThread1of1ForFork0_#in~arg.offset_26|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_314|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_716|, ~my_dev~0.base=v_~my_dev~0.base_114, #memory_int=|v_#memory_int_779|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_26|, ~my_dev~0.offset=v_~my_dev~0.offset_114, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_716|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_313|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_715|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_26, ~my_dev~0.base=v_~my_dev~0.base_114, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_26|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_67|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_40, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_217, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_217, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_26|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_26, #memory_int=|v_#memory_int_778|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_40, ~my_dev~0.offset=v_~my_dev~0.offset_114, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_715|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_~data~0.offset, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~data~0.base, #memory_$Pointer$.offset] [2022-12-06 06:48:49,411 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:48:49,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8395 [2022-12-06 06:48:49,412 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 133 flow [2022-12-06 06:48:49,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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:49,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:48:49,413 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:48:49,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 06:48:49,413 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:49,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:48:49,413 INFO L85 PathProgramCache]: Analyzing trace with hash -256047482, now seen corresponding path program 1 times [2022-12-06 06:48:49,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:48:49,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480702968] [2022-12-06 06:48:49,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:48:49,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:48:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:48:50,181 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:50,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:48:50,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480702968] [2022-12-06 06:48:50,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480702968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:48:50,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:48:50,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:48:50,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586595449] [2022-12-06 06:48:50,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:48:50,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:48:50,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:48:50,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:48:50,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:48:50,183 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:48:50,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 133 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:48:50,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:48:50,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:48:50,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:48:50,302 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-06 06:48:50,302 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-06 06:48:50,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 27 events. 0/27 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 1/27 useless extension candidates. Maximal degree in co-relation 0. Up to 18 conditions per place. [2022-12-06 06:48:50,303 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 16 selfloop transitions, 2 changer transitions 6/24 dead transitions. [2022-12-06 06:48:50,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 24 transitions, 184 flow [2022-12-06 06:48:50,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:48:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:48:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-12-06 06:48:50,305 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25263157894736843 [2022-12-06 06:48:50,305 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 133 flow. Second operand 5 states and 24 transitions. [2022-12-06 06:48:50,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 24 transitions, 184 flow [2022-12-06 06:48:50,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 150 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-06 06:48:50,306 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 82 flow [2022-12-06 06:48:50,306 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2022-12-06 06:48:50,306 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -6 predicate places. [2022-12-06 06:48:50,306 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:48:50,306 INFO L89 Accepts]: Start accepts. Operand has 33 places, 18 transitions, 82 flow [2022-12-06 06:48:50,306 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:48:50,306 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:48:50,306 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 18 transitions, 82 flow [2022-12-06 06:48:50,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 18 transitions, 82 flow [2022-12-06 06:48:50,309 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 06:48:50,309 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 06:48:50,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 21 events. 0/21 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2022-12-06 06:48:50,310 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 18 transitions, 82 flow [2022-12-06 06:48:50,310 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 06:48:50,322 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:50,322 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:50,323 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:50,324 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:50,324 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L1710-1-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_43 24))) (and (= (store |v_#memory_$Pointer$.offset_93| v_my_callbackThread1of1ForFork0_~data~0.base_43 (store (select |v_#memory_$Pointer$.offset_93| v_my_callbackThread1of1ForFork0_~data~0.base_43) .cse0 (select (select |v_#memory_$Pointer$.offset_92| v_my_callbackThread1of1ForFork0_~data~0.base_43) .cse0))) |v_#memory_$Pointer$.offset_92|) (= (store |v_#memory_int_129| v_my_callbackThread1of1ForFork0_~data~0.base_43 (store (select |v_#memory_int_129| v_my_callbackThread1of1ForFork0_~data~0.base_43) .cse0 1)) |v_#memory_int_128|) (= (store |v_#memory_$Pointer$.base_93| v_my_callbackThread1of1ForFork0_~data~0.base_43 (store (select |v_#memory_$Pointer$.base_93| v_my_callbackThread1of1ForFork0_~data~0.base_43) .cse0 (select (select |v_#memory_$Pointer$.base_92| v_my_callbackThread1of1ForFork0_~data~0.base_43) .cse0))) |v_#memory_$Pointer$.base_92|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_43, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_93|, #memory_int=|v_#memory_int_129|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_43, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_93|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_43, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_92|, #memory_int=|v_#memory_int_128|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_17|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_43, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_92|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#t~nondet31, #memory_$Pointer$.offset] and [638] L1727-4-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_269 28))) (and (= |v_my_callbackThread1of1ForFork0_#res.base_63| 0) (= |v_ULTIMATE.start_main_~#data~1#1.offset_379| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_70|) (= (store |v_#pthreadsMutex_614| v_my_callbackThread1of1ForFork0_~data~0.base_261 (store (select |v_#pthreadsMutex_614| v_my_callbackThread1of1ForFork0_~data~0.base_261) v_my_callbackThread1of1ForFork0_~data~0.offset_269 0)) |v_#pthreadsMutex_613|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_70| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_72|) (= |v_my_callbackThread1of1ForFork0_#res.offset_63| 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_155| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_70| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_72|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_214| 0) (= (select |v_#valid_408| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_284|) 0) (= (store |v_#memory_$Pointer$.base_1184| v_my_callbackThread1of1ForFork0_~data~0.base_261 (store (select |v_#memory_$Pointer$.base_1184| v_my_callbackThread1of1ForFork0_~data~0.base_261) .cse0 (select (select |v_#memory_$Pointer$.base_1183| v_my_callbackThread1of1ForFork0_~data~0.base_261) .cse0))) |v_#memory_$Pointer$.base_1183|) (= |v_ULTIMATE.start_main_~#data~1#1.base_379| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_70|) (< |v_#StackHeapBarrier_111| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_284|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_112| |v_ULTIMATE.start_main_~probe_ret~0#1_155|) (= (store |v_#valid_408| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_284| 1) |v_#valid_407|) (= (store |v_#length_236| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_284| 4) |v_#length_235|) (= (store |v_#memory_int_1235| v_my_callbackThread1of1ForFork0_~data~0.base_261 (let ((.cse1 (select |v_#memory_int_1235| v_my_callbackThread1of1ForFork0_~data~0.base_261))) (store .cse1 .cse0 (+ (select .cse1 .cse0) 1)))) |v_#memory_int_1234|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_149| (select (select |v_#memory_int_1235| |v_~#t1~0.base_102|) |v_~#t1~0.offset_102|)) (= (store |v_#memory_$Pointer$.offset_1184| v_my_callbackThread1of1ForFork0_~data~0.base_261 (store (select |v_#memory_$Pointer$.offset_1184| v_my_callbackThread1of1ForFork0_~data~0.base_261) .cse0 (select (select |v_#memory_$Pointer$.offset_1183| v_my_callbackThread1of1ForFork0_~data~0.base_261) .cse0))) |v_#memory_$Pointer$.offset_1183|) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_284| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_614|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1184|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_379|, ~#t1~0.offset=|v_~#t1~0.offset_102|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_261, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_269, #StackHeapBarrier=|v_#StackHeapBarrier_111|, ~#t1~0.base=|v_~#t1~0.base_102|, #valid=|v_#valid_408|, #memory_int=|v_#memory_int_1235|, #length=|v_#length_236|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1184|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_379|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_149|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1183|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_284|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_133|, ~#t1~0.offset=|v_~#t1~0.offset_102|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_261, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_72|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_131|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_269, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_112|, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_63|, ~#t1~0.base=|v_~#t1~0.base_102|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_141|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_245|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_155|, #length=|v_#length_235|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_100|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_63|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_70|, #pthreadsMutex=|v_#pthreadsMutex_613|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_143|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_72|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_245|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_379|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_207|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_214|, #StackHeapBarrier=|v_#StackHeapBarrier_111|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_70|, #valid=|v_#valid_407|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_133|, #memory_int=|v_#memory_int_1234|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1183|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_379|} 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:50,849 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:50,852 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2022-12-06 06:48:50,855 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:50,855 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:50,857 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:50,857 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:50,858 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:50,859 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:50,859 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L1727-4-->L1735: Formula: (and (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 0)) (= |v_#valid_212| (store |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 1)) (= |v_ULTIMATE.start_main_~#data~1#1.base_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_100| 0) (< |v_#StackHeapBarrier_70| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_57| |v_ULTIMATE.start_main_~probe_ret~0#1_100|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|) (= (store |v_#length_154| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101| 4) |v_#length_153|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_217| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|) (= (select |v_#valid_213| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_101|) 0) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_46| (select (select |v_#memory_int_537| |v_~#t1~0.base_61|) |v_~#t1~0.offset_61|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_70|, ~#t1~0.base=|v_~#t1~0.base_61|, #valid=|v_#valid_213|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_217|, #memory_int=|v_#memory_int_537|, ~#t1~0.offset=|v_~#t1~0.offset_61|, #length=|v_#length_154|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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_101|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_74|, ~#t1~0.offset=|v_~#t1~0.offset_61|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_31|, 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_57|, ~#t1~0.base=|v_~#t1~0.base_61|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_82|, 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_100|, #length=|v_#length_153|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_45|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_31|, 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_217|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_64|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_93|, #StackHeapBarrier=|v_#StackHeapBarrier_70|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_29|, #valid=|v_#valid_212|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_74|, #memory_int=|v_#memory_int_537|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_217|} 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 [643] L1710-1-->my_callbackEXIT: Formula: (let ((.cse3 (select |v_#memory_$Pointer$.offset_1218| v_my_callbackThread1of1ForFork0_~data~0.base_267)) (.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_275 28)) (.cse0 (select |v_#memory_$Pointer$.base_1218| v_my_callbackThread1of1ForFork0_~data~0.base_267)) (.cse2 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_275 24))) (and (= (store |v_#memory_$Pointer$.base_1218| v_my_callbackThread1of1ForFork0_~data~0.base_267 (store .cse0 .cse1 (select (select |v_#memory_$Pointer$.base_1217| v_my_callbackThread1of1ForFork0_~data~0.base_267) .cse1))) |v_#memory_$Pointer$.base_1217|) (= (store |v_#memory_$Pointer$.offset_1219| v_my_callbackThread1of1ForFork0_~data~0.base_267 (store (select |v_#memory_$Pointer$.offset_1219| v_my_callbackThread1of1ForFork0_~data~0.base_267) .cse2 (select .cse3 .cse2))) |v_#memory_$Pointer$.offset_1218|) (= (store |v_#memory_$Pointer$.offset_1218| v_my_callbackThread1of1ForFork0_~data~0.base_267 (store .cse3 .cse1 (select (select |v_#memory_$Pointer$.offset_1217| v_my_callbackThread1of1ForFork0_~data~0.base_267) .cse1))) |v_#memory_$Pointer$.offset_1217|) (= (store |v_#pthreadsMutex_638| v_my_callbackThread1of1ForFork0_~data~0.base_267 (store (select |v_#pthreadsMutex_638| v_my_callbackThread1of1ForFork0_~data~0.base_267) v_my_callbackThread1of1ForFork0_~data~0.offset_275 0)) |v_#pthreadsMutex_637|) (= |v_my_callbackThread1of1ForFork0_#res.base_67| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_67| 0) (= |v_#memory_int_1260| (store |v_#memory_int_1262| v_my_callbackThread1of1ForFork0_~data~0.base_267 (let ((.cse4 (select |v_#memory_int_1262| v_my_callbackThread1of1ForFork0_~data~0.base_267))) (store (store .cse4 .cse2 1) .cse1 (+ (select .cse4 .cse1) 1))))) (= (store |v_#memory_$Pointer$.base_1219| v_my_callbackThread1of1ForFork0_~data~0.base_267 (store (select |v_#memory_$Pointer$.base_1219| v_my_callbackThread1of1ForFork0_~data~0.base_267) .cse2 (select .cse0 .cse2))) |v_#memory_$Pointer$.base_1218|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_638|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_275, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1219|, #memory_int=|v_#memory_int_1262|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_267, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1219|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_637|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_275, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_67|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_147|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1217|, #memory_int=|v_#memory_int_1260|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_87|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_67|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_267, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1217|} AuxVars[|v_#memory_$Pointer$.base_1218|, |v_#memory_$Pointer$.offset_1218|] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] [2022-12-06 06:48:51,219 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:51,220 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:51,221 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:48:51,221 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:48:51,505 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_86| v_my_callbackThread1of1ForFork0_~data~0.base_51))) (and (= v_~my_dev~0.offset_28 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_21) (= (select .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_51) 0) (= |v_#pthreadsMutex_85| (store |v_#pthreadsMutex_86| v_my_callbackThread1of1ForFork0_~data~0.base_51 (store .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_51 1))) (= v_my_callbackThread1of1ForFork0_~data~0.base_51 v_my_callbackThread1of1ForFork0_~__mptr~0.base_21) (= v_my_callbackThread1of1ForFork0_~__mptr~0.base_21 v_~my_dev~0.base_28) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_7| v_my_callbackThread1of1ForFork0_~arg.base_7) (= (+ v_my_callbackThread1of1ForFork0_~data~0.offset_51 24) v_my_callbackThread1of1ForFork0_~__mptr~0.offset_21) (= v_my_callbackThread1of1ForFork0_~arg.offset_7 |v_my_callbackThread1of1ForFork0_#in~arg.offset_7|) (= |v_my_callbackThread1of1ForFork0_#t~nondet31_23| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_86|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_7|, ~my_dev~0.base=v_~my_dev~0.base_28, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_7|, ~my_dev~0.offset=v_~my_dev~0.offset_28} OutVars{#pthreadsMutex=|v_#pthreadsMutex_85|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_51, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_7|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_7, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_7, ~my_dev~0.base=v_~my_dev~0.base_28, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_7|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_23|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_21, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_21, ~my_dev~0.offset=v_~my_dev~0.offset_28, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_51} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_~arg.offset, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base] and [644] L1727-4-->my_callbackEXIT: Formula: (let ((.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_277 24)) (.cse4 (select |v_#memory_$Pointer$.base_1226| v_my_callbackThread1of1ForFork0_~data~0.base_269)) (.cse3 (select |v_#memory_$Pointer$.offset_1226| v_my_callbackThread1of1ForFork0_~data~0.base_269)) (.cse2 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_277 28))) (and (= |v_my_callbackThread1of1ForFork0_#res.offset_69| 0) (= |v_my_callbackThread1of1ForFork0_#res.base_69| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_80| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_82|) (< |v_#StackHeapBarrier_121| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_294|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_122| |v_ULTIMATE.start_main_~probe_ret~0#1_165|) (= (store |v_#length_256| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_294| 4) |v_#length_255|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_389| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_80|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_165| 0) (= |v_#memory_int_1266| (store |v_#memory_int_1267| v_my_callbackThread1of1ForFork0_~data~0.base_269 (let ((.cse0 (select |v_#memory_int_1267| v_my_callbackThread1of1ForFork0_~data~0.base_269))) (store (store .cse0 .cse1 1) .cse2 (+ (select .cse0 .cse2) 1))))) (= (store |v_#memory_$Pointer$.offset_1225| v_my_callbackThread1of1ForFork0_~data~0.base_269 (store (select |v_#memory_$Pointer$.offset_1225| v_my_callbackThread1of1ForFork0_~data~0.base_269) .cse1 (select .cse3 .cse1))) |v_#memory_$Pointer$.offset_1226|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_80| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_82|) (= (store |v_#memory_$Pointer$.base_1225| v_my_callbackThread1of1ForFork0_~data~0.base_269 (store (select |v_#memory_$Pointer$.base_1225| v_my_callbackThread1of1ForFork0_~data~0.base_269) .cse1 (select .cse4 .cse1))) |v_#memory_$Pointer$.base_1226|) (= |v_#valid_427| (store |v_#valid_428| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_294| 1)) (= (store |v_#pthreadsMutex_642| v_my_callbackThread1of1ForFork0_~data~0.base_269 (store (select |v_#pthreadsMutex_642| v_my_callbackThread1of1ForFork0_~data~0.base_269) v_my_callbackThread1of1ForFork0_~data~0.offset_277 0)) |v_#pthreadsMutex_641|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_159| (select (select |v_#memory_int_1267| |v_~#t1~0.base_112|) |v_~#t1~0.offset_112|)) (= (select |v_#valid_428| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_294|) 0) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_224| 0) (= |v_ULTIMATE.start_main_~#data~1#1.base_389| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_80|) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_294| 0)) (= (store |v_#memory_$Pointer$.base_1226| v_my_callbackThread1of1ForFork0_~data~0.base_269 (store .cse4 .cse2 (select (select |v_#memory_$Pointer$.base_1224| v_my_callbackThread1of1ForFork0_~data~0.base_269) .cse2))) |v_#memory_$Pointer$.base_1224|) (= (store |v_#memory_$Pointer$.offset_1226| v_my_callbackThread1of1ForFork0_~data~0.base_269 (store .cse3 .cse2 (select (select |v_#memory_$Pointer$.offset_1224| v_my_callbackThread1of1ForFork0_~data~0.base_269) .cse2))) |v_#memory_$Pointer$.offset_1224|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_642|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1225|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_389|, ~#t1~0.offset=|v_~#t1~0.offset_112|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_269, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_277, #StackHeapBarrier=|v_#StackHeapBarrier_121|, ~#t1~0.base=|v_~#t1~0.base_112|, #valid=|v_#valid_428|, #memory_int=|v_#memory_int_1267|, #length=|v_#length_256|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1225|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_389|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_159|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1224|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_294|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_143|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_89|, ~#t1~0.offset=|v_~#t1~0.offset_112|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_269, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_82|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_141|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_277, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_122|, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_69|, ~#t1~0.base=|v_~#t1~0.base_112|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_151|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_255|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_165|, #length=|v_#length_255|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_110|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_69|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_80|, #pthreadsMutex=|v_#pthreadsMutex_641|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_149|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_82|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_255|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_389|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_217|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_224|, #StackHeapBarrier=|v_#StackHeapBarrier_121|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_80|, #valid=|v_#valid_427|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_143|, #memory_int=|v_#memory_int_1266|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1224|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_389|} AuxVars[|v_#memory_$Pointer$.offset_1226|, |v_#memory_$Pointer$.base_1226|] 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, 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:52,082 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [645] $Ultimate##0-->my_callbackEXIT: Formula: (let ((.cse2 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_452 28)) (.cse1 (select |v_#memory_$Pointer$.offset_1231| v_my_callbackThread1of1ForFork1_~data~0.base_452)) (.cse3 (select |v_#memory_$Pointer$.base_1231| v_my_callbackThread1of1ForFork1_~data~0.base_452)) (.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_452 24)) (.cse5 (select |v_#pthreadsMutex_647| v_my_callbackThread1of1ForFork1_~data~0.base_452))) (and (= .cse0 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_75) (= (store |v_#memory_$Pointer$.offset_1231| v_my_callbackThread1of1ForFork1_~data~0.base_452 (store .cse1 .cse2 (select (select |v_#memory_$Pointer$.offset_1230| v_my_callbackThread1of1ForFork1_~data~0.base_452) .cse2))) |v_#memory_$Pointer$.offset_1230|) (= |v_#memory_$Pointer$.base_1230| (store |v_#memory_$Pointer$.base_1231| v_my_callbackThread1of1ForFork1_~data~0.base_452 (store .cse3 .cse2 (select (select |v_#memory_$Pointer$.base_1230| v_my_callbackThread1of1ForFork1_~data~0.base_452) .cse2)))) (= |v_#memory_int_1270| (store |v_#memory_int_1272| v_my_callbackThread1of1ForFork1_~data~0.base_452 (let ((.cse4 (select |v_#memory_int_1272| v_my_callbackThread1of1ForFork1_~data~0.base_452))) (store (store .cse4 .cse0 1) .cse2 (+ (select .cse4 .cse2) 1))))) (= v_~my_dev~0.offset_238 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_75) (= (store |v_#pthreadsMutex_647| v_my_callbackThread1of1ForFork1_~data~0.base_452 (store .cse5 v_my_callbackThread1of1ForFork1_~data~0.offset_452 0)) |v_#pthreadsMutex_645|) (= |v_my_callbackThread1of1ForFork1_#res.base_143| 0) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_75 v_~my_dev~0.base_238) (= |v_my_callbackThread1of1ForFork1_#res.offset_143| 0) (= v_my_callbackThread1of1ForFork1_~arg.base_73 |v_my_callbackThread1of1ForFork1_#in~arg.base_73|) (= (store |v_#memory_$Pointer$.offset_1232| v_my_callbackThread1of1ForFork1_~data~0.base_452 (store (select |v_#memory_$Pointer$.offset_1232| v_my_callbackThread1of1ForFork1_~data~0.base_452) .cse0 (select .cse1 .cse0))) |v_#memory_$Pointer$.offset_1231|) (= v_my_callbackThread1of1ForFork1_~arg.offset_73 |v_my_callbackThread1of1ForFork1_#in~arg.offset_73|) (= v_my_callbackThread1of1ForFork1_~data~0.base_452 v_my_callbackThread1of1ForFork1_~__mptr~0.base_75) (= (store |v_#memory_$Pointer$.base_1232| v_my_callbackThread1of1ForFork1_~data~0.base_452 (store (select |v_#memory_$Pointer$.base_1232| v_my_callbackThread1of1ForFork1_~data~0.base_452) .cse0 (select .cse3 .cse0))) |v_#memory_$Pointer$.base_1231|) (= (select .cse5 v_my_callbackThread1of1ForFork1_~data~0.offset_452) 0))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_73|, #pthreadsMutex=|v_#pthreadsMutex_647|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1232|, ~my_dev~0.base=v_~my_dev~0.base_238, #memory_int=|v_#memory_int_1272|, ~my_dev~0.offset=v_~my_dev~0.offset_238, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1232|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_73|} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_409|, #pthreadsMutex=|v_#pthreadsMutex_645|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1230|, ~my_dev~0.base=v_~my_dev~0.base_238, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_73, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_75, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_154|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_73|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_73|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_452, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_143|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_452, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_73, #memory_int=|v_#memory_int_1270|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_75, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_143|, ~my_dev~0.offset=v_~my_dev~0.offset_238, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1230|} AuxVars[|v_#memory_$Pointer$.base_1231|, |v_#memory_$Pointer$.offset_1231|] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #pthreadsMutex, #memory_$Pointer$.base, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_#res.base, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_#res.offset, #memory_$Pointer$.offset] and [646] $Ultimate##0-->my_callbackEXIT: Formula: (let ((.cse4 (select |v_#memory_$Pointer$.offset_1238| v_my_callbackThread1of1ForFork0_~data~0.base_271)) (.cse1 (select |v_#memory_$Pointer$.base_1238| v_my_callbackThread1of1ForFork0_~data~0.base_271)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_279 24)) (.cse2 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_279 28)) (.cse3 (select |v_#pthreadsMutex_653| v_my_callbackThread1of1ForFork0_~data~0.base_271))) (and (= |v_ULTIMATE.start_main_~probe_ret~0#1_167| 0) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_54) (= (store |v_#length_260| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_296| 4) |v_#length_259|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_124| |v_ULTIMATE.start_main_~probe_ret~0#1_167|) (= |v_#memory_$Pointer$.base_1236| (store |v_#memory_$Pointer$.base_1238| v_my_callbackThread1of1ForFork0_~data~0.base_271 (store .cse1 .cse2 (select (select |v_#memory_$Pointer$.base_1236| v_my_callbackThread1of1ForFork0_~data~0.base_271) .cse2)))) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_296| 0)) (= |v_ULTIMATE.start_main_~#data~1#1.base_391| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_82|) (= (select .cse3 v_my_callbackThread1of1ForFork0_~data~0.offset_279) 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_71| 0) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_226| 0) (= (store |v_#memory_$Pointer$.offset_1237| v_my_callbackThread1of1ForFork0_~data~0.base_271 (store (select |v_#memory_$Pointer$.offset_1237| v_my_callbackThread1of1ForFork0_~data~0.base_271) .cse0 (select .cse4 .cse0))) |v_#memory_$Pointer$.offset_1238|) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_40| v_my_callbackThread1of1ForFork0_~arg.base_40) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_54 v_~my_dev~0.offset_240) (= v_my_callbackThread1of1ForFork0_~data~0.base_271 v_my_callbackThread1of1ForFork0_~__mptr~0.base_54) (= (store |v_#memory_$Pointer$.offset_1238| v_my_callbackThread1of1ForFork0_~data~0.base_271 (store .cse4 .cse2 (select (select |v_#memory_$Pointer$.offset_1236| v_my_callbackThread1of1ForFork0_~data~0.base_271) .cse2))) |v_#memory_$Pointer$.offset_1236|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_82| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_84|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_161| (select (select |v_#memory_int_1277| |v_~#t1~0.base_114|) |v_~#t1~0.offset_114|)) (= |v_ULTIMATE.start_main_~#data~1#1.offset_391| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_82|) (= (store |v_#memory_$Pointer$.base_1237| v_my_callbackThread1of1ForFork0_~data~0.base_271 (store (select |v_#memory_$Pointer$.base_1237| v_my_callbackThread1of1ForFork0_~data~0.base_271) .cse0 (select .cse1 .cse0))) |v_#memory_$Pointer$.base_1238|) (= v_my_callbackThread1of1ForFork0_~arg.offset_40 |v_my_callbackThread1of1ForFork0_#in~arg.offset_40|) (= v_my_callbackThread1of1ForFork0_~__mptr~0.base_54 v_~my_dev~0.base_240) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_82| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_84|) (= |v_#valid_431| (store |v_#valid_432| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_296| 1)) (= (store |v_#memory_int_1277| v_my_callbackThread1of1ForFork0_~data~0.base_271 (let ((.cse5 (select |v_#memory_int_1277| v_my_callbackThread1of1ForFork0_~data~0.base_271))) (store (store .cse5 .cse0 1) .cse2 (+ (select .cse5 .cse2) 1)))) |v_#memory_int_1276|) (= |v_my_callbackThread1of1ForFork0_#res.base_71| 0) (< |v_#StackHeapBarrier_123| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_296|) (= (store |v_#pthreadsMutex_653| v_my_callbackThread1of1ForFork0_~data~0.base_271 (store .cse3 v_my_callbackThread1of1ForFork0_~data~0.offset_279 0)) |v_#pthreadsMutex_651|) (= (select |v_#valid_432| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_296|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_653|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1237|, ~my_dev~0.base=v_~my_dev~0.base_240, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_391|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_40|, ~#t1~0.offset=|v_~#t1~0.offset_114|, #StackHeapBarrier=|v_#StackHeapBarrier_123|, ~#t1~0.base=|v_~#t1~0.base_114|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_40|, #valid=|v_#valid_432|, #memory_int=|v_#memory_int_1277|, #length=|v_#length_260|, ~my_dev~0.offset=v_~my_dev~0.offset_240, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1237|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_391|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_161|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1236|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_296|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_145|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_40|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_91|, ~#t1~0.offset=|v_~#t1~0.offset_114|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_54, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_271, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_84|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_143|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_279, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_124|, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_71|, ~#t1~0.base=|v_~#t1~0.base_114|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_153|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_257|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_167|, #length=|v_#length_259|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_112|, ~my_dev~0.offset=v_~my_dev~0.offset_240, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_71|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_82|, #pthreadsMutex=|v_#pthreadsMutex_651|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_151|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_84|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_257|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_40, ~my_dev~0.base=v_~my_dev~0.base_240, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_391|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_219|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_226|, #StackHeapBarrier=|v_#StackHeapBarrier_123|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_40|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_82|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_40, #valid=|v_#valid_431|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_145|, #memory_int=|v_#memory_int_1276|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_54, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1236|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_391|} AuxVars[|v_#memory_$Pointer$.offset_1238|, |v_#memory_$Pointer$.base_1238|] 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, #memory_$Pointer$.offset] [2022-12-06 06:49:01,695 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [568] L1736-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_366| |v_ULTIMATE.start_main_~#data~1#1.base_139|))) (and (= |v_ULTIMATE.start_ldv_assert_~expression#1_187| 0) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_157| |v_ULTIMATE.start_ldv_assert_~expression#1_187|) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_139| 28)) |v_ULTIMATE.start_main_#t~mem47#1_63|) (= (store |v_#memory_int_367| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76| (store (select |v_#memory_int_367| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_68| (select (select |v_#memory_int_366| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_68|))) |v_#memory_int_366|) (= (store |v_#valid_173| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76| 0) |v_#valid_172|) (= (store |v_#memory_$Pointer$.offset_319| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76| (store (select |v_#memory_$Pointer$.offset_319| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_68| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_51|)) |v_#memory_$Pointer$.offset_318|) (not (= (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_139| 24)) 1) 1 0) 0)) (= (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_63|) 1 0) |v_ULTIMATE.start_ldv_assert_#in~expression#1_157|) (= (store |v_#memory_$Pointer$.base_319| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76| (store (select |v_#memory_$Pointer$.base_319| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_68| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_51|)) |v_#memory_$Pointer$.base_318|))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_68|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_319|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_76|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_51|, #valid=|v_#valid_173|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_51|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_139|, #memory_int=|v_#memory_int_367|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_319|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_139|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_187|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_318|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_63|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_139|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_42|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_157|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_67|, #valid=|v_#valid_172|, #memory_int=|v_#memory_int_366|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_318|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_139|} 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 [634] L1735-1-->L1736-1: Formula: (and (= |v_#memory_int_1218| (store |v_#memory_int_1219| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_276| (store (select |v_#memory_int_1219| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_276|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_206| (select (select |v_#memory_int_1218| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_276|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_206|)))) (= (store |v_#memory_$Pointer$.base_1164| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_276| (store (select |v_#memory_$Pointer$.base_1164| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_276|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_206| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_236|)) |v_#memory_$Pointer$.base_1163|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_199| (select (select |v_#memory_int_1218| |v_~#t2~0.base_167|) |v_~#t2~0.offset_158|)) (= (store |v_#memory_$Pointer$.offset_1164| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_276| (store (select |v_#memory_$Pointer$.offset_1164| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_276|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_206| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_236|)) |v_#memory_$Pointer$.offset_1163|)) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_206|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_236|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1164|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_236|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_276|, ~#t2~0.offset=|v_~#t2~0.offset_158|, #memory_int=|v_#memory_int_1219|, ~#t2~0.base=|v_~#t2~0.base_167|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1164|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_143|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_206|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1163|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_276|, ~#t2~0.offset=|v_~#t2~0.offset_158|, #memory_int=|v_#memory_int_1218|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_199|, ~#t2~0.base=|v_~#t2~0.base_167|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1163|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, #memory_int, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, #memory_$Pointer$.offset] [2022-12-06 06:49:01,886 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:49:01,887 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:49:01,889 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:49:01,889 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:49:01,891 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:49:01,892 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:49:01,893 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:49:01,893 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 06:49:03,009 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] L1736-2-->L1736-1: Formula: (let ((.cse0 (select |v_#memory_int_1287| |v_ULTIMATE.start_main_~#data~1#1.base_395|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_395| 28)) |v_ULTIMATE.start_main_#t~mem47#1_71|) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_206| (ite (= 2 |v_ULTIMATE.start_main_#t~mem47#1_71|) 1 0)) (= (select (select |v_#memory_int_1286| |v_~#t2~0.base_171|) |v_~#t2~0.offset_162|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_223|) (= (store |v_#memory_int_1287| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_300| (store (select |v_#memory_int_1287| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_300|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_230| (select (select |v_#memory_int_1286| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_300|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_230|))) |v_#memory_int_1286|) (= (let ((.cse1 (store |v_#memory_$Pointer$.base_1254| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_301| (store (select |v_#memory_$Pointer$.base_1254| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_301|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_231| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_150|)))) (store .cse1 |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_300| (store (select .cse1 |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_300|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_230| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_262|))) |v_#memory_$Pointer$.base_1252|) (= |v_ULTIMATE.start_ldv_assert_~expression#1_243| 0) (= (store |v_#valid_440| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_301| 0) |v_#valid_439|) (= (let ((.cse2 (store |v_#memory_$Pointer$.offset_1254| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_301| (store (select |v_#memory_$Pointer$.offset_1254| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_301|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_231| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_150|)))) (store .cse2 |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_300| (store (select .cse2 |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_300|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_230| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_262|))) |v_#memory_$Pointer$.offset_1252|) (not (= (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_395| 24)) 1) 1 0) 0)) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_206| |v_ULTIMATE.start_ldv_assert_~expression#1_243|) (= (store |v_#memory_int_1288| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_301| (store (select |v_#memory_int_1288| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_301|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_231| (select (select |v_#memory_int_1287| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_301|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_231|))) |v_#memory_int_1287|))) InVars {ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_262|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1254|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_301|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_150|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_395|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_231|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_262|, ~#t2~0.offset=|v_~#t2~0.offset_162|, #valid=|v_#valid_440|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_150|, #memory_int=|v_#memory_int_1288|, ~#t2~0.base=|v_~#t2~0.base_171|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1254|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_395|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_165|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_243|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1252|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_300|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_71|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_395|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_223|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_206|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_230|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_81|, ~#t2~0.offset=|v_~#t2~0.offset_162|, #valid=|v_#valid_439|, #memory_int=|v_#memory_int_1286|, ~#t2~0.base=|v_~#t2~0.base_171|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1252|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_395|} AuxVars[|v_#memory_int_1287|] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_ldv_assert_~expression#1, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, #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_my_drv_disconnect_#t~nondet41#1.base, ULTIMATE.start_main_#t~mem46#1, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #memory_int, #memory_$Pointer$.offset] and [642] L1710-1-->my_callbackEXIT: Formula: (let ((.cse5 (select |v_#memory_int_1256| v_my_callbackThread1of1ForFork0_~data~0.base_265)) (.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_273 24))) (let ((.cse1 (select |v_#memory_$Pointer$.offset_1212| v_my_callbackThread1of1ForFork0_~data~0.base_265)) (.cse3 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_273 28)) (.cse4 (store .cse5 .cse0 1)) (.cse2 (select |v_#memory_$Pointer$.base_1212| v_my_callbackThread1of1ForFork0_~data~0.base_265))) (and (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_78| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_80|) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_292| 0)) (= (store |v_#memory_$Pointer$.offset_1213| v_my_callbackThread1of1ForFork0_~data~0.base_265 (store (select |v_#memory_$Pointer$.offset_1213| v_my_callbackThread1of1ForFork0_~data~0.base_265) .cse0 (select .cse1 .cse0))) |v_#memory_$Pointer$.offset_1212|) (= (store |v_#memory_$Pointer$.base_1212| v_my_callbackThread1of1ForFork0_~data~0.base_265 (store .cse2 .cse3 (select (select |v_#memory_$Pointer$.base_1211| v_my_callbackThread1of1ForFork0_~data~0.base_265) .cse3))) |v_#memory_$Pointer$.base_1211|) (= |v_#memory_int_1254| (store |v_#memory_int_1256| v_my_callbackThread1of1ForFork0_~data~0.base_265 (store .cse4 .cse3 (+ (select .cse5 .cse3) 1)))) (= |v_ULTIMATE.start_main_~#data~1#1.offset_387| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_78|) (= (select |v_#valid_424| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_292|) 0) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_222| 0) (= (store |v_#valid_424| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_292| 1) |v_#valid_423|) (= (store |v_#pthreadsMutex_634| v_my_callbackThread1of1ForFork0_~data~0.base_265 (store (select |v_#pthreadsMutex_634| v_my_callbackThread1of1ForFork0_~data~0.base_265) v_my_callbackThread1of1ForFork0_~data~0.offset_273 0)) |v_#pthreadsMutex_633|) (= |v_my_callbackThread1of1ForFork0_#res.base_65| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_78| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_80|) (= (store |v_#memory_$Pointer$.offset_1212| v_my_callbackThread1of1ForFork0_~data~0.base_265 (store .cse1 .cse3 (select (select |v_#memory_$Pointer$.offset_1211| v_my_callbackThread1of1ForFork0_~data~0.base_265) .cse3))) |v_#memory_$Pointer$.offset_1211|) (= |v_my_callbackThread1of1ForFork0_#res.offset_65| 0) (= (store |v_#length_252| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_292| 4) |v_#length_251|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_157| (select (select (store |v_#memory_int_1256| v_my_callbackThread1of1ForFork0_~data~0.base_265 .cse4) |v_~#t1~0.base_110|) |v_~#t1~0.offset_110|)) (< |v_#StackHeapBarrier_119| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_292|) (= |v_#memory_$Pointer$.base_1212| (store |v_#memory_$Pointer$.base_1213| v_my_callbackThread1of1ForFork0_~data~0.base_265 (store (select |v_#memory_$Pointer$.base_1213| v_my_callbackThread1of1ForFork0_~data~0.base_265) .cse0 (select .cse2 .cse0)))) (= |v_ULTIMATE.start_main_~probe_ret~0#1_163| 0) (= |v_ULTIMATE.start_main_~#data~1#1.base_387| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_78|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_120| |v_ULTIMATE.start_main_~probe_ret~0#1_163|)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_634|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1213|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_387|, ~#t1~0.offset=|v_~#t1~0.offset_110|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_265, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_273, #StackHeapBarrier=|v_#StackHeapBarrier_119|, ~#t1~0.base=|v_~#t1~0.base_110|, #valid=|v_#valid_424|, #memory_int=|v_#memory_int_1256|, #length=|v_#length_252|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1213|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_387|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_157|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1211|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_292|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_141|, ~#t1~0.offset=|v_~#t1~0.offset_110|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_85|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_265, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_80|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_139|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_273, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_120|, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_65|, ~#t1~0.base=|v_~#t1~0.base_110|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_149|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_253|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_163|, #length=|v_#length_251|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_108|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_65|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_78|, #pthreadsMutex=|v_#pthreadsMutex_633|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_145|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_80|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_253|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_387|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_215|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_222|, #StackHeapBarrier=|v_#StackHeapBarrier_119|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_78|, #valid=|v_#valid_423|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_141|, #memory_int=|v_#memory_int_1254|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1211|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_387|} AuxVars[|v_#memory_$Pointer$.base_1212|, |v_#memory_$Pointer$.offset_1212|] 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, 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:49:05,871 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [645] $Ultimate##0-->my_callbackEXIT: Formula: (let ((.cse2 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_452 28)) (.cse1 (select |v_#memory_$Pointer$.offset_1231| v_my_callbackThread1of1ForFork1_~data~0.base_452)) (.cse3 (select |v_#memory_$Pointer$.base_1231| v_my_callbackThread1of1ForFork1_~data~0.base_452)) (.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_452 24)) (.cse5 (select |v_#pthreadsMutex_647| v_my_callbackThread1of1ForFork1_~data~0.base_452))) (and (= .cse0 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_75) (= (store |v_#memory_$Pointer$.offset_1231| v_my_callbackThread1of1ForFork1_~data~0.base_452 (store .cse1 .cse2 (select (select |v_#memory_$Pointer$.offset_1230| v_my_callbackThread1of1ForFork1_~data~0.base_452) .cse2))) |v_#memory_$Pointer$.offset_1230|) (= |v_#memory_$Pointer$.base_1230| (store |v_#memory_$Pointer$.base_1231| v_my_callbackThread1of1ForFork1_~data~0.base_452 (store .cse3 .cse2 (select (select |v_#memory_$Pointer$.base_1230| v_my_callbackThread1of1ForFork1_~data~0.base_452) .cse2)))) (= |v_#memory_int_1270| (store |v_#memory_int_1272| v_my_callbackThread1of1ForFork1_~data~0.base_452 (let ((.cse4 (select |v_#memory_int_1272| v_my_callbackThread1of1ForFork1_~data~0.base_452))) (store (store .cse4 .cse0 1) .cse2 (+ (select .cse4 .cse2) 1))))) (= v_~my_dev~0.offset_238 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_75) (= (store |v_#pthreadsMutex_647| v_my_callbackThread1of1ForFork1_~data~0.base_452 (store .cse5 v_my_callbackThread1of1ForFork1_~data~0.offset_452 0)) |v_#pthreadsMutex_645|) (= |v_my_callbackThread1of1ForFork1_#res.base_143| 0) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_75 v_~my_dev~0.base_238) (= |v_my_callbackThread1of1ForFork1_#res.offset_143| 0) (= v_my_callbackThread1of1ForFork1_~arg.base_73 |v_my_callbackThread1of1ForFork1_#in~arg.base_73|) (= (store |v_#memory_$Pointer$.offset_1232| v_my_callbackThread1of1ForFork1_~data~0.base_452 (store (select |v_#memory_$Pointer$.offset_1232| v_my_callbackThread1of1ForFork1_~data~0.base_452) .cse0 (select .cse1 .cse0))) |v_#memory_$Pointer$.offset_1231|) (= v_my_callbackThread1of1ForFork1_~arg.offset_73 |v_my_callbackThread1of1ForFork1_#in~arg.offset_73|) (= v_my_callbackThread1of1ForFork1_~data~0.base_452 v_my_callbackThread1of1ForFork1_~__mptr~0.base_75) (= (store |v_#memory_$Pointer$.base_1232| v_my_callbackThread1of1ForFork1_~data~0.base_452 (store (select |v_#memory_$Pointer$.base_1232| v_my_callbackThread1of1ForFork1_~data~0.base_452) .cse0 (select .cse3 .cse0))) |v_#memory_$Pointer$.base_1231|) (= (select .cse5 v_my_callbackThread1of1ForFork1_~data~0.offset_452) 0))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_73|, #pthreadsMutex=|v_#pthreadsMutex_647|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1232|, ~my_dev~0.base=v_~my_dev~0.base_238, #memory_int=|v_#memory_int_1272|, ~my_dev~0.offset=v_~my_dev~0.offset_238, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1232|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_73|} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_409|, #pthreadsMutex=|v_#pthreadsMutex_645|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1230|, ~my_dev~0.base=v_~my_dev~0.base_238, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_73, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_75, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_154|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_73|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_73|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_452, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_143|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_452, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_73, #memory_int=|v_#memory_int_1270|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_75, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_143|, ~my_dev~0.offset=v_~my_dev~0.offset_238, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1230|} AuxVars[|v_#memory_$Pointer$.base_1231|, |v_#memory_$Pointer$.offset_1231|] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #pthreadsMutex, #memory_$Pointer$.base, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_#res.base, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_#res.offset, #memory_$Pointer$.offset] and [511] $Ultimate##0-->L1710-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_86| v_my_callbackThread1of1ForFork0_~data~0.base_51))) (and (= v_~my_dev~0.offset_28 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_21) (= (select .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_51) 0) (= |v_#pthreadsMutex_85| (store |v_#pthreadsMutex_86| v_my_callbackThread1of1ForFork0_~data~0.base_51 (store .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_51 1))) (= v_my_callbackThread1of1ForFork0_~data~0.base_51 v_my_callbackThread1of1ForFork0_~__mptr~0.base_21) (= v_my_callbackThread1of1ForFork0_~__mptr~0.base_21 v_~my_dev~0.base_28) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_7| v_my_callbackThread1of1ForFork0_~arg.base_7) (= (+ v_my_callbackThread1of1ForFork0_~data~0.offset_51 24) v_my_callbackThread1of1ForFork0_~__mptr~0.offset_21) (= v_my_callbackThread1of1ForFork0_~arg.offset_7 |v_my_callbackThread1of1ForFork0_#in~arg.offset_7|) (= |v_my_callbackThread1of1ForFork0_#t~nondet31_23| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_86|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_7|, ~my_dev~0.base=v_~my_dev~0.base_28, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_7|, ~my_dev~0.offset=v_~my_dev~0.offset_28} OutVars{#pthreadsMutex=|v_#pthreadsMutex_85|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_51, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_7|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_7, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_7, ~my_dev~0.base=v_~my_dev~0.base_28, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_7|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_23|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_21, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_21, ~my_dev~0.offset=v_~my_dev~0.offset_28, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_51} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_~arg.offset, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base] [2022-12-06 06:49:06,886 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [645] $Ultimate##0-->my_callbackEXIT: Formula: (let ((.cse2 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_452 28)) (.cse1 (select |v_#memory_$Pointer$.offset_1231| v_my_callbackThread1of1ForFork1_~data~0.base_452)) (.cse3 (select |v_#memory_$Pointer$.base_1231| v_my_callbackThread1of1ForFork1_~data~0.base_452)) (.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_452 24)) (.cse5 (select |v_#pthreadsMutex_647| v_my_callbackThread1of1ForFork1_~data~0.base_452))) (and (= .cse0 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_75) (= (store |v_#memory_$Pointer$.offset_1231| v_my_callbackThread1of1ForFork1_~data~0.base_452 (store .cse1 .cse2 (select (select |v_#memory_$Pointer$.offset_1230| v_my_callbackThread1of1ForFork1_~data~0.base_452) .cse2))) |v_#memory_$Pointer$.offset_1230|) (= |v_#memory_$Pointer$.base_1230| (store |v_#memory_$Pointer$.base_1231| v_my_callbackThread1of1ForFork1_~data~0.base_452 (store .cse3 .cse2 (select (select |v_#memory_$Pointer$.base_1230| v_my_callbackThread1of1ForFork1_~data~0.base_452) .cse2)))) (= |v_#memory_int_1270| (store |v_#memory_int_1272| v_my_callbackThread1of1ForFork1_~data~0.base_452 (let ((.cse4 (select |v_#memory_int_1272| v_my_callbackThread1of1ForFork1_~data~0.base_452))) (store (store .cse4 .cse0 1) .cse2 (+ (select .cse4 .cse2) 1))))) (= v_~my_dev~0.offset_238 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_75) (= (store |v_#pthreadsMutex_647| v_my_callbackThread1of1ForFork1_~data~0.base_452 (store .cse5 v_my_callbackThread1of1ForFork1_~data~0.offset_452 0)) |v_#pthreadsMutex_645|) (= |v_my_callbackThread1of1ForFork1_#res.base_143| 0) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_75 v_~my_dev~0.base_238) (= |v_my_callbackThread1of1ForFork1_#res.offset_143| 0) (= v_my_callbackThread1of1ForFork1_~arg.base_73 |v_my_callbackThread1of1ForFork1_#in~arg.base_73|) (= (store |v_#memory_$Pointer$.offset_1232| v_my_callbackThread1of1ForFork1_~data~0.base_452 (store (select |v_#memory_$Pointer$.offset_1232| v_my_callbackThread1of1ForFork1_~data~0.base_452) .cse0 (select .cse1 .cse0))) |v_#memory_$Pointer$.offset_1231|) (= v_my_callbackThread1of1ForFork1_~arg.offset_73 |v_my_callbackThread1of1ForFork1_#in~arg.offset_73|) (= v_my_callbackThread1of1ForFork1_~data~0.base_452 v_my_callbackThread1of1ForFork1_~__mptr~0.base_75) (= (store |v_#memory_$Pointer$.base_1232| v_my_callbackThread1of1ForFork1_~data~0.base_452 (store (select |v_#memory_$Pointer$.base_1232| v_my_callbackThread1of1ForFork1_~data~0.base_452) .cse0 (select .cse3 .cse0))) |v_#memory_$Pointer$.base_1231|) (= (select .cse5 v_my_callbackThread1of1ForFork1_~data~0.offset_452) 0))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_73|, #pthreadsMutex=|v_#pthreadsMutex_647|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1232|, ~my_dev~0.base=v_~my_dev~0.base_238, #memory_int=|v_#memory_int_1272|, ~my_dev~0.offset=v_~my_dev~0.offset_238, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1232|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_73|} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_409|, #pthreadsMutex=|v_#pthreadsMutex_645|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1230|, ~my_dev~0.base=v_~my_dev~0.base_238, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_73, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_75, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_154|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_73|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_73|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_452, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_143|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_452, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_73, #memory_int=|v_#memory_int_1270|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_75, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_143|, ~my_dev~0.offset=v_~my_dev~0.offset_238, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1230|} AuxVars[|v_#memory_$Pointer$.base_1231|, |v_#memory_$Pointer$.offset_1231|] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #pthreadsMutex, #memory_$Pointer$.base, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_#res.base, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_#res.offset, #memory_$Pointer$.offset] and [649] $Ultimate##0-->my_callbackEXIT: Formula: (let ((.cse2 (select |v_#memory_int_1293| v_my_callbackThread1of1ForFork0_~data~0.base_275)) (.cse3 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_283 24))) (let ((.cse4 (select |v_#memory_$Pointer$.base_1261| v_my_callbackThread1of1ForFork0_~data~0.base_275)) (.cse5 (select |v_#pthreadsMutex_665| v_my_callbackThread1of1ForFork0_~data~0.base_275)) (.cse0 (store .cse2 .cse3 1)) (.cse6 (select |v_#memory_$Pointer$.offset_1261| v_my_callbackThread1of1ForFork0_~data~0.base_275)) (.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_283 28))) (and (= |v_my_callbackThread1of1ForFork0_#res.offset_75| 0) (= |v_#memory_int_1292| (store |v_#memory_int_1293| v_my_callbackThread1of1ForFork0_~data~0.base_275 (store .cse0 .cse1 (+ (select .cse2 .cse1) 1)))) (= |v_my_callbackThread1of1ForFork0_#res.base_75| 0) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_86| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_88|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_128| |v_ULTIMATE.start_main_~probe_ret~0#1_171|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_234| 0) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_44| v_my_callbackThread1of1ForFork0_~arg.base_44) (= (store |v_#memory_$Pointer$.base_1260| v_my_callbackThread1of1ForFork0_~data~0.base_275 (store (select |v_#memory_$Pointer$.base_1260| v_my_callbackThread1of1ForFork0_~data~0.base_275) .cse3 (select .cse4 .cse3))) |v_#memory_$Pointer$.base_1261|) (= (select .cse5 v_my_callbackThread1of1ForFork0_~data~0.offset_283) 0) (= (store |v_#length_268| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_304| 4) |v_#length_267|) (= |v_#memory_$Pointer$.base_1259| (store |v_#memory_$Pointer$.base_1261| v_my_callbackThread1of1ForFork0_~data~0.base_275 (store .cse4 .cse1 (select (select |v_#memory_$Pointer$.base_1259| v_my_callbackThread1of1ForFork0_~data~0.base_275) .cse1)))) (= (store |v_#pthreadsMutex_665| v_my_callbackThread1of1ForFork0_~data~0.base_275 (store .cse5 v_my_callbackThread1of1ForFork0_~data~0.offset_283 0)) |v_#pthreadsMutex_663|) (= v_my_callbackThread1of1ForFork0_~__mptr~0.base_58 v_~my_dev~0.base_244) (= (select |v_#valid_444| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_304|) 0) (= v_my_callbackThread1of1ForFork0_~arg.offset_44 |v_my_callbackThread1of1ForFork0_#in~arg.offset_44|) (= (store |v_#memory_$Pointer$.offset_1260| v_my_callbackThread1of1ForFork0_~data~0.base_275 (store (select |v_#memory_$Pointer$.offset_1260| v_my_callbackThread1of1ForFork0_~data~0.base_275) .cse3 (select .cse6 .cse3))) |v_#memory_$Pointer$.offset_1261|) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_304| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_167| (select (select (store |v_#memory_int_1293| v_my_callbackThread1of1ForFork0_~data~0.base_275 .cse0) |v_~#t1~0.base_118|) |v_~#t1~0.offset_118|)) (< |v_#StackHeapBarrier_127| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_304|) (= (store |v_#memory_$Pointer$.offset_1261| v_my_callbackThread1of1ForFork0_~data~0.base_275 (store .cse6 .cse1 (select (select |v_#memory_$Pointer$.offset_1259| v_my_callbackThread1of1ForFork0_~data~0.base_275) .cse1))) |v_#memory_$Pointer$.offset_1259|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_86| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_88|) (= |v_ULTIMATE.start_main_~#data~1#1.base_397| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_86|) (= (store |v_#valid_444| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_304| 1) |v_#valid_443|) (= v_my_callbackThread1of1ForFork0_~data~0.base_275 v_my_callbackThread1of1ForFork0_~__mptr~0.base_58) (= |v_ULTIMATE.start_main_~#data~1#1.offset_397| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_86|) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_58 .cse3) (= |v_ULTIMATE.start_main_~probe_ret~0#1_171| 0) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_58 v_~my_dev~0.offset_244)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_665|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1260|, ~my_dev~0.base=v_~my_dev~0.base_244, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_397|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_44|, ~#t1~0.offset=|v_~#t1~0.offset_118|, #StackHeapBarrier=|v_#StackHeapBarrier_127|, ~#t1~0.base=|v_~#t1~0.base_118|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_44|, #valid=|v_#valid_444|, #memory_int=|v_#memory_int_1293|, #length=|v_#length_268|, ~my_dev~0.offset=v_~my_dev~0.offset_244, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1260|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_397|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_167|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1259|, 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_153|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_44|, ~#t1~0.offset=|v_~#t1~0.offset_118|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_97|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_58, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_275, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_88|, ULTIMATE.start_my_drv_probe_#t~pre38#1=|v_ULTIMATE.start_my_drv_probe_#t~pre38#1_147|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_283, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_128|, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_75|, ~#t1~0.base=|v_~#t1~0.base_118|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_157|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_265|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_171|, #length=|v_#length_267|, ULTIMATE.start_my_drv_probe_#t~nondet39#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet39#1_116|, ~my_dev~0.offset=v_~my_dev~0.offset_244, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_75|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_86|, #pthreadsMutex=|v_#pthreadsMutex_663|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_155|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_88|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_265|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_44, ~my_dev~0.base=v_~my_dev~0.base_244, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_397|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_227|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_234|, #StackHeapBarrier=|v_#StackHeapBarrier_127|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_44|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_86|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_44, #valid=|v_#valid_443|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_153|, #memory_int=|v_#memory_int_1292|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_58, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1259|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_397|} AuxVars[|v_#memory_$Pointer$.base_1261|, |v_#memory_$Pointer$.offset_1261|] 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, #memory_$Pointer$.offset] [2022-12-06 06:49:19,076 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 06:49:19,077 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28771 [2022-12-06 06:49:19,077 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 101 flow [2022-12-06 06:49:19,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:49:19,077 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:49:19,078 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:49:19,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 06:49:19,078 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:49:19,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:49:19,078 INFO L85 PathProgramCache]: Analyzing trace with hash 550557561, now seen corresponding path program 1 times [2022-12-06 06:49:19,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:49:19,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203789904] [2022-12-06 06:49:19,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:49:19,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:49:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:49:19,748 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:19,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:49:19,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203789904] [2022-12-06 06:49:19,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203789904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:49:19,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:49:19,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:49:19,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535176945] [2022-12-06 06:49:19,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:49:19,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:49:19,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:49:19,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:49:19,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:49:19,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 06:49:19,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 101 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:19,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:49:19,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 06:49:19,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:49:19,954 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 06:49:19,954 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 06:49:19,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 15 events. 0/15 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 12 event pairs, 0 based on Foata normal form. 1/14 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-12-06 06:49:19,954 INFO L137 encePairwiseOnDemand]: 9/16 looper letters, 6 selfloop transitions, 3 changer transitions 4/13 dead transitions. [2022-12-06 06:49:19,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 13 transitions, 91 flow [2022-12-06 06:49:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:49:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:49:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-12-06 06:49:19,955 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21875 [2022-12-06 06:49:19,955 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 101 flow. Second operand 4 states and 14 transitions. [2022-12-06 06:49:19,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 13 transitions, 91 flow [2022-12-06 06:49:19,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 13 transitions, 68 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 06:49:19,956 INFO L231 Difference]: Finished difference. Result has 22 places, 9 transitions, 31 flow [2022-12-06 06:49:19,956 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=31, PETRI_PLACES=22, PETRI_TRANSITIONS=9} [2022-12-06 06:49:19,956 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -17 predicate places. [2022-12-06 06:49:19,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:49:19,957 INFO L89 Accepts]: Start accepts. Operand has 22 places, 9 transitions, 31 flow [2022-12-06 06:49:19,957 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:49:19,957 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:49:19,957 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 9 transitions, 31 flow [2022-12-06 06:49:19,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 9 transitions, 31 flow [2022-12-06 06:49:19,960 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-06 06:49:19,960 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:49:19,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19 conditions, 9 events. 0/9 cut-off events. For 2/2 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:19,960 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 17 places, 9 transitions, 31 flow [2022-12-06 06:49:19,960 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 06:49:19,961 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:49:19,961 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 06:49:19,961 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 9 transitions, 31 flow [2022-12-06 06:49:19,961 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:19,961 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:49:19,961 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:49:19,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 06:49:19,962 INFO L420 AbstractCegarLoop]: === Iteration 28 === 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:19,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:49:19,962 INFO L85 PathProgramCache]: Analyzing trace with hash 545938980, now seen corresponding path program 1 times [2022-12-06 06:49:19,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:49:19,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341509264] [2022-12-06 06:49:19,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:49:19,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:49:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:49:20,416 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:20,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:49:20,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341509264] [2022-12-06 06:49:20,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341509264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:49:20,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:49:20,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:49:20,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615971872] [2022-12-06 06:49:20,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:49:20,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:49:20,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:49:20,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:49:20,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:49:20,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 9 [2022-12-06 06:49:20,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 9 transitions, 31 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:49:20,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:49:20,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 9 [2022-12-06 06:49:20,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:49:20,481 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-06 06:49:20,481 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:49:20,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 8 events. 0/8 cut-off events. For 2/2 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:20,481 INFO L137 encePairwiseOnDemand]: 6/9 looper letters, 0 selfloop transitions, 0 changer transitions 8/8 dead transitions. [2022-12-06 06:49:20,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 8 transitions, 41 flow [2022-12-06 06:49:20,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:49:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:49:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2022-12-06 06:49:20,482 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-06 06:49:20,482 INFO L175 Difference]: Start difference. First operand has 17 places, 9 transitions, 31 flow. Second operand 4 states and 9 transitions. [2022-12-06 06:49:20,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 8 transitions, 41 flow [2022-12-06 06:49:20,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 8 transitions, 34 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:49:20,483 INFO L231 Difference]: Finished difference. Result has 14 places, 0 transitions, 0 flow [2022-12-06 06:49:20,483 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=9, 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=4, PETRI_FLOW=0, PETRI_PLACES=14, PETRI_TRANSITIONS=0} [2022-12-06 06:49:20,483 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -25 predicate places. [2022-12-06 06:49:20,483 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:49:20,483 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 14 places, 0 transitions, 0 flow [2022-12-06 06:49:20,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 06:49:20,484 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 06:49:20,484 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:49:20,484 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:20,484 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 06:49:20,484 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 06:49:20,484 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:49:20,485 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-06 06:49:20,485 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 06:49:20,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:49:20,488 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-12-06 06:49:20,488 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-12-06 06:49:20,488 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-12-06 06:49:20,488 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-12-06 06:49:20,488 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-12-06 06:49:20,488 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-12-06 06:49:20,488 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2022-12-06 06:49:20,488 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2022-12-06 06:49:20,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 06:49:20,489 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:49:20,493 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:49:20,493 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:49:20,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:49:20 BasicIcfg [2022-12-06 06:49:20,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:49:20,495 INFO L158 Benchmark]: Toolchain (without parser) took 118123.04ms. Allocated memory was 181.4MB in the beginning and 715.1MB in the end (delta: 533.7MB). Free memory was 154.8MB in the beginning and 640.7MB in the end (delta: -486.0MB). Peak memory consumption was 48.8MB. Max. memory is 8.0GB. [2022-12-06 06:49:20,495 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory was 157.7MB in the beginning and 157.6MB in the end (delta: 83.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:49:20,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.09ms. Allocated memory is still 181.4MB. Free memory was 154.2MB in the beginning and 99.2MB in the end (delta: 55.1MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. [2022-12-06 06:49:20,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.84ms. Allocated memory is still 181.4MB. Free memory was 99.2MB in the beginning and 96.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:49:20,496 INFO L158 Benchmark]: Boogie Preprocessor took 32.85ms. Allocated memory is still 181.4MB. Free memory was 96.0MB in the beginning and 93.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:49:20,496 INFO L158 Benchmark]: RCFGBuilder took 542.36ms. Allocated memory is still 181.4MB. Free memory was 93.4MB in the beginning and 69.8MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 06:49:20,496 INFO L158 Benchmark]: TraceAbstraction took 116866.64ms. Allocated memory was 181.4MB in the beginning and 715.1MB in the end (delta: 533.7MB). Free memory was 68.8MB in the beginning and 640.7MB in the end (delta: -571.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:49:20,497 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.11ms. Allocated memory is still 181.4MB. Free memory was 157.7MB in the beginning and 157.6MB in the end (delta: 83.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 626.09ms. Allocated memory is still 181.4MB. Free memory was 154.2MB in the beginning and 99.2MB in the end (delta: 55.1MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.84ms. Allocated memory is still 181.4MB. Free memory was 99.2MB in the beginning and 96.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.85ms. Allocated memory is still 181.4MB. Free memory was 96.0MB in the beginning and 93.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 542.36ms. Allocated memory is still 181.4MB. Free memory was 93.4MB in the beginning and 69.8MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 116866.64ms. Allocated memory was 181.4MB in the beginning and 715.1MB in the end (delta: 533.7MB). Free memory was 68.8MB in the beginning and 640.7MB in the end (delta: -571.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.7s, 161 PlacesBefore, 39 PlacesAfterwards, 161 TransitionsBefore, 35 TransitionsAfterwards, 2392 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 77 TrivialYvCompositions, 48 ConcurrentYvCompositions, 4 ChoiceCompositions, 131 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1682, independent: 1591, independent conditional: 1591, independent unconditional: 0, dependent: 86, dependent conditional: 86, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1682, independent: 1591, independent conditional: 0, independent unconditional: 1591, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1682, independent: 1591, independent conditional: 0, independent unconditional: 1591, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1682, independent: 1591, independent conditional: 0, independent unconditional: 1591, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1364, independent: 1325, independent conditional: 0, independent unconditional: 1325, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1364, independent: 1320, independent conditional: 0, independent unconditional: 1320, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6661, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 6476, unknown conditional: 0, unknown unconditional: 6476] ], Cache Queries: [ total: 1682, independent: 266, independent conditional: 0, independent unconditional: 266, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 1366, unknown conditional: 0, unknown unconditional: 1366] , Statistics on independence cache: Total cache size (in pairs): 2319, Positive cache size: 2283, Positive conditional cache size: 0, Positive unconditional cache size: 2283, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 3, Unknown conditional cache size: 0, Unknown unconditional cache size: 3, 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: 146, independent: 92, independent conditional: 92, 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: 146, independent: 92, independent conditional: 0, independent unconditional: 92, 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: 146, independent: 92, independent conditional: 0, independent unconditional: 92, 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: 146, independent: 92, independent conditional: 0, independent unconditional: 92, 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: 68, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 68, independent: 44, independent conditional: 0, independent unconditional: 44, 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: 2252, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 2135, unknown conditional: 0, unknown unconditional: 2135] ], Cache Queries: [ total: 146, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 69, unknown conditional: 0, unknown unconditional: 69] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, 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.5s, 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: 106, independent: 86, independent conditional: 86, 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: 106, independent: 86, independent conditional: 8, independent unconditional: 78, 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: 106, independent: 86, independent conditional: 8, independent unconditional: 78, 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: 106, independent: 86, independent conditional: 8, independent unconditional: 78, 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: 4530, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 170, dependent conditional: 170, dependent unconditional: 0, unknown: 4360, unknown conditional: 4360, unknown unconditional: 0] ], Cache Queries: [ total: 106, independent: 79, independent conditional: 8, independent unconditional: 71, 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): 77, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, 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: 676, independent: 585, independent conditional: 585, 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: 676, independent: 585, independent conditional: 60, independent unconditional: 525, 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: 694, independent: 585, independent conditional: 60, independent unconditional: 525, 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: 694, independent: 585, independent conditional: 60, independent unconditional: 525, 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: 1, independent unconditional: 31, 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: 24, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 23, dependent conditional: 18, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 694, independent: 553, independent conditional: 59, independent unconditional: 494, dependent: 98, dependent conditional: 30, dependent unconditional: 68, unknown: 43, unknown conditional: 7, unknown unconditional: 36] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 99, Positive conditional cache size: 1, Positive unconditional cache size: 98, 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: 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] , 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: 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: 17, independent conditional: 0, independent unconditional: 17, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 100, Positive conditional cache size: 1, Positive unconditional cache size: 99, 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: 3.5s, 50 PlacesBefore, 47 PlacesAfterwards, 53 TransitionsBefore, 50 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 63, independent: 34, independent conditional: 22, independent unconditional: 12, dependent: 23, dependent conditional: 9, dependent unconditional: 14, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 34, independent conditional: 22, independent unconditional: 12, dependent: 23, dependent conditional: 9, dependent unconditional: 14, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 34, independent conditional: 22, independent unconditional: 12, dependent: 23, dependent conditional: 9, dependent unconditional: 14, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 16, independent conditional: 15, independent unconditional: 1, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2616, independent: 402, independent conditional: 326, independent unconditional: 76, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 2196, unknown conditional: 0, unknown unconditional: 2196] ], Cache Queries: [ total: 63, independent: 18, independent conditional: 7, independent unconditional: 11, dependent: 20, dependent conditional: 6, dependent unconditional: 14, unknown: 25, unknown conditional: 18, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 128, Positive conditional cache size: 16, Positive unconditional cache size: 112, Negative cache size: 36, Negative conditional cache size: 12, Negative unconditional cache size: 24, Unknown cache size: 4, Unknown conditional cache size: 2, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 172, independent: 151, independent conditional: 151, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 172, independent: 151, independent conditional: 91, independent unconditional: 60, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 172, independent: 151, independent conditional: 91, independent unconditional: 60, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 172, independent: 151, independent conditional: 91, independent unconditional: 60, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 2, independent unconditional: 2, 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: 7, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 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: 172, independent: 147, independent conditional: 89, independent unconditional: 58, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 132, Positive conditional cache size: 18, Positive unconditional cache size: 114, Negative cache size: 39, Negative conditional cache size: 15, Negative unconditional cache size: 24, Unknown cache size: 4, Unknown conditional cache size: 2, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 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: 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: 24, independent: 16, independent conditional: 9, independent unconditional: 7, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 134, Positive conditional cache size: 19, Positive unconditional cache size: 115, Negative cache size: 40, Negative conditional cache size: 16, Negative unconditional cache size: 24, Unknown cache size: 4, Unknown conditional cache size: 2, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 51 PlacesBefore, 47 PlacesAfterwards, 46 TransitionsBefore, 42 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 98, independent: 79, independent conditional: 79, 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: 98, independent: 79, independent conditional: 31, independent unconditional: 48, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 98, independent: 79, independent conditional: 31, independent unconditional: 48, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 98, independent: 79, independent conditional: 31, independent unconditional: 48, dependent: 19, dependent conditional: 1, dependent unconditional: 18, 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: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 1, dependent unconditional: 2, 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: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 98, independent: 74, independent conditional: 27, independent unconditional: 47, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 8, unknown conditional: 5, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 149, Positive conditional cache size: 23, Positive unconditional cache size: 126, Negative cache size: 43, Negative conditional cache size: 17, Negative unconditional cache size: 26, Unknown cache size: 4, Unknown conditional cache size: 2, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 53 PlacesBefore, 51 PlacesAfterwards, 49 TransitionsBefore, 47 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64, independent: 35, independent conditional: 25, independent unconditional: 10, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 87, independent: 35, independent conditional: 25, independent unconditional: 10, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 87, independent: 35, independent conditional: 25, independent unconditional: 10, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, independent: 35, independent conditional: 25, independent unconditional: 10, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 159, Positive conditional cache size: 23, Positive unconditional cache size: 136, Negative cache size: 51, Negative conditional cache size: 25, Negative unconditional cache size: 26, Unknown cache size: 4, Unknown conditional cache size: 2, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 56 PlacesBefore, 55 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 41, independent: 9, independent conditional: 8, independent unconditional: 1, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 102, independent: 9, independent conditional: 8, independent unconditional: 1, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102, independent: 9, independent conditional: 8, independent unconditional: 1, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 88, dependent conditional: 88, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 162, Positive conditional cache size: 24, Positive unconditional cache size: 138, Negative cache size: 56, Negative conditional cache size: 30, Negative unconditional cache size: 26, Unknown cache size: 4, Unknown conditional cache size: 2, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.2s, 65 PlacesBefore, 64 PlacesAfterwards, 74 TransitionsBefore, 73 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10158, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 10104, unknown conditional: 10104, unknown unconditional: 0] ], Cache Queries: [ total: 78, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 23, unknown conditional: 23, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 175, Positive conditional cache size: 28, Positive unconditional cache size: 147, Negative cache size: 65, Negative conditional cache size: 39, Negative unconditional cache size: 26, Unknown cache size: 9, Unknown conditional cache size: 7, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 72 PlacesBefore, 72 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 5, unknown conditional: 5, 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: 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: 44, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 243, Positive cache size: 175, Positive conditional cache size: 28, Positive unconditional cache size: 147, Negative cache size: 68, Negative conditional cache size: 42, Negative unconditional cache size: 26, Unknown cache size: 9, Unknown conditional cache size: 7, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] ], Cache Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 244, Positive cache size: 175, Positive conditional cache size: 28, Positive unconditional cache size: 147, Negative cache size: 69, Negative conditional cache size: 43, Negative unconditional cache size: 26, Unknown cache size: 9, Unknown conditional cache size: 7, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 73 PlacesBefore, 73 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 52 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 80, dependent conditional: 80, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 80, dependent conditional: 80, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, 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: 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: 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: 82, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 79, dependent conditional: 79, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 249, Positive cache size: 179, Positive conditional cache size: 30, Positive unconditional cache size: 149, Negative cache size: 70, Negative conditional cache size: 44, Negative unconditional cache size: 26, Unknown cache size: 9, Unknown conditional cache size: 7, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 75 PlacesBefore, 73 PlacesAfterwards, 74 TransitionsBefore, 73 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 36, dependent conditional: 36, 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: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 249, Positive cache size: 179, Positive conditional cache size: 30, Positive unconditional cache size: 149, Negative cache size: 70, Negative conditional cache size: 44, Negative unconditional cache size: 26, Unknown cache size: 9, Unknown conditional cache size: 7, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ 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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ 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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ 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] , 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: 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] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 179, Positive conditional cache size: 30, Positive unconditional cache size: 149, Negative cache size: 71, Negative conditional cache size: 45, Negative unconditional cache size: 26, Unknown cache size: 9, Unknown conditional cache size: 7, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 74 PlacesBefore, 73 PlacesAfterwards, 60 TransitionsBefore, 59 TransitionsAfterwards, 24 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 3, 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: 5, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 185, Positive conditional cache size: 33, Positive unconditional cache size: 152, Negative cache size: 73, Negative conditional cache size: 47, Negative unconditional cache size: 26, Unknown cache size: 9, Unknown conditional cache size: 7, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 14, dependent conditional: 14, 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: 26, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 185, Positive conditional cache size: 33, Positive unconditional cache size: 152, Negative cache size: 73, Negative conditional cache size: 47, Negative unconditional cache size: 26, Unknown cache size: 9, Unknown conditional cache size: 7, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 69 PlacesBefore, 67 PlacesAfterwards, 51 TransitionsBefore, 49 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 8, dependent conditional: 8, dependent unconditional: 0, 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: 17, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 190, Positive conditional cache size: 33, Positive unconditional cache size: 157, Negative cache size: 74, Negative conditional cache size: 48, Negative unconditional cache size: 26, Unknown cache size: 9, Unknown conditional cache size: 7, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] ], Cache 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] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 190, Positive conditional cache size: 33, Positive unconditional cache size: 157, Negative cache size: 75, Negative conditional cache size: 49, Negative unconditional cache size: 26, Unknown cache size: 9, Unknown conditional cache size: 7, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 61 PlacesBefore, 61 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ 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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ 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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ 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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 268, Positive cache size: 193, Positive conditional cache size: 34, Positive unconditional cache size: 159, Negative cache size: 75, Negative conditional cache size: 49, Negative unconditional cache size: 26, Unknown cache size: 9, Unknown conditional cache size: 7, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 54 PlacesBefore, 50 PlacesAfterwards, 36 TransitionsBefore, 33 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 277, Positive cache size: 202, Positive conditional cache size: 37, Positive unconditional cache size: 165, Negative cache size: 75, Negative conditional cache size: 49, Negative unconditional cache size: 26, Unknown cache size: 9, Unknown conditional cache size: 7, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 2 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): 277, Positive cache size: 202, Positive conditional cache size: 37, Positive unconditional cache size: 165, Negative cache size: 75, Negative conditional cache size: 49, Negative unconditional cache size: 26, Unknown cache size: 9, Unknown conditional cache size: 7, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 41 PlacesBefore, 40 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 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): 279, Positive cache size: 204, Positive conditional cache size: 37, Positive unconditional cache size: 167, Negative cache size: 75, Negative conditional cache size: 49, Negative unconditional cache size: 26, Unknown cache size: 9, Unknown conditional cache size: 7, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.4s, 35 PlacesBefore, 35 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 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): 280, Positive cache size: 205, Positive conditional cache size: 37, Positive unconditional cache size: 168, Negative cache size: 75, Negative conditional cache size: 49, Negative unconditional cache size: 26, Unknown cache size: 9, Unknown conditional cache size: 7, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.8s, 28 PlacesBefore, 25 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 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): 283, Positive cache size: 208, Positive conditional cache size: 37, Positive unconditional cache size: 171, Negative cache size: 75, Negative conditional cache size: 49, Negative unconditional cache size: 26, Unknown cache size: 9, Unknown conditional cache size: 7, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 17 PlacesBefore, 17 PlacesAfterwards, 9 TransitionsBefore, 9 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): 283, Positive cache size: 208, Positive conditional cache size: 37, Positive unconditional cache size: 171, Negative cache size: 75, Negative conditional cache size: 49, Negative unconditional cache size: 26, Unknown cache size: 9, Unknown conditional cache size: 7, Unknown unconditional cache size: 2, 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): 283, Positive cache size: 208, Positive conditional cache size: 37, Positive unconditional cache size: 171, Negative cache size: 75, Negative conditional cache size: 49, Negative unconditional cache size: 26, Unknown cache size: 9, Unknown conditional cache size: 7, Unknown unconditional cache size: 2, 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, 181 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: 116.8s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 19.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 584 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 584 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 392 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5552 IncrementalHoareTripleChecker+Invalid, 5944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 392 mSolverCounterUnsat, 16 mSDtfsCounter, 5552 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=998occurred in iteration=14, InterpolantAutomatonStates: 188, 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.7s SatisfiabilityAnalysisTime, 18.7s InterpolantComputationTime, 352 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 7342 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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:20,624 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...