/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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -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-a802222-m [2022-12-13 06:28:52,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:28:52,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:28:52,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:28:52,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:28:52,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:28:52,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:28:52,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:28:52,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:28:52,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:28:52,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:28:52,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:28:52,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:28:52,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:28:52,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:28:52,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:28:52,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:28:52,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:28:52,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:28:52,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:28:52,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:28:52,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:28:52,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:28:52,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:28:52,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:28:52,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:28:52,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:28:52,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:28:52,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:28:52,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:28:52,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:28:52,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:28:52,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:28:52,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:28:52,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:28:52,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:28:52,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:28:52,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:28:52,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:28:52,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:28:52,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:28:52,877 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-RepeatedSemanticLbe.epf [2022-12-13 06:28:52,899 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:28:52,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:28:52,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:28:52,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:28:52,900 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:28:52,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:28:52,900 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:28:52,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:28:52,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:28:52,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:28:52,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:28:52,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:28:52,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:28:52,901 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:28:52,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:28:52,901 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:28:52,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:28:52,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:28:52,901 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:28:52,902 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:28:52,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:28:52,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:28:52,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:28:52,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:28:52,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:28:52,902 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:28:52,902 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:28:52,902 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 06:28:52,902 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 06:28:53,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:28:53,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:28:53,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:28:53,193 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:28:53,193 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:28:53,194 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-13 06:28:54,221 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:28:54,501 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:28:54,502 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2022-12-13 06:28:54,520 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c33590542/465ce8da148f47009bc5ec272ce2c071/FLAG22d7ce643 [2022-12-13 06:28:54,533 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c33590542/465ce8da148f47009bc5ec272ce2c071 [2022-12-13 06:28:54,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:28:54,535 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 06:28:54,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:28:54,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:28:54,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:28:54,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:28:54" (1/1) ... [2022-12-13 06:28:54,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d697b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:54, skipping insertion in model container [2022-12-13 06:28:54,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:28:54" (1/1) ... [2022-12-13 06:28:54,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:28:54,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:28:55,094 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-13 06:28:55,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:28:55,143 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:28:55,186 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-13 06:28:55,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:28:55,276 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:28:55,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:55 WrapperNode [2022-12-13 06:28:55,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:28:55,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:28:55,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:28:55,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:28:55,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:55" (1/1) ... [2022-12-13 06:28:55,302 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:55" (1/1) ... [2022-12-13 06:28:55,325 INFO L138 Inliner]: procedures = 482, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 134 [2022-12-13 06:28:55,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:28:55,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:28:55,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:28:55,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:28:55,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:55" (1/1) ... [2022-12-13 06:28:55,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:55" (1/1) ... [2022-12-13 06:28:55,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:55" (1/1) ... [2022-12-13 06:28:55,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:55" (1/1) ... [2022-12-13 06:28:55,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:55" (1/1) ... [2022-12-13 06:28:55,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:55" (1/1) ... [2022-12-13 06:28:55,367 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:55" (1/1) ... [2022-12-13 06:28:55,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:55" (1/1) ... [2022-12-13 06:28:55,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:28:55,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:28:55,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:28:55,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:28:55,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:55" (1/1) ... [2022-12-13 06:28:55,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:28:55,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 06:28:55,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 06:28:55,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 06:28:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:28:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 06:28:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 06:28:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:28:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 06:28:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:28:55,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:28:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-12-13 06:28:55,528 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-12-13 06:28:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:28:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:28:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:28:55,529 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 06:28:55,761 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 06:28:55,762 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:28:55,939 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 06:28:55,950 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:28:55,951 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 06:28:55,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:28:55 BoogieIcfgContainer [2022-12-13 06:28:55,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:28:55,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:28:55,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:28:55,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:28:55,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:28:54" (1/3) ... [2022-12-13 06:28:55,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab16156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:28:55, skipping insertion in model container [2022-12-13 06:28:55,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:55" (2/3) ... [2022-12-13 06:28:55,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab16156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:28:55, skipping insertion in model container [2022-12-13 06:28:55,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:28:55" (3/3) ... [2022-12-13 06:28:55,963 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2022-12-13 06:28:55,993 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:28:55,993 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-13 06:28:55,993 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:28:56,065 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 06:28:56,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 173 transitions, 362 flow [2022-12-13 06:28:56,179 INFO L130 PetriNetUnfolder]: 10/211 cut-off events. [2022-12-13 06:28:56,180 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 06:28:56,184 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-13 06:28:56,184 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 173 transitions, 362 flow [2022-12-13 06:28:56,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 161 transitions, 334 flow [2022-12-13 06:28:56,189 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:28:56,201 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 161 transitions, 334 flow [2022-12-13 06:28:56,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 161 transitions, 334 flow [2022-12-13 06:28:56,256 INFO L130 PetriNetUnfolder]: 7/192 cut-off events. [2022-12-13 06:28:56,257 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 06:28:56,258 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-13 06:28:56,263 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 161 transitions, 334 flow [2022-12-13 06:28:56,263 INFO L226 LiptonReduction]: Number of co-enabled transitions 2392 [2022-12-13 06:29:25,295 INFO L241 LiptonReduction]: Total number of compositions: 134 [2022-12-13 06:29:25,307 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 06:29:25,312 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;@1bd7a2a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:29:25,312 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 06:29:25,313 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 06:29:25,313 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:29:25,313 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:25,313 INFO L214 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 06:29:25,314 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-13 06:29:25,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:25,325 INFO L85 PathProgramCache]: Analyzing trace with hash 595, now seen corresponding path program 1 times [2022-12-13 06:29:25,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:25,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436949787] [2022-12-13 06:29:25,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:25,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:29:25,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:25,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436949787] [2022-12-13 06:29:25,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436949787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:25,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:25,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 06:29:25,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609640401] [2022-12-13 06:29:25,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:25,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 06:29:25,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:25,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 06:29:25,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 06:29:25,583 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 49 [2022-12-13 06:29:25,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 110 flow. Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:29:25,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:25,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 49 [2022-12-13 06:29:25,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:25,865 INFO L130 PetriNetUnfolder]: 1332/2421 cut-off events. [2022-12-13 06:29:25,866 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-13 06:29:25,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4625 conditions, 2421 events. 1332/2421 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 16675 event pairs, 1331 based on Foata normal form. 111/1455 useless extension candidates. Maximal degree in co-relation 4467. Up to 2166 conditions per place. [2022-12-13 06:29:25,878 INFO L137 encePairwiseOnDemand]: 46/49 looper letters, 38 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2022-12-13 06:29:25,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 180 flow [2022-12-13 06:29:25,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:29:25,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 06:29:25,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2022-12-13 06:29:25,887 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5816326530612245 [2022-12-13 06:29:25,890 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2022-12-13 06:29:25,890 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 46 transitions, 180 flow [2022-12-13 06:29:25,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 46 transitions, 180 flow [2022-12-13 06:29:25,904 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:25,905 INFO L89 Accepts]: Start accepts. Operand has 52 places, 46 transitions, 180 flow [2022-12-13 06:29:25,907 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:25,907 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:25,907 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 46 transitions, 180 flow [2022-12-13 06:29:25,918 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 180 flow [2022-12-13 06:29:25,918 INFO L226 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-13 06:29:25,952 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:29:25,953 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:29:25,956 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:29:25,956 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:29:36,989 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:29:36,990 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11086 [2022-12-13 06:29:36,991 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 176 flow [2022-12-13 06:29:36,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:29:36,991 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:36,991 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 06:29:36,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:29:36,992 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-13 06:29:36,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:36,992 INFO L85 PathProgramCache]: Analyzing trace with hash 18534052, now seen corresponding path program 1 times [2022-12-13 06:29:36,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:36,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071606124] [2022-12-13 06:29:36,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:36,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:29:37,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:37,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071606124] [2022-12-13 06:29:37,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071606124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:37,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:37,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:29:37,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259422431] [2022-12-13 06:29:37,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:37,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:29:37,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:37,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:29:37,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:29:37,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 45 [2022-12-13 06:29:37,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-13 06:29:37,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:37,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 45 [2022-12-13 06:29:37,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:37,928 INFO L130 PetriNetUnfolder]: 2867/4717 cut-off events. [2022-12-13 06:29:37,928 INFO L131 PetriNetUnfolder]: For 364/364 co-relation queries the response was YES. [2022-12-13 06:29:37,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13138 conditions, 4717 events. 2867/4717 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 29330 event pairs, 1362 based on Foata normal form. 0/3006 useless extension candidates. Maximal degree in co-relation 12882. Up to 3745 conditions per place. [2022-12-13 06:29:37,945 INFO L137 encePairwiseOnDemand]: 36/45 looper letters, 60 selfloop transitions, 8 changer transitions 0/71 dead transitions. [2022-12-13 06:29:37,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 406 flow [2022-12-13 06:29:37,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:29:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:29:37,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-12-13 06:29:37,949 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2022-12-13 06:29:37,950 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2022-12-13 06:29:37,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 71 transitions, 406 flow [2022-12-13 06:29:37,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 71 transitions, 406 flow [2022-12-13 06:29:37,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:37,980 INFO L89 Accepts]: Start accepts. Operand has 53 places, 71 transitions, 406 flow [2022-12-13 06:29:37,981 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:37,981 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:37,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 71 transitions, 406 flow [2022-12-13 06:29:37,984 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 71 transitions, 406 flow [2022-12-13 06:29:37,984 INFO L226 LiptonReduction]: Number of co-enabled transitions 220 [2022-12-13 06:29:37,987 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:37,988 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 06:29:37,988 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 71 transitions, 406 flow [2022-12-13 06:29:37,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-13 06:29:37,990 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:37,990 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 06:29:37,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:29:37,990 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-13 06:29:37,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:37,991 INFO L85 PathProgramCache]: Analyzing trace with hash 574555670, now seen corresponding path program 1 times [2022-12-13 06:29:37,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:37,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321305837] [2022-12-13 06:29:37,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:37,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:29:38,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:38,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321305837] [2022-12-13 06:29:38,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321305837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:38,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:38,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:29:38,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790920201] [2022-12-13 06:29:38,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:38,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:29:38,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:38,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:29:38,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:29:38,175 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 45 [2022-12-13 06:29:38,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 71 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-13 06:29:38,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:38,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 45 [2022-12-13 06:29:38,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:38,645 INFO L130 PetriNetUnfolder]: 3105/5148 cut-off events. [2022-12-13 06:29:38,646 INFO L131 PetriNetUnfolder]: For 428/428 co-relation queries the response was YES. [2022-12-13 06:29:38,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19424 conditions, 5148 events. 3105/5148 cut-off events. For 428/428 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 32670 event pairs, 1426 based on Foata normal form. 277/3464 useless extension candidates. Maximal degree in co-relation 19090. Up to 4086 conditions per place. [2022-12-13 06:29:38,665 INFO L137 encePairwiseOnDemand]: 37/45 looper letters, 99 selfloop transitions, 14 changer transitions 2/118 dead transitions. [2022-12-13 06:29:38,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 118 transitions, 902 flow [2022-12-13 06:29:38,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:29:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:29:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-13 06:29:38,667 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5703703703703704 [2022-12-13 06:29:38,667 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2022-12-13 06:29:38,667 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 118 transitions, 902 flow [2022-12-13 06:29:38,679 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 116 transitions, 886 flow [2022-12-13 06:29:38,693 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:38,694 INFO L89 Accepts]: Start accepts. Operand has 55 places, 116 transitions, 886 flow [2022-12-13 06:29:38,694 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:38,694 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:38,694 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 116 transitions, 886 flow [2022-12-13 06:29:38,697 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 116 transitions, 886 flow [2022-12-13 06:29:38,697 INFO L226 LiptonReduction]: Number of co-enabled transitions 342 [2022-12-13 06:29:38,747 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:29:38,749 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-13 06:29:38,749 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 116 transitions, 886 flow [2022-12-13 06:29:38,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-13 06:29:38,749 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:38,749 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:38,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 06:29:38,749 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-13 06:29:38,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:38,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1078248294, now seen corresponding path program 1 times [2022-12-13 06:29:38,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:38,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168715007] [2022-12-13 06:29:38,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:38,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:29:38,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:38,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168715007] [2022-12-13 06:29:38,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168715007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:38,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:38,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:29:38,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359407593] [2022-12-13 06:29:38,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:38,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:29:38,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:38,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:29:38,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:29:38,800 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2022-12-13 06:29:38,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 116 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:29:38,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:38,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2022-12-13 06:29:38,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:39,038 INFO L130 PetriNetUnfolder]: 763/1317 cut-off events. [2022-12-13 06:29:39,039 INFO L131 PetriNetUnfolder]: For 435/435 co-relation queries the response was YES. [2022-12-13 06:29:39,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6233 conditions, 1317 events. 763/1317 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6588 event pairs, 262 based on Foata normal form. 0/878 useless extension candidates. Maximal degree in co-relation 5853. Up to 1298 conditions per place. [2022-12-13 06:29:39,042 INFO L137 encePairwiseOnDemand]: 42/44 looper letters, 25 selfloop transitions, 1 changer transitions 25/57 dead transitions. [2022-12-13 06:29:39,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 542 flow [2022-12-13 06:29:39,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:29:39,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:29:39,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-13 06:29:39,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2022-12-13 06:29:39,057 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2022-12-13 06:29:39,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 57 transitions, 542 flow [2022-12-13 06:29:39,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 32 transitions, 296 flow [2022-12-13 06:29:39,065 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:39,065 INFO L89 Accepts]: Start accepts. Operand has 37 places, 32 transitions, 296 flow [2022-12-13 06:29:39,066 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:39,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:39,066 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 32 transitions, 296 flow [2022-12-13 06:29:39,067 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 32 transitions, 296 flow [2022-12-13 06:29:39,067 INFO L226 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-13 06:29:39,185 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 06:29:39,186 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 06:29:39,186 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 296 flow [2022-12-13 06:29:39,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:29:39,186 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:39,186 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:39,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 06:29:39,186 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-13 06:29:39,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:39,187 INFO L85 PathProgramCache]: Analyzing trace with hash 246931166, now seen corresponding path program 1 times [2022-12-13 06:29:39,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:39,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103626139] [2022-12-13 06:29:39,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:39,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:29:39,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:39,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103626139] [2022-12-13 06:29:39,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103626139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:39,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:39,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:29:39,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026648397] [2022-12-13 06:29:39,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:39,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:29:39,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:39,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:29:39,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:29:39,611 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-13 06:29:39,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:29:39,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:39,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-13 06:29:39,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:39,691 INFO L130 PetriNetUnfolder]: 204/394 cut-off events. [2022-12-13 06:29:39,692 INFO L131 PetriNetUnfolder]: For 429/429 co-relation queries the response was YES. [2022-12-13 06:29:39,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2116 conditions, 394 events. 204/394 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1604 event pairs, 54 based on Foata normal form. 12/405 useless extension candidates. Maximal degree in co-relation 1867. Up to 371 conditions per place. [2022-12-13 06:29:39,693 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 38 selfloop transitions, 6 changer transitions 2/49 dead transitions. [2022-12-13 06:29:39,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 545 flow [2022-12-13 06:29:39,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:29:39,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:29:39,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-13 06:29:39,694 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2022-12-13 06:29:39,695 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -14 predicate places. [2022-12-13 06:29:39,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 49 transitions, 545 flow [2022-12-13 06:29:39,696 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 47 transitions, 537 flow [2022-12-13 06:29:39,697 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:39,697 INFO L89 Accepts]: Start accepts. Operand has 38 places, 47 transitions, 537 flow [2022-12-13 06:29:39,698 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:39,698 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:39,699 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 47 transitions, 537 flow [2022-12-13 06:29:39,699 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 47 transitions, 537 flow [2022-12-13 06:29:39,699 INFO L226 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-13 06:29:39,733 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:29:39,734 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 06:29:39,734 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 47 transitions, 537 flow [2022-12-13 06:29:39,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:29:39,734 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:39,734 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:39,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 06:29:39,735 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:39,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:39,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2044414816, now seen corresponding path program 1 times [2022-12-13 06:29:39,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:39,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123528159] [2022-12-13 06:29:39,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:39,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:29:40,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:40,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123528159] [2022-12-13 06:29:40,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123528159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:40,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:40,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:29:40,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111129512] [2022-12-13 06:29:40,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:40,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:29:40,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:40,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:29:40,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:29:40,083 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-13 06:29:40,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 47 transitions, 537 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:29:40,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:40,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-13 06:29:40,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:40,147 INFO L130 PetriNetUnfolder]: 66/163 cut-off events. [2022-12-13 06:29:40,148 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES. [2022-12-13 06:29:40,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 163 events. 66/163 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 524 event pairs, 10 based on Foata normal form. 12/174 useless extension candidates. Maximal degree in co-relation 803. Up to 161 conditions per place. [2022-12-13 06:29:40,149 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 32 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2022-12-13 06:29:40,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 536 flow [2022-12-13 06:29:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:29:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:29:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-13 06:29:40,150 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2022-12-13 06:29:40,153 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -13 predicate places. [2022-12-13 06:29:40,153 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 40 transitions, 536 flow [2022-12-13 06:29:40,154 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 40 transitions, 536 flow [2022-12-13 06:29:40,155 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:40,155 INFO L89 Accepts]: Start accepts. Operand has 40 places, 40 transitions, 536 flow [2022-12-13 06:29:40,157 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:40,157 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:40,157 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 40 transitions, 536 flow [2022-12-13 06:29:40,158 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 40 transitions, 536 flow [2022-12-13 06:29:40,158 INFO L226 LiptonReduction]: Number of co-enabled transitions 62 [2022-12-13 06:29:40,159 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:40,160 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 06:29:40,160 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 536 flow [2022-12-13 06:29:40,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:29:40,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:40,161 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:40,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 06:29:40,161 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:40,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1108393448, now seen corresponding path program 2 times [2022-12-13 06:29:40,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:40,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479860776] [2022-12-13 06:29:40,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:40,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:29:41,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:41,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479860776] [2022-12-13 06:29:41,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479860776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:41,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:41,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 06:29:41,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771764328] [2022-12-13 06:29:41,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:41,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 06:29:41,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:41,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 06:29:41,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-12-13 06:29:41,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-13 06:29:41,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 536 flow. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:29:41,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:41,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-13 06:29:41,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:42,128 INFO L130 PetriNetUnfolder]: 104/255 cut-off events. [2022-12-13 06:29:42,128 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2022-12-13 06:29:42,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1966 conditions, 255 events. 104/255 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1025 event pairs, 3 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 1384. Up to 252 conditions per place. [2022-12-13 06:29:42,130 INFO L137 encePairwiseOnDemand]: 11/26 looper letters, 88 selfloop transitions, 27 changer transitions 0/117 dead transitions. [2022-12-13 06:29:42,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 117 transitions, 1862 flow [2022-12-13 06:29:42,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:29:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:29:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2022-12-13 06:29:42,131 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33136094674556216 [2022-12-13 06:29:42,131 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2022-12-13 06:29:42,132 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 117 transitions, 1862 flow [2022-12-13 06:29:42,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 117 transitions, 1862 flow [2022-12-13 06:29:42,148 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:42,148 INFO L89 Accepts]: Start accepts. Operand has 52 places, 117 transitions, 1862 flow [2022-12-13 06:29:42,149 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:42,149 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:42,149 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 117 transitions, 1862 flow [2022-12-13 06:29:42,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 117 transitions, 1862 flow [2022-12-13 06:29:42,151 INFO L226 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-13 06:29:42,153 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [537] L1750-4-->L1735: Formula: (and (= (store |v_#length_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_61| 4) |v_#length_61|) (= (select |v_#valid_97| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_61|) 0) (= |v_ULTIMATE.start_main_~#data~1#1.offset_95| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_61| 0)) (= (store |v_#valid_97| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_61| 1) |v_#valid_96|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_30| (select (select |v_#memory_int_260| |v_~#t1~0.base_19|) |v_~#t1~0.offset_19|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_42| 0) (< |v_#StackHeapBarrier_28| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_61|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53| 0) (= |v_ULTIMATE.start_main_~#data~1#1.base_95| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_28|, ~#t1~0.base=|v_~#t1~0.base_19|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_42|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_260|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_95|, ~#t1~0.offset=|v_~#t1~0.offset_19|, #length=|v_#length_62|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_95|} OutVars{ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_30|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_32|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_61|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_32|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_95|, ~#t1~0.offset=|v_~#t1~0.offset_19|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_26|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53|, #StackHeapBarrier=|v_#StackHeapBarrier_28|, ~#t1~0.base=|v_~#t1~0.base_19|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_24|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_32|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_42|, #valid=|v_#valid_96|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_32|, #memory_int=|v_#memory_int_260|, #length=|v_#length_61|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_95|} 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_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length] and [561] L1712-1-->my_callbackEXIT: Formula: (and (= |v_#pthreadsMutex_193| (store |v_#pthreadsMutex_194| v_my_callbackThread1of1ForFork0_~data~0.base_105 (store (select |v_#pthreadsMutex_194| v_my_callbackThread1of1ForFork0_~data~0.base_105) v_my_callbackThread1of1ForFork0_~data~0.offset_105 0))) (= |v_my_callbackThread1of1ForFork0_#res.base_9| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_9| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_194|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_105, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_105} OutVars{#pthreadsMutex=|v_#pthreadsMutex_193|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_105, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_9|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_45|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_9|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_105} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, my_callbackThread1of1ForFork0_#res.offset] [2022-12-13 06:29:42,240 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:29:42,241 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 06:29:42,241 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 116 transitions, 1848 flow [2022-12-13 06:29:42,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:29:42,241 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:42,241 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:42,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 06:29:42,241 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-13 06:29:42,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1177169114, now seen corresponding path program 1 times [2022-12-13 06:29:42,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:42,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696975616] [2022-12-13 06:29:42,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:42,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:29:42,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:42,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696975616] [2022-12-13 06:29:42,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696975616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:42,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:42,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 06:29:42,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837108530] [2022-12-13 06:29:42,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:42,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 06:29:42,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:42,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 06:29:42,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 06:29:42,746 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-13 06:29:42,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 116 transitions, 1848 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:29:42,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:42,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-13 06:29:42,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:43,087 INFO L130 PetriNetUnfolder]: 113/292 cut-off events. [2022-12-13 06:29:43,087 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2022-12-13 06:29:43,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2556 conditions, 292 events. 113/292 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1284 event pairs, 0 based on Foata normal form. 1/291 useless extension candidates. Maximal degree in co-relation 1735. Up to 289 conditions per place. [2022-12-13 06:29:43,089 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 122 selfloop transitions, 31 changer transitions 22/177 dead transitions. [2022-12-13 06:29:43,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 177 transitions, 3147 flow [2022-12-13 06:29:43,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 06:29:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 06:29:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-12-13 06:29:43,092 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34074074074074073 [2022-12-13 06:29:43,102 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2022-12-13 06:29:43,103 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 177 transitions, 3147 flow [2022-12-13 06:29:43,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 155 transitions, 2731 flow [2022-12-13 06:29:43,107 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:43,107 INFO L89 Accepts]: Start accepts. Operand has 57 places, 155 transitions, 2731 flow [2022-12-13 06:29:43,110 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:43,110 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:43,110 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 155 transitions, 2731 flow [2022-12-13 06:29:43,112 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 155 transitions, 2731 flow [2022-12-13 06:29:43,112 INFO L226 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-13 06:29:43,117 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:29:43,118 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:29:43,119 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:29:43,120 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:29:43,299 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:29:43,303 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-13 06:29:43,303 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 154 transitions, 2713 flow [2022-12-13 06:29:43,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:29:43,303 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:43,303 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:43,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 06:29:43,304 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:43,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:43,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1541775428, now seen corresponding path program 3 times [2022-12-13 06:29:43,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:43,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894266903] [2022-12-13 06:29:43,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:43,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:44,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 06:29:44,015 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.InterpolantChecker.checkInductivity(InterpolantChecker.java:409) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:383) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:154) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:848) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:776) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-13 06:29:44,018 INFO L158 Benchmark]: Toolchain (without parser) took 49482.83ms. Allocated memory was 201.3MB in the beginning and 391.1MB in the end (delta: 189.8MB). Free memory was 174.2MB in the beginning and 197.4MB in the end (delta: -23.2MB). Peak memory consumption was 292.9MB. Max. memory is 8.0GB. [2022-12-13 06:29:44,018 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 201.3MB. Free memory is still 178.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:29:44,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 741.16ms. Allocated memory is still 201.3MB. Free memory was 174.2MB in the beginning and 117.6MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. [2022-12-13 06:29:44,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.52ms. Allocated memory is still 201.3MB. Free memory was 117.6MB in the beginning and 114.0MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 06:29:44,019 INFO L158 Benchmark]: Boogie Preprocessor took 62.97ms. Allocated memory is still 201.3MB. Free memory was 114.0MB in the beginning and 111.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 06:29:44,019 INFO L158 Benchmark]: RCFGBuilder took 563.27ms. Allocated memory was 201.3MB in the beginning and 242.2MB in the end (delta: 40.9MB). Free memory was 111.3MB in the beginning and 197.5MB in the end (delta: -86.1MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. [2022-12-13 06:29:44,019 INFO L158 Benchmark]: TraceAbstraction took 48063.23ms. Allocated memory was 242.2MB in the beginning and 391.1MB in the end (delta: 148.9MB). Free memory was 196.4MB in the beginning and 197.4MB in the end (delta: -1.0MB). Peak memory consumption was 273.7MB. Max. memory is 8.0GB. [2022-12-13 06:29:44,020 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.09ms. Allocated memory is still 201.3MB. Free memory is still 178.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 741.16ms. Allocated memory is still 201.3MB. Free memory was 174.2MB in the beginning and 117.6MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.52ms. Allocated memory is still 201.3MB. Free memory was 117.6MB in the beginning and 114.0MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.97ms. Allocated memory is still 201.3MB. Free memory was 114.0MB in the beginning and 111.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 563.27ms. Allocated memory was 201.3MB in the beginning and 242.2MB in the end (delta: 40.9MB). Free memory was 111.3MB in the beginning and 197.5MB in the end (delta: -86.1MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. * TraceAbstraction took 48063.23ms. Allocated memory was 242.2MB in the beginning and 391.1MB in the end (delta: 148.9MB). Free memory was 196.4MB in the beginning and 197.4MB in the end (delta: -1.0MB). Peak memory consumption was 273.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.0s, 161 PlacesBefore, 53 PlacesAfterwards, 161 TransitionsBefore, 49 TransitionsAfterwards, 2392 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 77 TrivialYvCompositions, 48 ConcurrentYvCompositions, 4 ChoiceCompositions, 134 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2459, independent: 2334, independent conditional: 2334, independent unconditional: 0, dependent: 108, dependent conditional: 108, dependent unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2459, independent: 2334, independent conditional: 0, independent unconditional: 2334, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2459, independent: 2334, independent conditional: 0, independent unconditional: 2334, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2459, independent: 2334, independent conditional: 0, independent unconditional: 2334, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1761, independent: 1714, independent conditional: 0, independent unconditional: 1714, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1761, independent: 1707, independent conditional: 0, independent unconditional: 1707, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16867, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 1824, dependent conditional: 0, dependent unconditional: 1824, unknown: 14968, unknown conditional: 0, unknown unconditional: 14968] ], Cache Queries: [ total: 2459, independent: 620, independent conditional: 0, independent unconditional: 620, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 1771, unknown conditional: 0, unknown unconditional: 1771] , Statistics on independence cache: Total cache size (in pairs): 3141, Positive cache size: 3101, Positive conditional cache size: 0, Positive unconditional cache size: 3101, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 7, Unknown conditional cache size: 0, Unknown unconditional cache size: 7, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.1s, 52 PlacesBefore, 51 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10871, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 10787, unknown conditional: 0, unknown unconditional: 10787] ], Cache Queries: [ total: 66, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 32, unknown conditional: 0, unknown unconditional: 32] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 220 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): 16, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 55 PlacesBefore, 55 PlacesAfterwards, 116 TransitionsBefore, 116 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 37 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 0, independent unconditional: 1, 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: 0, independent unconditional: 1, 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: 0, independent unconditional: 1, 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: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 21, Positive conditional cache size: 0, Positive unconditional cache size: 21, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 62 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): 23, Positive cache size: 21, Positive conditional cache size: 0, Positive unconditional cache size: 21, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 52 PlacesBefore, 51 PlacesAfterwards, 117 TransitionsBefore, 116 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 24, Positive cache size: 22, Positive conditional cache size: 1, Positive unconditional cache size: 21, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 57 PlacesBefore, 56 PlacesAfterwards, 155 TransitionsBefore, 154 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 0, independent unconditional: 1, 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: 0, independent unconditional: 1, 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: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 23, Positive conditional cache size: 1, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5, Eliminated conditions: 1, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.InterpolantChecker.checkInductivity(InterpolantChecker.java:409) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-13 06:29:44,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...