/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/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 05:54:32,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 05:54:32,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 05:54:32,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 05:54:32,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 05:54:32,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 05:54:32,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 05:54:32,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 05:54:32,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 05:54:32,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 05:54:32,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 05:54:32,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 05:54:32,918 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 05:54:32,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 05:54:32,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 05:54:32,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 05:54:32,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 05:54:32,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 05:54:32,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 05:54:32,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 05:54:32,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 05:54:32,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 05:54:32,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 05:54:32,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 05:54:32,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 05:54:32,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 05:54:32,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 05:54:32,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 05:54:32,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 05:54:32,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 05:54:32,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 05:54:32,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 05:54:32,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 05:54:32,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 05:54:32,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 05:54:32,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 05:54:32,945 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 05:54:32,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 05:54:32,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 05:54:32,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 05:54:32,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 05:54:32,947 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 05:54:32,972 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 05:54:32,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 05:54:32,974 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 05:54:32,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 05:54:32,974 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 05:54:32,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 05:54:32,975 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 05:54:32,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 05:54:32,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 05:54:32,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 05:54:32,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 05:54:32,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 05:54:32,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 05:54:32,976 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 05:54:32,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 05:54:32,976 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 05:54:32,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 05:54:32,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 05:54:32,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 05:54:32,976 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 05:54:32,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 05:54:32,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 05:54:32,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 05:54:32,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 05:54:32,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 05:54:32,977 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 05:54:32,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 05:54:32,977 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 05:54:32,977 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 05:54:33,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 05:54:33,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 05:54:33,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 05:54:33,243 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 05:54:33,243 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 05:54:33,244 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2022-12-13 05:54:34,191 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 05:54:34,467 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 05:54:34,468 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2022-12-13 05:54:34,484 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fcafb5ef/885c75b60fdb464e89903ded854d28f2/FLAGf580c1c33 [2022-12-13 05:54:34,494 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fcafb5ef/885c75b60fdb464e89903ded854d28f2 [2022-12-13 05:54:34,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 05:54:34,496 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 05:54:34,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 05:54:34,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 05:54:34,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 05:54:34,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:54:34" (1/1) ... [2022-12-13 05:54:34,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8a1ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:34, skipping insertion in model container [2022-12-13 05:54:34,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:54:34" (1/1) ... [2022-12-13 05:54:34,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 05:54:34,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 05:54:34,950 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2022-12-13 05:54:34,956 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2022-12-13 05:54:34,960 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2022-12-13 05:54:34,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 05:54:34,974 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 05:54:35,010 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2022-12-13 05:54:35,011 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2022-12-13 05:54:35,013 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2022-12-13 05:54:35,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 05:54:35,057 INFO L208 MainTranslator]: Completed translation [2022-12-13 05:54:35,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:35 WrapperNode [2022-12-13 05:54:35,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 05:54:35,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 05:54:35,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 05:54:35,059 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 05:54:35,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:35" (1/1) ... [2022-12-13 05:54:35,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:35" (1/1) ... [2022-12-13 05:54:35,120 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2022-12-13 05:54:35,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 05:54:35,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 05:54:35,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 05:54:35,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 05:54:35,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:35" (1/1) ... [2022-12-13 05:54:35,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:35" (1/1) ... [2022-12-13 05:54:35,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:35" (1/1) ... [2022-12-13 05:54:35,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:35" (1/1) ... [2022-12-13 05:54:35,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:35" (1/1) ... [2022-12-13 05:54:35,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:35" (1/1) ... [2022-12-13 05:54:35,169 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:35" (1/1) ... [2022-12-13 05:54:35,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:35" (1/1) ... [2022-12-13 05:54:35,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 05:54:35,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 05:54:35,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 05:54:35,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 05:54:35,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:35" (1/1) ... [2022-12-13 05:54:35,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 05:54:35,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:54:35,205 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 05:54:35,213 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 05:54:35,235 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 05:54:35,235 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 05:54:35,235 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 05:54:35,236 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 05:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 05:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 05:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 05:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 05:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 05:54:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 05:54:35,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 05:54:35,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 05:54:35,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 05:54:35,238 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 05:54:35,393 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 05:54:35,395 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 05:54:35,658 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 05:54:35,667 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 05:54:35,667 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 05:54:35,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:54:35 BoogieIcfgContainer [2022-12-13 05:54:35,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 05:54:35,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 05:54:35,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 05:54:35,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 05:54:35,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:54:34" (1/3) ... [2022-12-13 05:54:35,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a89a1b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:54:35, skipping insertion in model container [2022-12-13 05:54:35,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:54:35" (2/3) ... [2022-12-13 05:54:35,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a89a1b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:54:35, skipping insertion in model container [2022-12-13 05:54:35,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:54:35" (3/3) ... [2022-12-13 05:54:35,674 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2022-12-13 05:54:35,687 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 05:54:35,687 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-13 05:54:35,687 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 05:54:35,788 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 05:54:35,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 256 transitions, 528 flow [2022-12-13 05:54:35,926 INFO L130 PetriNetUnfolder]: 15/254 cut-off events. [2022-12-13 05:54:35,926 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 05:54:35,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 254 events. 15/254 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 363 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 183. Up to 2 conditions per place. [2022-12-13 05:54:35,937 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 256 transitions, 528 flow [2022-12-13 05:54:35,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 237 places, 245 transitions, 499 flow [2022-12-13 05:54:35,944 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:54:35,956 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 245 transitions, 499 flow [2022-12-13 05:54:35,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 245 transitions, 499 flow [2022-12-13 05:54:36,011 INFO L130 PetriNetUnfolder]: 15/245 cut-off events. [2022-12-13 05:54:36,011 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 05:54:36,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 245 events. 15/245 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 332 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 183. Up to 2 conditions per place. [2022-12-13 05:54:36,033 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 237 places, 245 transitions, 499 flow [2022-12-13 05:54:36,033 INFO L226 LiptonReduction]: Number of co-enabled transitions 15600 [2022-12-13 05:54:45,007 INFO L241 LiptonReduction]: Total number of compositions: 209 [2022-12-13 05:54:45,023 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 05:54:45,038 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;@19e6c94c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 05:54:45,039 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 05:54:45,040 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 05:54:45,040 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 05:54:45,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:54:45,041 INFO L214 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 05:54:45,042 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 05:54:45,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:54:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1091, now seen corresponding path program 1 times [2022-12-13 05:54:45,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:54:45,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184233052] [2022-12-13 05:54:45,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:45,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:54:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:45,146 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 05:54:45,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:54:45,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184233052] [2022-12-13 05:54:45,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184233052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:54:45,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:54:45,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 05:54:45,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627212005] [2022-12-13 05:54:45,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:54:45,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 05:54:45,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:54:45,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 05:54:45,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 05:54:45,173 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 186 [2022-12-13 05:54:45,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 186 transitions, 381 flow. Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:54:45,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:54:45,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 186 [2022-12-13 05:54:45,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:54:47,103 INFO L130 PetriNetUnfolder]: 21447/35704 cut-off events. [2022-12-13 05:54:47,104 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES. [2022-12-13 05:54:47,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69510 conditions, 35704 events. 21447/35704 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 1048. Compared 272428 event pairs, 19930 based on Foata normal form. 137/12742 useless extension candidates. Maximal degree in co-relation 69052. Up to 33577 conditions per place. [2022-12-13 05:54:47,245 INFO L137 encePairwiseOnDemand]: 176/186 looper letters, 149 selfloop transitions, 0 changer transitions 0/176 dead transitions. [2022-12-13 05:54:47,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 176 transitions, 659 flow [2022-12-13 05:54:47,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 05:54:47,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 05:54:47,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 213 transitions. [2022-12-13 05:54:47,257 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5725806451612904 [2022-12-13 05:54:47,260 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -5 predicate places. [2022-12-13 05:54:47,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 176 transitions, 659 flow [2022-12-13 05:54:47,326 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 176 transitions, 659 flow [2022-12-13 05:54:47,436 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:54:47,437 INFO L89 Accepts]: Start accepts. Operand has 176 places, 176 transitions, 659 flow [2022-12-13 05:54:47,441 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:54:47,441 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:54:47,441 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 176 transitions, 659 flow [2022-12-13 05:54:47,450 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 176 transitions, 659 flow [2022-12-13 05:54:47,450 INFO L226 LiptonReduction]: Number of co-enabled transitions 4236 [2022-12-13 05:54:47,557 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:54:47,563 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 05:54:47,563 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 176 transitions, 659 flow [2022-12-13 05:54:47,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:54:47,563 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:54:47,564 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:54:47,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 05:54:47,564 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 05:54:47,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:54:47,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1124677344, now seen corresponding path program 1 times [2022-12-13 05:54:47,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:54:47,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946432226] [2022-12-13 05:54:47,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:47,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:54:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:47,784 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 05:54:47,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:54:47,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946432226] [2022-12-13 05:54:47,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946432226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:54:47,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:54:47,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 05:54:47,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094994843] [2022-12-13 05:54:47,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:54:47,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 05:54:47,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:54:47,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 05:54:47,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 05:54:47,787 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 176 [2022-12-13 05:54:47,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 176 transitions, 659 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 05:54:47,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:54:47,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 176 [2022-12-13 05:54:47,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:54:49,208 INFO L130 PetriNetUnfolder]: 15162/25443 cut-off events. [2022-12-13 05:54:49,209 INFO L131 PetriNetUnfolder]: For 514/678 co-relation queries the response was YES. [2022-12-13 05:54:49,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73836 conditions, 25443 events. 15162/25443 cut-off events. For 514/678 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 173373 event pairs, 9031 based on Foata normal form. 544/9891 useless extension candidates. Maximal degree in co-relation 73033. Up to 23829 conditions per place. [2022-12-13 05:54:49,271 INFO L137 encePairwiseOnDemand]: 166/176 looper letters, 133 selfloop transitions, 3 changer transitions 76/236 dead transitions. [2022-12-13 05:54:49,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 236 transitions, 1327 flow [2022-12-13 05:54:49,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 05:54:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 05:54:49,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2022-12-13 05:54:49,273 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5511363636363636 [2022-12-13 05:54:49,273 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -3 predicate places. [2022-12-13 05:54:49,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 236 transitions, 1327 flow [2022-12-13 05:54:49,304 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 160 transitions, 873 flow [2022-12-13 05:54:49,445 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:54:49,445 INFO L89 Accepts]: Start accepts. Operand has 113 places, 160 transitions, 873 flow [2022-12-13 05:54:49,446 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:54:49,446 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:54:49,446 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 160 transitions, 873 flow [2022-12-13 05:54:49,450 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 160 transitions, 873 flow [2022-12-13 05:54:49,450 INFO L226 LiptonReduction]: Number of co-enabled transitions 2464 [2022-12-13 05:54:49,479 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:54:49,480 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 05:54:49,480 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 160 transitions, 873 flow [2022-12-13 05:54:49,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 05:54:49,480 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:54:49,480 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:54:49,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 05:54:49,481 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 05:54:49,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:54:49,481 INFO L85 PathProgramCache]: Analyzing trace with hash -994560421, now seen corresponding path program 1 times [2022-12-13 05:54:49,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:54:49,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862361269] [2022-12-13 05:54:49,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:49,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:54:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:50,206 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 05:54:50,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:54:50,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862361269] [2022-12-13 05:54:50,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862361269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:54:50,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:54:50,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:54:50,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608879952] [2022-12-13 05:54:50,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:54:50,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 05:54:50,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:54:50,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 05:54:50,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 05:54:50,209 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 110 [2022-12-13 05:54:50,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 160 transitions, 873 flow. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 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 05:54:50,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:54:50,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 110 [2022-12-13 05:54:50,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:54:52,143 INFO L130 PetriNetUnfolder]: 7502/13346 cut-off events. [2022-12-13 05:54:52,144 INFO L131 PetriNetUnfolder]: For 1161/1161 co-relation queries the response was YES. [2022-12-13 05:54:52,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50002 conditions, 13346 events. 7502/13346 cut-off events. For 1161/1161 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 86613 event pairs, 4266 based on Foata normal form. 38/6701 useless extension candidates. Maximal degree in co-relation 49449. Up to 12292 conditions per place. [2022-12-13 05:54:52,192 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 152 selfloop transitions, 9 changer transitions 30/210 dead transitions. [2022-12-13 05:54:52,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 210 transitions, 1542 flow [2022-12-13 05:54:52,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 05:54:52,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 05:54:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 306 transitions. [2022-12-13 05:54:52,194 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3090909090909091 [2022-12-13 05:54:52,195 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -60 predicate places. [2022-12-13 05:54:52,195 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 210 transitions, 1542 flow [2022-12-13 05:54:52,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 180 transitions, 1327 flow [2022-12-13 05:54:52,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:54:52,286 INFO L89 Accepts]: Start accepts. Operand has 114 places, 180 transitions, 1327 flow [2022-12-13 05:54:52,287 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:54:52,287 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:54:52,287 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 180 transitions, 1327 flow [2022-12-13 05:54:52,292 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 180 transitions, 1327 flow [2022-12-13 05:54:52,292 INFO L226 LiptonReduction]: Number of co-enabled transitions 1994 [2022-12-13 05:54:52,371 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:54:52,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-13 05:54:52,372 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 180 transitions, 1327 flow [2022-12-13 05:54:52,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 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 05:54:52,372 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:54:52,372 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:54:52,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 05:54:52,373 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 05:54:52,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:54:52,373 INFO L85 PathProgramCache]: Analyzing trace with hash 634737586, now seen corresponding path program 1 times [2022-12-13 05:54:52,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:54:52,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087365170] [2022-12-13 05:54:52,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:52,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:54:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:52,728 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 05:54:52,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:54:52,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087365170] [2022-12-13 05:54:52,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087365170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:54:52,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:54:52,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:54:52,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806915738] [2022-12-13 05:54:52,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:54:52,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:54:52,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:54:52,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:54:52,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:54:52,732 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 107 [2022-12-13 05:54:52,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 180 transitions, 1327 flow. Second operand has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 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 05:54:52,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:54:52,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 107 [2022-12-13 05:54:52,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:54:53,909 INFO L130 PetriNetUnfolder]: 7684/13598 cut-off events. [2022-12-13 05:54:53,909 INFO L131 PetriNetUnfolder]: For 1196/1196 co-relation queries the response was YES. [2022-12-13 05:54:53,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63976 conditions, 13598 events. 7684/13598 cut-off events. For 1196/1196 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 88454 event pairs, 1253 based on Foata normal form. 34/6829 useless extension candidates. Maximal degree in co-relation 63298. Up to 12634 conditions per place. [2022-12-13 05:54:53,964 INFO L137 encePairwiseOnDemand]: 99/107 looper letters, 211 selfloop transitions, 13 changer transitions 15/258 dead transitions. [2022-12-13 05:54:53,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 258 transitions, 2440 flow [2022-12-13 05:54:53,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:54:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:54:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 310 transitions. [2022-12-13 05:54:53,966 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41388518024032045 [2022-12-13 05:54:53,966 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -61 predicate places. [2022-12-13 05:54:53,966 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 258 transitions, 2440 flow [2022-12-13 05:54:54,005 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 243 transitions, 2287 flow [2022-12-13 05:54:54,065 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:54:54,065 INFO L89 Accepts]: Start accepts. Operand has 119 places, 243 transitions, 2287 flow [2022-12-13 05:54:54,066 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:54:54,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:54:54,066 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 243 transitions, 2287 flow [2022-12-13 05:54:54,075 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 243 transitions, 2287 flow [2022-12-13 05:54:54,075 INFO L226 LiptonReduction]: Number of co-enabled transitions 2186 [2022-12-13 05:54:54,230 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:54:54,231 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 05:54:54,231 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 243 transitions, 2299 flow [2022-12-13 05:54:54,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 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 05:54:54,232 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:54:54,232 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:54:54,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 05:54:54,232 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 05:54:54,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:54:54,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1427338590, now seen corresponding path program 2 times [2022-12-13 05:54:54,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:54:54,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556012907] [2022-12-13 05:54:54,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:54,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:54:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:54,658 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 05:54:54,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:54:54,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556012907] [2022-12-13 05:54:54,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556012907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:54:54,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:54:54,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:54:54,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831710909] [2022-12-13 05:54:54,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:54:54,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:54:54,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:54:54,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:54:54,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:54:54,662 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 110 [2022-12-13 05:54:54,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 243 transitions, 2299 flow. Second operand has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 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 05:54:54,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:54:54,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 110 [2022-12-13 05:54:54,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:54:55,863 INFO L130 PetriNetUnfolder]: 7999/14144 cut-off events. [2022-12-13 05:54:55,864 INFO L131 PetriNetUnfolder]: For 1436/1436 co-relation queries the response was YES. [2022-12-13 05:54:55,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79749 conditions, 14144 events. 7999/14144 cut-off events. For 1436/1436 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 92469 event pairs, 3803 based on Foata normal form. 34/7186 useless extension candidates. Maximal degree in co-relation 78947. Up to 13153 conditions per place. [2022-12-13 05:54:55,939 INFO L137 encePairwiseOnDemand]: 102/110 looper letters, 254 selfloop transitions, 15 changer transitions 15/303 dead transitions. [2022-12-13 05:54:55,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 303 transitions, 3463 flow [2022-12-13 05:54:55,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:54:55,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:54:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 309 transitions. [2022-12-13 05:54:55,941 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4012987012987013 [2022-12-13 05:54:55,941 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -56 predicate places. [2022-12-13 05:54:55,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 303 transitions, 3463 flow [2022-12-13 05:54:55,999 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 288 transitions, 3280 flow [2022-12-13 05:54:56,233 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:54:56,233 INFO L89 Accepts]: Start accepts. Operand has 124 places, 288 transitions, 3280 flow [2022-12-13 05:54:56,235 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:54:56,236 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:54:56,236 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 288 transitions, 3280 flow [2022-12-13 05:54:56,245 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 288 transitions, 3280 flow [2022-12-13 05:54:56,246 INFO L226 LiptonReduction]: Number of co-enabled transitions 2330 [2022-12-13 05:54:56,410 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:54:56,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-13 05:54:56,411 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 289 transitions, 3308 flow [2022-12-13 05:54:56,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 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 05:54:56,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:54:56,412 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:54:56,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 05:54:56,412 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 05:54:56,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:54:56,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1237610774, now seen corresponding path program 3 times [2022-12-13 05:54:56,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:54:56,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501768389] [2022-12-13 05:54:56,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:54:56,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:54:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:54:56,945 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 05:54:56,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:54:56,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501768389] [2022-12-13 05:54:56,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501768389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:54:56,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:54:56,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 05:54:56,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857829749] [2022-12-13 05:54:56,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:54:56,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:54:56,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:54:56,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:54:56,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:54:56,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 110 [2022-12-13 05:54:56,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 289 transitions, 3308 flow. Second operand has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 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 05:54:56,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:54:56,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 110 [2022-12-13 05:54:56,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:54:59,118 INFO L130 PetriNetUnfolder]: 10314/18323 cut-off events. [2022-12-13 05:54:59,118 INFO L131 PetriNetUnfolder]: For 3173/3173 co-relation queries the response was YES. [2022-12-13 05:54:59,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119883 conditions, 18323 events. 10314/18323 cut-off events. For 3173/3173 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 128027 event pairs, 1373 based on Foata normal form. 0/8925 useless extension candidates. Maximal degree in co-relation 118330. Up to 16955 conditions per place. [2022-12-13 05:54:59,197 INFO L137 encePairwiseOnDemand]: 98/110 looper letters, 291 selfloop transitions, 16 changer transitions 96/422 dead transitions. [2022-12-13 05:54:59,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 422 transitions, 5710 flow [2022-12-13 05:54:59,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 05:54:59,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 05:54:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 446 transitions. [2022-12-13 05:54:59,200 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40545454545454546 [2022-12-13 05:54:59,200 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -47 predicate places. [2022-12-13 05:54:59,200 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 422 transitions, 5710 flow [2022-12-13 05:54:59,257 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 326 transitions, 4354 flow [2022-12-13 05:54:59,338 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:54:59,338 INFO L89 Accepts]: Start accepts. Operand has 133 places, 326 transitions, 4354 flow [2022-12-13 05:54:59,339 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:54:59,339 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:54:59,339 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 326 transitions, 4354 flow [2022-12-13 05:54:59,349 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 326 transitions, 4354 flow [2022-12-13 05:54:59,349 INFO L226 LiptonReduction]: Number of co-enabled transitions 2410 [2022-12-13 05:55:03,846 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:55:03,847 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4509 [2022-12-13 05:55:03,847 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 327 transitions, 4378 flow [2022-12-13 05:55:03,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 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 05:55:03,847 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:55:03,847 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:55:03,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 05:55:03,847 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 05:55:03,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:55:03,848 INFO L85 PathProgramCache]: Analyzing trace with hash -819053094, now seen corresponding path program 1 times [2022-12-13 05:55:03,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:55:03,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421241309] [2022-12-13 05:55:03,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:55:03,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:55:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:55:04,407 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 05:55:04,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:55:04,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421241309] [2022-12-13 05:55:04,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421241309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:55:04,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:55:04,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 05:55:04,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816128727] [2022-12-13 05:55:04,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:55:04,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:55:04,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:55:04,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:55:04,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:55:04,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 110 [2022-12-13 05:55:04,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 327 transitions, 4378 flow. Second operand has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 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 05:55:04,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:55:04,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 110 [2022-12-13 05:55:04,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:55:05,857 INFO L130 PetriNetUnfolder]: 7236/13906 cut-off events. [2022-12-13 05:55:05,857 INFO L131 PetriNetUnfolder]: For 4198/4198 co-relation queries the response was YES. [2022-12-13 05:55:05,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101691 conditions, 13906 events. 7236/13906 cut-off events. For 4198/4198 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 100941 event pairs, 1319 based on Foata normal form. 0/8021 useless extension candidates. Maximal degree in co-relation 100946. Up to 12565 conditions per place. [2022-12-13 05:55:05,917 INFO L137 encePairwiseOnDemand]: 98/110 looper letters, 283 selfloop transitions, 18 changer transitions 25/345 dead transitions. [2022-12-13 05:55:05,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 345 transitions, 5268 flow [2022-12-13 05:55:05,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 05:55:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 05:55:05,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 316 transitions. [2022-12-13 05:55:05,919 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2872727272727273 [2022-12-13 05:55:05,919 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -38 predicate places. [2022-12-13 05:55:05,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 345 transitions, 5268 flow [2022-12-13 05:55:05,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 320 transitions, 4868 flow [2022-12-13 05:55:06,033 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:55:06,033 INFO L89 Accepts]: Start accepts. Operand has 139 places, 320 transitions, 4868 flow [2022-12-13 05:55:06,034 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:55:06,034 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:55:06,034 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 320 transitions, 4868 flow [2022-12-13 05:55:06,044 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 320 transitions, 4868 flow [2022-12-13 05:55:06,044 INFO L226 LiptonReduction]: Number of co-enabled transitions 2314 [2022-12-13 05:55:06,063 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [798] L958-->L960-1: Formula: (and (= |v_t1Thread1of1ForFork0_empty_~q#1.base_11| |v_t1Thread1of1ForFork0_empty_#in~q#1.base_7|) (= |v_t1Thread1of1ForFork0_empty_~q#1.offset_11| |v_t1Thread1of1ForFork0_empty_#in~q#1.offset_7|) (= |v_t1Thread1of1ForFork0_empty_#t~mem31#1_15| (select (select |v_#memory_int_144| |v_t1Thread1of1ForFork0_empty_~q#1.base_11|) (+ 3200 |v_t1Thread1of1ForFork0_empty_~q#1.offset_11|)))) InVars {t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_7|, #memory_int=|v_#memory_int_144|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_7|} OutVars{t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_11|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_7|, t1Thread1of1ForFork0_empty_#t~mem31#1=|v_t1Thread1of1ForFork0_empty_#t~mem31#1_15|, #memory_int=|v_#memory_int_144|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_11|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_7|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_empty_~q#1.offset, t1Thread1of1ForFork0_empty_#t~mem31#1, t1Thread1of1ForFork0_empty_~q#1.base] and [955] L1062-4-->L1063-3: Formula: (and (= (store |v_#memory_int_539| |v_ULTIMATE.start_main_~#id2~0#1.base_19| (store (select |v_#memory_int_539| |v_ULTIMATE.start_main_~#id2~0#1.base_19|) |v_ULTIMATE.start_main_~#id2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre64#1_25|)) |v_#memory_int_538|) (= |v_ULTIMATE.start_main_#t~pre64#1_25| |v_#pthreadsForks_36|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_19|, #pthreadsForks=|v_#pthreadsForks_36|, #memory_int=|v_#memory_int_539|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_31|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_19|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_25|, #memory_int=|v_#memory_int_538|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_13|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-13 05:55:06,149 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [987] L1010-1-->L980-1: Formula: (and (= |v_t1Thread1of1ForFork0_enqueue_~x#1_61| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_49|) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_267| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_49|) (= (select (select |v_#memory_int_698| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_267|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_267| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_49| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_267|)) InVars {t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_49|, #memory_int=|v_#memory_int_698|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_49|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_49|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_267|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_109|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_113|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_49|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_267|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_49|, #memory_int=|v_#memory_int_698|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_61|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_57|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_145|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_49|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_125|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] and [955] L1062-4-->L1063-3: Formula: (and (= (store |v_#memory_int_539| |v_ULTIMATE.start_main_~#id2~0#1.base_19| (store (select |v_#memory_int_539| |v_ULTIMATE.start_main_~#id2~0#1.base_19|) |v_ULTIMATE.start_main_~#id2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre64#1_25|)) |v_#memory_int_538|) (= |v_ULTIMATE.start_main_#t~pre64#1_25| |v_#pthreadsForks_36|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_19|, #pthreadsForks=|v_#pthreadsForks_36|, #memory_int=|v_#memory_int_539|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_31|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_19|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_25|, #memory_int=|v_#memory_int_538|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_13|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-13 05:55:06,209 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L988-->L988-2: Formula: (and (= |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_37| (select (select |v_#memory_int_142| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_73|) (+ 3204 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_73|))) (= |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_33| |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_37|)) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_73|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_73|, #memory_int=|v_#memory_int_142|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_73|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_73|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_33|, #memory_int=|v_#memory_int_142|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_37|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [955] L1062-4-->L1063-3: Formula: (and (= (store |v_#memory_int_539| |v_ULTIMATE.start_main_~#id2~0#1.base_19| (store (select |v_#memory_int_539| |v_ULTIMATE.start_main_~#id2~0#1.base_19|) |v_ULTIMATE.start_main_~#id2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre64#1_25|)) |v_#memory_int_538|) (= |v_ULTIMATE.start_main_#t~pre64#1_25| |v_#pthreadsForks_36|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_19|, #pthreadsForks=|v_#pthreadsForks_36|, #memory_int=|v_#memory_int_539|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_31|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_19|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_25|, #memory_int=|v_#memory_int_538|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_13|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-13 05:55:06,448 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1029] $Ultimate##0-->L1010-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_244| |v_~#m~0.base_120|))) (and (= |v_t1Thread1of1ForFork0_~value~0#1_121| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_63|) (<= |v_t1Thread1of1ForFork0_#t~nondet50#1_36| 2147483647) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_65| |v_~#queue~0.base_129|) (= |v_#pthreadsMutex_243| (store |v_#pthreadsMutex_244| |v_~#m~0.base_120| (store .cse0 |v_~#m~0.offset_120| 1))) (= |v_t1Thread1of1ForFork0_~value~0#1_121| |v_t1Thread1of1ForFork0_#t~nondet50#1_36|) (= (select .cse0 |v_~#m~0.offset_120|) 0) (= |v_t1Thread1of1ForFork0_~arg#1.base_33| |v_t1Thread1of1ForFork0_#in~arg#1.base_33|) (= |v_t1Thread1of1ForFork0_#in~arg#1.offset_33| |v_t1Thread1of1ForFork0_~arg#1.offset_33|) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet50#1_36| 2147483648)) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_65| |v_~#queue~0.offset_124|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_244|, ~#m~0.base=|v_~#m~0.base_120|, ~#queue~0.base=|v_~#queue~0.base_129|, t1Thread1of1ForFork0_#t~nondet50#1=|v_t1Thread1of1ForFork0_#t~nondet50#1_36|, ~#m~0.offset=|v_~#m~0.offset_120|, ~#queue~0.offset=|v_~#queue~0.offset_124|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_33|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_243|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_83|, t1Thread1of1ForFork0_~arg#1.offset=|v_t1Thread1of1ForFork0_~arg#1.offset_33|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_121|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_33|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_65|, ~#m~0.base=|v_~#m~0.base_120|, ~#queue~0.base=|v_~#queue~0.base_129|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_63|, ~#m~0.offset=|v_~#m~0.offset_120|, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_37|, ~#queue~0.offset=|v_~#queue~0.offset_124|, t1Thread1of1ForFork0_~arg#1.base=|v_t1Thread1of1ForFork0_~arg#1.base_33|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_65|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_33|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_#t~nondet50#1, t1Thread1of1ForFork0_~i~0#1, t1Thread1of1ForFork0_~arg#1.offset, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_enqueue_#in~x#1, t1Thread1of1ForFork0_#t~nondet49#1, t1Thread1of1ForFork0_~arg#1.base, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, t1Thread1of1ForFork0_enqueue_#in~q#1.base] and [955] L1062-4-->L1063-3: Formula: (and (= (store |v_#memory_int_539| |v_ULTIMATE.start_main_~#id2~0#1.base_19| (store (select |v_#memory_int_539| |v_ULTIMATE.start_main_~#id2~0#1.base_19|) |v_ULTIMATE.start_main_~#id2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre64#1_25|)) |v_#memory_int_538|) (= |v_ULTIMATE.start_main_#t~pre64#1_25| |v_#pthreadsForks_36|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_19|, #pthreadsForks=|v_#pthreadsForks_36|, #memory_int=|v_#memory_int_539|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_31|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_19|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_25|, #memory_int=|v_#memory_int_538|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_13|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-13 05:55:06,520 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 05:55:06,521 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 488 [2022-12-13 05:55:06,521 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 316 transitions, 4812 flow [2022-12-13 05:55:06,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 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 05:55:06,521 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:55:06,521 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:55:06,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 05:55:06,521 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 05:55:06,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:55:06,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1621160402, now seen corresponding path program 1 times [2022-12-13 05:55:06,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:55:06,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993483655] [2022-12-13 05:55:06,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:55:06,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:55:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:55:12,245 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 05:55:12,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:55:12,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993483655] [2022-12-13 05:55:12,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993483655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:55:12,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:55:12,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 05:55:12,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118814337] [2022-12-13 05:55:12,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:55:12,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:55:12,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:55:12,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:55:12,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:55:12,246 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 112 [2022-12-13 05:55:12,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 316 transitions, 4812 flow. Second operand has 10 states, 10 states have (on average 19.2) internal successors, (192), 10 states have internal predecessors, (192), 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 05:55:12,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:55:12,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 112 [2022-12-13 05:55:12,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:55:45,955 INFO L130 PetriNetUnfolder]: 8100/15291 cut-off events. [2022-12-13 05:55:45,955 INFO L131 PetriNetUnfolder]: For 5180/5180 co-relation queries the response was YES. [2022-12-13 05:55:45,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124998 conditions, 15291 events. 8100/15291 cut-off events. For 5180/5180 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 112585 event pairs, 1688 based on Foata normal form. 0/9207 useless extension candidates. Maximal degree in co-relation 124204. Up to 13794 conditions per place. [2022-12-13 05:55:46,031 INFO L137 encePairwiseOnDemand]: 94/112 looper letters, 348 selfloop transitions, 28 changer transitions 50/445 dead transitions. [2022-12-13 05:55:46,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 445 transitions, 7743 flow [2022-12-13 05:55:46,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 05:55:46,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 05:55:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 409 transitions. [2022-12-13 05:55:46,034 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3651785714285714 [2022-12-13 05:55:46,034 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -39 predicate places. [2022-12-13 05:55:46,034 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 445 transitions, 7743 flow [2022-12-13 05:55:46,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 395 transitions, 6843 flow [2022-12-13 05:55:46,174 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:55:46,175 INFO L89 Accepts]: Start accepts. Operand has 142 places, 395 transitions, 6843 flow [2022-12-13 05:55:46,175 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:55:46,175 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:55:46,176 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 395 transitions, 6843 flow [2022-12-13 05:55:46,190 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 395 transitions, 6843 flow [2022-12-13 05:55:46,190 INFO L226 LiptonReduction]: Number of co-enabled transitions 2772 [2022-12-13 05:55:46,426 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:55:46,427 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 253 [2022-12-13 05:55:46,427 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 396 transitions, 6891 flow [2022-12-13 05:55:46,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.2) internal successors, (192), 10 states have internal predecessors, (192), 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 05:55:46,427 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:55:46,427 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:55:46,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 05:55:46,427 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 05:55:46,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:55:46,428 INFO L85 PathProgramCache]: Analyzing trace with hash 525214365, now seen corresponding path program 1 times [2022-12-13 05:55:46,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:55:46,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461172642] [2022-12-13 05:55:46,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:55:46,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:55:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:55:50,770 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 05:55:50,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:55:50,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461172642] [2022-12-13 05:55:50,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461172642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:55:50,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:55:50,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:55:50,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075190455] [2022-12-13 05:55:50,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:55:50,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 05:55:50,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:55:50,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 05:55:50,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 05:55:50,771 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 117 [2022-12-13 05:55:50,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 396 transitions, 6891 flow. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 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 05:55:50,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:55:50,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 117 [2022-12-13 05:55:50,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:55:57,500 INFO L130 PetriNetUnfolder]: 7900/14993 cut-off events. [2022-12-13 05:55:57,501 INFO L131 PetriNetUnfolder]: For 6505/6505 co-relation queries the response was YES. [2022-12-13 05:55:57,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135942 conditions, 14993 events. 7900/14993 cut-off events. For 6505/6505 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 110586 event pairs, 1307 based on Foata normal form. 0/9033 useless extension candidates. Maximal degree in co-relation 135042. Up to 13501 conditions per place. [2022-12-13 05:55:57,582 INFO L137 encePairwiseOnDemand]: 103/117 looper letters, 404 selfloop transitions, 17 changer transitions 15/455 dead transitions. [2022-12-13 05:55:57,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 455 transitions, 8803 flow [2022-12-13 05:55:57,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:55:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:55:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 335 transitions. [2022-12-13 05:55:57,584 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3579059829059829 [2022-12-13 05:55:57,584 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -31 predicate places. [2022-12-13 05:55:57,584 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 455 transitions, 8803 flow [2022-12-13 05:55:57,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 440 transitions, 8503 flow [2022-12-13 05:55:57,746 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:55:57,746 INFO L89 Accepts]: Start accepts. Operand has 149 places, 440 transitions, 8503 flow [2022-12-13 05:55:57,747 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:55:57,747 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:55:57,747 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 440 transitions, 8503 flow [2022-12-13 05:55:57,764 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 440 transitions, 8503 flow [2022-12-13 05:55:57,765 INFO L226 LiptonReduction]: Number of co-enabled transitions 2970 [2022-12-13 05:55:57,895 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:55:57,896 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 05:55:57,896 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 442 transitions, 8555 flow [2022-12-13 05:55:57,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 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 05:55:57,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:55:57,897 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:55:57,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 05:55:57,897 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 05:55:57,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:55:57,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2077252270, now seen corresponding path program 1 times [2022-12-13 05:55:57,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:55:57,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649711810] [2022-12-13 05:55:57,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:55:57,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:55:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:55:58,333 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 05:55:58,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:55:58,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649711810] [2022-12-13 05:55:58,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649711810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:55:58,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:55:58,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:55:58,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375293476] [2022-12-13 05:55:58,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:55:58,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:55:58,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:55:58,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:55:58,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:55:58,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 114 [2022-12-13 05:55:58,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 442 transitions, 8555 flow. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 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 05:55:58,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:55:58,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 114 [2022-12-13 05:55:58,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:56:00,495 INFO L130 PetriNetUnfolder]: 8095/15341 cut-off events. [2022-12-13 05:56:00,495 INFO L131 PetriNetUnfolder]: For 7935/7935 co-relation queries the response was YES. [2022-12-13 05:56:00,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152813 conditions, 15341 events. 8095/15341 cut-off events. For 7935/7935 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 113319 event pairs, 1750 based on Foata normal form. 0/9299 useless extension candidates. Maximal degree in co-relation 151829. Up to 13803 conditions per place. [2022-12-13 05:56:00,578 INFO L137 encePairwiseOnDemand]: 97/114 looper letters, 417 selfloop transitions, 24 changer transitions 45/505 dead transitions. [2022-12-13 05:56:00,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 505 transitions, 10783 flow [2022-12-13 05:56:00,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:56:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:56:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 344 transitions. [2022-12-13 05:56:00,579 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37719298245614036 [2022-12-13 05:56:00,581 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -24 predicate places. [2022-12-13 05:56:00,581 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 505 transitions, 10783 flow [2022-12-13 05:56:00,644 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 460 transitions, 9793 flow [2022-12-13 05:56:00,747 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:56:00,747 INFO L89 Accepts]: Start accepts. Operand has 156 places, 460 transitions, 9793 flow [2022-12-13 05:56:00,748 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:56:00,748 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:56:00,748 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 460 transitions, 9793 flow [2022-12-13 05:56:00,767 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 460 transitions, 9793 flow [2022-12-13 05:56:00,767 INFO L226 LiptonReduction]: Number of co-enabled transitions 3144 [2022-12-13 05:56:00,933 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:56:00,934 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-13 05:56:00,934 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 461 transitions, 9833 flow [2022-12-13 05:56:00,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 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 05:56:00,934 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:56:00,934 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:56:00,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 05:56:00,934 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 05:56:00,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:56:00,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2078175791, now seen corresponding path program 1 times [2022-12-13 05:56:00,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:56:00,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354873411] [2022-12-13 05:56:00,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:56:00,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:56:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:56:01,293 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 05:56:01,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:56:01,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354873411] [2022-12-13 05:56:01,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354873411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:56:01,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:56:01,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:56:01,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807053826] [2022-12-13 05:56:01,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:56:01,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:56:01,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:56:01,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:56:01,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:56:01,295 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 115 [2022-12-13 05:56:01,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 461 transitions, 9833 flow. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 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 05:56:01,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:56:01,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 115 [2022-12-13 05:56:01,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:56:03,425 INFO L130 PetriNetUnfolder]: 7835/14792 cut-off events. [2022-12-13 05:56:03,425 INFO L131 PetriNetUnfolder]: For 9530/9530 co-relation queries the response was YES. [2022-12-13 05:56:03,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160681 conditions, 14792 events. 7835/14792 cut-off events. For 9530/9530 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 107594 event pairs, 1310 based on Foata normal form. 0/9008 useless extension candidates. Maximal degree in co-relation 159612. Up to 13305 conditions per place. [2022-12-13 05:56:03,514 INFO L137 encePairwiseOnDemand]: 100/115 looper letters, 446 selfloop transitions, 22 changer transitions 22/509 dead transitions. [2022-12-13 05:56:03,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 509 transitions, 11856 flow [2022-12-13 05:56:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:56:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:56:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 312 transitions. [2022-12-13 05:56:03,515 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3875776397515528 [2022-12-13 05:56:03,516 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -18 predicate places. [2022-12-13 05:56:03,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 509 transitions, 11856 flow [2022-12-13 05:56:03,588 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 487 transitions, 11328 flow [2022-12-13 05:56:03,695 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:56:03,695 INFO L89 Accepts]: Start accepts. Operand has 162 places, 487 transitions, 11328 flow [2022-12-13 05:56:03,696 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:56:03,696 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:56:03,697 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 487 transitions, 11328 flow [2022-12-13 05:56:03,716 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 487 transitions, 11328 flow [2022-12-13 05:56:03,716 INFO L226 LiptonReduction]: Number of co-enabled transitions 3320 [2022-12-13 05:56:03,826 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:56:03,827 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 05:56:03,827 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 487 transitions, 11340 flow [2022-12-13 05:56:03,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 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 05:56:03,827 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:56:03,827 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:56:03,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 05:56:03,827 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 05:56:03,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:56:03,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2051272703, now seen corresponding path program 1 times [2022-12-13 05:56:03,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:56:03,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553053161] [2022-12-13 05:56:03,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:56:03,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:56:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:56:04,279 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 05:56:04,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:56:04,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553053161] [2022-12-13 05:56:04,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553053161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:56:04,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:56:04,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 05:56:04,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877369031] [2022-12-13 05:56:04,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:56:04,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:56:04,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:56:04,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:56:04,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:56:04,282 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 114 [2022-12-13 05:56:04,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 487 transitions, 11340 flow. Second operand has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 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 05:56:04,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:56:04,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 114 [2022-12-13 05:56:04,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:56:06,678 INFO L130 PetriNetUnfolder]: 7310/13738 cut-off events. [2022-12-13 05:56:06,678 INFO L131 PetriNetUnfolder]: For 11035/11035 co-relation queries the response was YES. [2022-12-13 05:56:06,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161931 conditions, 13738 events. 7310/13738 cut-off events. For 11035/11035 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 98063 event pairs, 1262 based on Foata normal form. 0/8487 useless extension candidates. Maximal degree in co-relation 160805. Up to 12384 conditions per place. [2022-12-13 05:56:06,768 INFO L137 encePairwiseOnDemand]: 94/114 looper letters, 387 selfloop transitions, 47 changer transitions 85/537 dead transitions. [2022-12-13 05:56:06,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 537 transitions, 13600 flow [2022-12-13 05:56:06,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 05:56:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 05:56:06,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 389 transitions. [2022-12-13 05:56:06,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3412280701754386 [2022-12-13 05:56:06,771 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -12 predicate places. [2022-12-13 05:56:06,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 537 transitions, 13600 flow [2022-12-13 05:56:06,840 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 452 transitions, 11390 flow [2022-12-13 05:56:06,953 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:56:06,954 INFO L89 Accepts]: Start accepts. Operand has 161 places, 452 transitions, 11390 flow [2022-12-13 05:56:06,957 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:56:06,957 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:56:06,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 452 transitions, 11390 flow [2022-12-13 05:56:06,975 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 452 transitions, 11390 flow [2022-12-13 05:56:06,975 INFO L226 LiptonReduction]: Number of co-enabled transitions 3158 [2022-12-13 05:56:07,093 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:56:07,094 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 05:56:07,094 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 452 transitions, 11402 flow [2022-12-13 05:56:07,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 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 05:56:07,095 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:56:07,095 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:56:07,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 05:56:07,095 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 05:56:07,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:56:07,095 INFO L85 PathProgramCache]: Analyzing trace with hash 67058701, now seen corresponding path program 1 times [2022-12-13 05:56:07,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:56:07,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054808088] [2022-12-13 05:56:07,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:56:07,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:56:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:56:07,148 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 05:56:07,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:56:07,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054808088] [2022-12-13 05:56:07,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054808088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:56:07,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:56:07,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 05:56:07,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603336473] [2022-12-13 05:56:07,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:56:07,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 05:56:07,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:56:07,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 05:56:07,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 05:56:07,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 105 [2022-12-13 05:56:07,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 452 transitions, 11402 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 05:56:07,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:56:07,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 105 [2022-12-13 05:56:07,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:56:07,795 INFO L130 PetriNetUnfolder]: 2177/4365 cut-off events. [2022-12-13 05:56:07,796 INFO L131 PetriNetUnfolder]: For 14802/14802 co-relation queries the response was YES. [2022-12-13 05:56:07,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53801 conditions, 4365 events. 2177/4365 cut-off events. For 14802/14802 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 27329 event pairs, 41 based on Foata normal form. 426/3574 useless extension candidates. Maximal degree in co-relation 52892. Up to 3793 conditions per place. [2022-12-13 05:56:07,819 INFO L137 encePairwiseOnDemand]: 88/105 looper letters, 295 selfloop transitions, 66 changer transitions 38/430 dead transitions. [2022-12-13 05:56:07,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 430 transitions, 11641 flow [2022-12-13 05:56:07,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 05:56:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 05:56:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2022-12-13 05:56:07,821 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4984126984126984 [2022-12-13 05:56:07,822 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -18 predicate places. [2022-12-13 05:56:07,822 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 430 transitions, 11641 flow [2022-12-13 05:56:07,844 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 392 transitions, 10607 flow [2022-12-13 05:56:07,884 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:56:07,884 INFO L89 Accepts]: Start accepts. Operand has 138 places, 392 transitions, 10607 flow [2022-12-13 05:56:07,889 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:56:07,889 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:56:07,889 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 392 transitions, 10607 flow [2022-12-13 05:56:07,903 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 392 transitions, 10607 flow [2022-12-13 05:56:07,903 INFO L226 LiptonReduction]: Number of co-enabled transitions 1830 [2022-12-13 05:56:07,918 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:56:07,919 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 05:56:07,919 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 392 transitions, 10607 flow [2022-12-13 05:56:07,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 05:56:07,919 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:56:07,919 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:56:07,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 05:56:07,919 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 05:56:07,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:56:07,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1280318459, now seen corresponding path program 1 times [2022-12-13 05:56:07,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:56:07,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254324519] [2022-12-13 05:56:07,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:56:07,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:56:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-12-13 06:08:03,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 06:08:03,358 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:152) 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:08:03,361 INFO L158 Benchmark]: Toolchain (without parser) took 808864.77ms. Allocated memory was 189.8MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 164.7MB in the beginning and 718.1MB in the end (delta: -553.4MB). Peak memory consumption was 5.3GB. Max. memory is 8.0GB. [2022-12-13 06:08:03,361 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 189.8MB. Free memory is still 166.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:08:03,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.60ms. Allocated memory is still 189.8MB. Free memory was 164.2MB in the beginning and 134.3MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-13 06:08:03,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.25ms. Allocated memory is still 189.8MB. Free memory was 134.3MB in the beginning and 131.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 06:08:03,362 INFO L158 Benchmark]: Boogie Preprocessor took 53.92ms. Allocated memory is still 189.8MB. Free memory was 131.2MB in the beginning and 129.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:08:03,362 INFO L158 Benchmark]: RCFGBuilder took 492.45ms. Allocated memory is still 189.8MB. Free memory was 129.1MB in the beginning and 106.5MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-13 06:08:03,362 INFO L158 Benchmark]: TraceAbstraction took 807690.40ms. Allocated memory was 189.8MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 105.5MB in the beginning and 718.1MB in the end (delta: -612.6MB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. [2022-12-13 06:08:03,363 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2022-12-13 06:08:03,364 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 189.8MB. Free memory is still 166.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 560.60ms. Allocated memory is still 189.8MB. Free memory was 164.2MB in the beginning and 134.3MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.25ms. Allocated memory is still 189.8MB. Free memory was 134.3MB in the beginning and 131.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.92ms. Allocated memory is still 189.8MB. Free memory was 131.2MB in the beginning and 129.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 492.45ms. Allocated memory is still 189.8MB. Free memory was 129.1MB in the beginning and 106.5MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 807690.40ms. Allocated memory was 189.8MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 105.5MB in the beginning and 718.1MB in the end (delta: -612.6MB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0s, 237 PlacesBefore, 181 PlacesAfterwards, 245 TransitionsBefore, 186 TransitionsAfterwards, 15600 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 122 ConcurrentYvCompositions, 9 ChoiceCompositions, 209 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28806, independent: 28197, independent conditional: 28197, independent unconditional: 0, dependent: 609, dependent conditional: 609, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28806, independent: 28197, independent conditional: 0, independent unconditional: 28197, dependent: 609, dependent conditional: 0, dependent unconditional: 609, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28806, independent: 28197, independent conditional: 0, independent unconditional: 28197, dependent: 609, dependent conditional: 0, dependent unconditional: 609, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28806, independent: 28197, independent conditional: 0, independent unconditional: 28197, dependent: 609, dependent conditional: 0, dependent unconditional: 609, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15604, independent: 15428, independent conditional: 0, independent unconditional: 15428, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15604, independent: 15395, independent conditional: 0, independent unconditional: 15395, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 209, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 239, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 216, dependent conditional: 0, dependent unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28806, independent: 12769, independent conditional: 0, independent unconditional: 12769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 15604, unknown conditional: 0, unknown unconditional: 15604] , Statistics on independence cache: Total cache size (in pairs): 34129, Positive cache size: 33953, Positive conditional cache size: 0, Positive unconditional cache size: 33953, Negative cache size: 176, Negative conditional cache size: 0, Negative unconditional cache size: 176, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 176 PlacesBefore, 176 PlacesAfterwards, 176 TransitionsBefore, 176 TransitionsAfterwards, 4236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 289, independent: 277, independent conditional: 277, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 289, independent: 277, independent conditional: 0, independent unconditional: 277, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 289, independent: 277, independent conditional: 0, independent unconditional: 277, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 289, independent: 277, independent conditional: 0, independent unconditional: 277, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 234, independent: 227, independent conditional: 0, independent unconditional: 227, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 234, independent: 227, independent conditional: 0, independent unconditional: 227, 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: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 289, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 234, unknown conditional: 0, unknown unconditional: 234] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 227, Positive conditional cache size: 0, Positive unconditional cache size: 227, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 113 PlacesBefore, 113 PlacesAfterwards, 160 TransitionsBefore, 160 TransitionsAfterwards, 2464 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 230, Positive conditional cache size: 0, Positive unconditional cache size: 230, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 114 PlacesBefore, 114 PlacesAfterwards, 180 TransitionsBefore, 180 TransitionsAfterwards, 1994 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 12, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 249, Positive cache size: 239, Positive conditional cache size: 0, Positive unconditional cache size: 239, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 119 PlacesBefore, 119 PlacesAfterwards, 243 TransitionsBefore, 243 TransitionsAfterwards, 2186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 31, independent conditional: 10, independent unconditional: 21, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 241, Positive conditional cache size: 0, Positive unconditional cache size: 241, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 124 PlacesBefore, 125 PlacesAfterwards, 288 TransitionsBefore, 289 TransitionsAfterwards, 2330 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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): 251, Positive cache size: 241, Positive conditional cache size: 0, Positive unconditional cache size: 241, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 133 PlacesBefore, 134 PlacesAfterwards, 326 TransitionsBefore, 327 TransitionsAfterwards, 2410 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 24, independent conditional: 3, independent unconditional: 21, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 1, dependent conditional: 0, dependent unconditional: 1, 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: 25, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 242, Positive conditional cache size: 0, Positive unconditional cache size: 242, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 139 PlacesBefore, 133 PlacesAfterwards, 320 TransitionsBefore, 316 TransitionsAfterwards, 2314 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 10, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 257, Positive conditional cache size: 5, Positive unconditional cache size: 252, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 142 PlacesBefore, 143 PlacesAfterwards, 395 TransitionsBefore, 396 TransitionsAfterwards, 2772 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 0, independent unconditional: 35, 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: 35, independent: 35, independent conditional: 0, independent unconditional: 35, 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: 35, independent: 35, independent conditional: 0, independent unconditional: 35, 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: 35, independent: 35, independent conditional: 0, independent unconditional: 35, 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): 267, Positive cache size: 257, Positive conditional cache size: 5, Positive unconditional cache size: 252, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 149 PlacesBefore, 150 PlacesAfterwards, 440 TransitionsBefore, 442 TransitionsAfterwards, 2970 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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): 267, Positive cache size: 257, Positive conditional cache size: 5, Positive unconditional cache size: 252, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 156 PlacesBefore, 157 PlacesAfterwards, 460 TransitionsBefore, 461 TransitionsAfterwards, 3144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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): 267, Positive cache size: 257, Positive conditional cache size: 5, Positive unconditional cache size: 252, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 162 PlacesBefore, 162 PlacesAfterwards, 487 TransitionsBefore, 487 TransitionsAfterwards, 3320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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): 267, Positive cache size: 257, Positive conditional cache size: 5, Positive unconditional cache size: 252, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 161 PlacesBefore, 161 PlacesAfterwards, 452 TransitionsBefore, 452 TransitionsAfterwards, 3158 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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): 267, Positive cache size: 257, Positive conditional cache size: 5, Positive unconditional cache size: 252, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 138 PlacesBefore, 138 PlacesAfterwards, 392 TransitionsBefore, 392 TransitionsAfterwards, 1830 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 10, independent unconditional: 4, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 275, Positive cache size: 265, Positive conditional cache size: 5, Positive unconditional cache size: 260, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown