/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:29:48,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:29:48,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:29:49,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:29:49,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:29:49,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:29:49,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:29:49,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:29:49,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:29:49,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:29:49,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:29:49,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:29:49,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:29:49,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:29:49,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:29:49,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:29:49,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:29:49,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:29:49,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:29:49,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:29:49,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:29:49,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:29:49,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:29:49,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:29:49,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:29:49,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:29:49,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:29:49,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:29:49,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:29:49,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:29:49,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:29:49,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:29:49,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:29:49,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:29:49,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:29:49,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:29:49,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:29:49,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:29:49,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:29:49,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:29:49,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:29:49,103 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-06 02:29:49,135 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:29:49,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:29:49,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:29:49,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:29:49,138 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:29:49,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:29:49,138 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:29:49,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:29:49,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:29:49,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:29:49,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:29:49,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:29:49,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:29:49,140 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:29:49,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:29:49,140 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:29:49,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:29:49,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:29:49,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:29:49,141 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:29:49,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:29:49,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:29:49,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:29:49,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:29:49,142 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:29:49,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:29:49,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:29:49,142 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:29:49,142 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 [2022-12-06 02:29:49,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:29:49,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:29:49,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:29:49,524 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:29:49,525 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:29:49,526 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-12-06 02:29:50,607 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:29:50,845 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:29:50,846 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-12-06 02:29:50,858 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ea484519/2794dc6ea3104f509f2531f1b49fea66/FLAGb3c016a3d [2022-12-06 02:29:50,877 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ea484519/2794dc6ea3104f509f2531f1b49fea66 [2022-12-06 02:29:50,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:29:50,881 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:29:50,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:29:50,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:29:50,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:29:50,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:29:50" (1/1) ... [2022-12-06 02:29:50,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce0a64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:29:50, skipping insertion in model container [2022-12-06 02:29:50,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:29:50" (1/1) ... [2022-12-06 02:29:50,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:29:50,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:29:51,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:29:51,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:29:51,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:29:51,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:29:51,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:29:51,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:29:51,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:29:51,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:29:51,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:29:51,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:29:51,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:29:51,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:29:51,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:29:51,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:29:51,101 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c[2947,2960] [2022-12-06 02:29:51,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:29:51,129 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:29:51,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:29:51,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:29:51,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:29:51,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:29:51,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:29:51,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:29:51,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:29:51,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:29:51,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:29:51,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:29:51,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:29:51,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:29:51,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:29:51,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:29:51,171 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c[2947,2960] [2022-12-06 02:29:51,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:29:51,187 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:29:51,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:29:51 WrapperNode [2022-12-06 02:29:51,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:29:51,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:29:51,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:29:51,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:29:51,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:29:51" (1/1) ... [2022-12-06 02:29:51,213 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:29:51" (1/1) ... [2022-12-06 02:29:51,244 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 151 [2022-12-06 02:29:51,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:29:51,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:29:51,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:29:51,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:29:51,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:29:51" (1/1) ... [2022-12-06 02:29:51,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:29:51" (1/1) ... [2022-12-06 02:29:51,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:29:51" (1/1) ... [2022-12-06 02:29:51,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:29:51" (1/1) ... [2022-12-06 02:29:51,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:29:51" (1/1) ... [2022-12-06 02:29:51,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:29:51" (1/1) ... [2022-12-06 02:29:51,277 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:29:51" (1/1) ... [2022-12-06 02:29:51,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:29:51" (1/1) ... [2022-12-06 02:29:51,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:29:51,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:29:51,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:29:51,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:29:51,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:29:51" (1/1) ... [2022-12-06 02:29:51,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:29:51,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:51,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 02:29:51,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 02:29:51,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:29:51,364 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:29:51,364 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:29:51,364 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:29:51,364 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:29:51,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:29:51,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:29:51,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:29:51,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:29:51,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:29:51,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:29:51,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:29:51,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:29:51,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:29:51,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:29:51,366 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 02:29:51,477 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:29:51,479 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:29:51,758 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:29:51,825 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:29:51,826 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 02:29:51,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:29:51 BoogieIcfgContainer [2022-12-06 02:29:51,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:29:51,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:29:51,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:29:51,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:29:51,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:29:50" (1/3) ... [2022-12-06 02:29:51,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e382bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:29:51, skipping insertion in model container [2022-12-06 02:29:51,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:29:51" (2/3) ... [2022-12-06 02:29:51,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e382bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:29:51, skipping insertion in model container [2022-12-06 02:29:51,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:29:51" (3/3) ... [2022-12-06 02:29:51,837 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2022-12-06 02:29:51,852 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:29:51,853 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:29:51,853 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:29:51,920 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 02:29:51,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 131 transitions, 278 flow [2022-12-06 02:29:52,052 INFO L130 PetriNetUnfolder]: 11/129 cut-off events. [2022-12-06 02:29:52,053 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:29:52,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 129 events. 11/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 123 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-06 02:29:52,059 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 131 transitions, 278 flow [2022-12-06 02:29:52,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 121 transitions, 254 flow [2022-12-06 02:29:52,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:52,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 121 transitions, 254 flow [2022-12-06 02:29:52,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 121 transitions, 254 flow [2022-12-06 02:29:52,143 INFO L130 PetriNetUnfolder]: 11/121 cut-off events. [2022-12-06 02:29:52,143 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:29:52,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 121 events. 11/121 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 122 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-06 02:29:52,147 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 121 transitions, 254 flow [2022-12-06 02:29:52,147 INFO L188 LiptonReduction]: Number of co-enabled transitions 1242 [2022-12-06 02:29:57,466 INFO L203 LiptonReduction]: Total number of compositions: 103 [2022-12-06 02:29:57,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:29:57,485 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;@17298eab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:29:57,485 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 02:29:57,490 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-06 02:29:57,490 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:29:57,490 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:57,491 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:57,491 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:29:57,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:57,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1602862863, now seen corresponding path program 1 times [2022-12-06 02:29:57,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:57,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344346508] [2022-12-06 02:29:57,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:57,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:57,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:57,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344346508] [2022-12-06 02:29:57,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344346508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:29:57,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:29:57,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 02:29:57,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299104551] [2022-12-06 02:29:57,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:29:57,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:29:57,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:57,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:29:57,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:29:57,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2022-12-06 02:29:57,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:29:57,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:57,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2022-12-06 02:29:57,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:58,064 INFO L130 PetriNetUnfolder]: 64/121 cut-off events. [2022-12-06 02:29:58,064 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 02:29:58,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 121 events. 64/121 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 350 event pairs, 13 based on Foata normal form. 1/84 useless extension candidates. Maximal degree in co-relation 170. Up to 66 conditions per place. [2022-12-06 02:29:58,067 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 19 selfloop transitions, 2 changer transitions 4/28 dead transitions. [2022-12-06 02:29:58,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 28 transitions, 127 flow [2022-12-06 02:29:58,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:29:58,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:29:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 02:29:58,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6491228070175439 [2022-12-06 02:29:58,081 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 2 predicate places. [2022-12-06 02:29:58,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:58,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 28 transitions, 127 flow [2022-12-06 02:29:58,085 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 28 transitions, 127 flow [2022-12-06 02:29:58,085 INFO L188 LiptonReduction]: Number of co-enabled transitions 44 [2022-12-06 02:29:58,145 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:29:58,147 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-06 02:29:58,147 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 28 transitions, 127 flow [2022-12-06 02:29:58,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:29:58,147 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:58,148 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:58,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:29:58,148 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:29:58,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:58,149 INFO L85 PathProgramCache]: Analyzing trace with hash -729500201, now seen corresponding path program 1 times [2022-12-06 02:29:58,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:58,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744250116] [2022-12-06 02:29:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:58,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:58,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:58,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744250116] [2022-12-06 02:29:58,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744250116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:29:58,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:29:58,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:29:58,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087195170] [2022-12-06 02:29:58,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:29:58,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:29:58,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:58,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:29:58,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:29:58,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 02:29:58,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 28 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:29:58,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:58,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 02:29:58,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:58,403 INFO L130 PetriNetUnfolder]: 68/129 cut-off events. [2022-12-06 02:29:58,404 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-06 02:29:58,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 129 events. 68/129 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 337 event pairs, 5 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 325. Up to 88 conditions per place. [2022-12-06 02:29:58,405 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 24 selfloop transitions, 4 changer transitions 10/39 dead transitions. [2022-12-06 02:29:58,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 39 transitions, 251 flow [2022-12-06 02:29:58,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:29:58,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:29:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 02:29:58,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-06 02:29:58,407 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2022-12-06 02:29:58,407 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:58,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 39 transitions, 251 flow [2022-12-06 02:29:58,409 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 39 transitions, 251 flow [2022-12-06 02:29:58,409 INFO L188 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-06 02:29:58,410 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:58,411 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 02:29:58,411 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 39 transitions, 251 flow [2022-12-06 02:29:58,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:29:58,411 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:58,411 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:58,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:29:58,412 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:29:58,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:58,412 INFO L85 PathProgramCache]: Analyzing trace with hash 670808102, now seen corresponding path program 1 times [2022-12-06 02:29:58,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:58,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911449187] [2022-12-06 02:29:58,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:58,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:58,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:29:58,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:58,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911449187] [2022-12-06 02:29:58,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911449187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:29:58,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:29:58,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:29:58,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787014653] [2022-12-06 02:29:58,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:29:58,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:29:58,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:58,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:29:58,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:29:58,565 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2022-12-06 02:29:58,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 39 transitions, 251 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:29:58,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:58,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2022-12-06 02:29:58,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:58,661 INFO L130 PetriNetUnfolder]: 83/170 cut-off events. [2022-12-06 02:29:58,662 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2022-12-06 02:29:58,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 170 events. 83/170 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 563 event pairs, 2 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 423. Up to 115 conditions per place. [2022-12-06 02:29:58,666 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 24 selfloop transitions, 2 changer transitions 24/54 dead transitions. [2022-12-06 02:29:58,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 54 transitions, 456 flow [2022-12-06 02:29:58,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:29:58,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:29:58,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 02:29:58,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 02:29:58,671 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2022-12-06 02:29:58,671 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:58,672 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 54 transitions, 456 flow [2022-12-06 02:29:58,673 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 54 transitions, 456 flow [2022-12-06 02:29:58,673 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-06 02:30:00,491 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:30:00,492 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1821 [2022-12-06 02:30:00,492 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 53 transitions, 448 flow [2022-12-06 02:30:00,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:00,492 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:00,493 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:00,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:30:00,493 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:30:00,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:00,493 INFO L85 PathProgramCache]: Analyzing trace with hash -917539800, now seen corresponding path program 1 times [2022-12-06 02:30:00,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:00,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728868568] [2022-12-06 02:30:00,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:00,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:00,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:00,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728868568] [2022-12-06 02:30:00,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728868568] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:00,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652710895] [2022-12-06 02:30:00,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:00,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:00,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:00,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:00,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 02:30:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:00,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 02:30:00,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:00,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 116 [2022-12-06 02:30:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:01,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:01,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-12-06 02:30:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:01,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652710895] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:01,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:01,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 10 [2022-12-06 02:30:01,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632339432] [2022-12-06 02:30:01,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:01,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 02:30:01,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:01,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 02:30:01,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-06 02:30:01,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 02:30:01,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 53 transitions, 448 flow. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:01,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:01,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 02:30:01,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:01,400 INFO L130 PetriNetUnfolder]: 107/219 cut-off events. [2022-12-06 02:30:01,400 INFO L131 PetriNetUnfolder]: For 133/137 co-relation queries the response was YES. [2022-12-06 02:30:01,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 219 events. 107/219 cut-off events. For 133/137 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 802 event pairs, 8 based on Foata normal form. 4/177 useless extension candidates. Maximal degree in co-relation 777. Up to 165 conditions per place. [2022-12-06 02:30:01,402 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 24 selfloop transitions, 5 changer transitions 46/76 dead transitions. [2022-12-06 02:30:01,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 76 transitions, 794 flow [2022-12-06 02:30:01,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:30:01,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:30:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-12-06 02:30:01,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3875 [2022-12-06 02:30:01,406 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 14 predicate places. [2022-12-06 02:30:01,406 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:01,407 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 76 transitions, 794 flow [2022-12-06 02:30:01,410 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 76 transitions, 794 flow [2022-12-06 02:30:01,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-06 02:30:01,411 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:30:01,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 02:30:01,413 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 76 transitions, 794 flow [2022-12-06 02:30:01,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:01,440 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:01,440 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:01,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:01,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:01,641 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:30:01,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1169952180, now seen corresponding path program 2 times [2022-12-06 02:30:01,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:01,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742027197] [2022-12-06 02:30:01,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:01,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:02,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:02,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742027197] [2022-12-06 02:30:02,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742027197] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:02,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972236710] [2022-12-06 02:30:02,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:30:02,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:02,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:02,318 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:02,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 02:30:02,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:30:02,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:30:02,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 02:30:02,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:02,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-06 02:30:02,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:30:02,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:30:02,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 02:30:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:02,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:03,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:03,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972236710] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:03,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:03,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2022-12-06 02:30:03,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954411292] [2022-12-06 02:30:03,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:03,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:30:03,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:03,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:30:03,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=317, Unknown=3, NotChecked=0, Total=420 [2022-12-06 02:30:03,277 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:30:03,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 76 transitions, 794 flow. Second operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:03,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:03,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:30:03,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:03,435 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~front~0 4))) (let ((.cse4 (* c_~back~0 4)) (.cse14 (select |c_#memory_int| c_~queue~0.base)) (.cse11 (+ c_~queue~0.offset .cse5))) (let ((.cse6 (not (< c_~front~0 (+ c_~back~0 1)))) (.cse7 (not (< c_~back~0 c_~n~0))) (.cse13 (let ((.cse15 (+ c_~sum~0 (select .cse14 .cse11)))) (and (not (< .cse15 0)) (not (< 1 .cse15))))) (.cse10 (+ c_~queue~0.offset .cse4)) (.cse8 (not (<= 0 c_~back~0)))) (and (or (let ((.cse1 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_102 (Array Int Int)) (v_ArrVal_103 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_103) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< (+ (select .cse0 .cse1) c_~sum~0) 0)) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_102 (Array Int Int)) (v_ArrVal_103 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_103) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< 1 (+ (select .cse3 .cse1) c_~sum~0))) (not (= (select .cse3 .cse2) 1))))))) .cse6 (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse7 .cse8) (not (< 1 c_~sum~0)) (or .cse6 .cse7 .cse8 (and (forall ((v_ArrVal_103 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_103) c_~queue~0.base))) (or (not (= (select .cse9 .cse10) 1)) (not (< (+ c_~sum~0 (select .cse9 .cse11)) 0))))) (forall ((v_ArrVal_103 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_103) c_~queue~0.base))) (or (not (< 1 (+ c_~sum~0 (select .cse12 .cse11)))) (not (= (select .cse12 .cse10) 1))))))) (not (< c_~sum~0 0)) (or (not (< c_~front~0 c_~back~0)) .cse13) (or .cse6 .cse7 .cse13 (not (= (select .cse14 .cse10) 1)) .cse8))))) is different from false [2022-12-06 02:30:03,948 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (or (not (< c_~front~0 (+ c_~back~0 1))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)) (let ((.cse1 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_103 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_103) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (not (< (+ c_~sum~0 (select .cse0 .cse2)) 0))))) (forall ((v_ArrVal_103 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_103) c_~queue~0.base))) (or (not (< 1 (+ c_~sum~0 (select .cse3 .cse2)))) (not (= (select .cse3 .cse1) 1)))))))) (or (= (mod |c_thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (let ((.cse4 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse2)))) (and (not (< .cse4 0)) (not (< 1 .cse4))))))) is different from false [2022-12-06 02:30:04,649 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~back~0 4))) (let ((.cse5 (* c_~front~0 4)) (.cse18 (select |c_#memory_int| c_~queue~0.base)) (.cse10 (+ c_~queue~0.offset .cse4))) (let ((.cse15 (select .cse18 .cse10)) (.cse11 (+ c_~queue~0.offset .cse5))) (let ((.cse6 (not (< c_~front~0 (+ c_~back~0 1)))) (.cse7 (not (< c_~back~0 c_~n~0))) (.cse16 (let ((.cse17 (+ c_~sum~0 (select .cse18 .cse11)))) (and (not (< .cse17 0)) (not (< 1 .cse17))))) (.cse14 (not (= .cse15 1))) (.cse8 (not (<= 0 c_~back~0)))) (and (or (let ((.cse1 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_102 (Array Int Int)) (v_ArrVal_103 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_103) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< (+ (select .cse0 .cse1) c_~sum~0) 0)) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_102 (Array Int Int)) (v_ArrVal_103 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_103) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< 1 (+ (select .cse3 .cse1) c_~sum~0))) (not (= (select .cse3 .cse2) 1))))))) .cse6 (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse7 .cse8) (<= 1 c_~sum~0) (or .cse6 .cse7 .cse8 (and (forall ((v_ArrVal_103 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_103) c_~queue~0.base))) (or (not (= (select .cse9 .cse10) 1)) (not (< (+ c_~sum~0 (select .cse9 .cse11)) 0))))) (forall ((v_ArrVal_103 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_103) c_~queue~0.base))) (or (not (< 1 (+ c_~sum~0 (select .cse12 .cse11)))) (not (= (select .cse12 .cse10) 1))))))) (or (let ((.cse13 (= (mod |c_thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (and (or .cse6 .cse13 .cse7 .cse14 .cse8) (or .cse6 (not .cse13) .cse7 (not (= (+ .cse15 1) 0)) .cse8))) .cse16) (or (not (< c_~front~0 c_~back~0)) .cse16) (<= c_~sum~0 1) (or .cse6 .cse7 .cse16 .cse14 .cse8)))))) is different from false [2022-12-06 02:30:05,050 INFO L130 PetriNetUnfolder]: 369/739 cut-off events. [2022-12-06 02:30:05,050 INFO L131 PetriNetUnfolder]: For 738/738 co-relation queries the response was YES. [2022-12-06 02:30:05,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4260 conditions, 739 events. 369/739 cut-off events. For 738/738 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3763 event pairs, 12 based on Foata normal form. 2/584 useless extension candidates. Maximal degree in co-relation 1299. Up to 598 conditions per place. [2022-12-06 02:30:05,055 INFO L137 encePairwiseOnDemand]: 4/20 looper letters, 81 selfloop transitions, 35 changer transitions 166/282 dead transitions. [2022-12-06 02:30:05,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 282 transitions, 3426 flow [2022-12-06 02:30:05,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 02:30:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 02:30:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 184 transitions. [2022-12-06 02:30:05,058 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30666666666666664 [2022-12-06 02:30:05,059 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 43 predicate places. [2022-12-06 02:30:05,059 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:05,059 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 282 transitions, 3426 flow [2022-12-06 02:30:05,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 282 transitions, 3426 flow [2022-12-06 02:30:05,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:05,070 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [537] L57-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_In_3| 256) 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [515] L99-4-->L100-3: Formula: (and (= |v_#pthreadsForks_41| (+ |v_#pthreadsForks_42| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_31| |v_#pthreadsForks_42|) (= (store |v_#memory_int_121| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_121| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre13#1_31|)) |v_#memory_int_120|)) InVars {#pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_31|, #pthreadsForks=|v_#pthreadsForks_41|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 02:30:05,141 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L57-->L55: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_25| 256) 0)) (= (ite (and (<= 0 v_~front~0_79) (< v_~front~0_79 v_~n~0_56)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (= (+ v_~element~0_48 v_~sum~0_58) v_~sum~0_57) (= (+ v_~front~0_79 1) v_~front~0_78) (= v_~element~0_48 (select (select |v_#memory_int_128| v_~queue~0.base_88) (+ (* v_~front~0_79 4) v_~queue~0.offset_88)))) InVars {~sum~0=v_~sum~0_58, ~queue~0.offset=v_~queue~0.offset_88, #memory_int=|v_#memory_int_128|, ~queue~0.base=v_~queue~0.base_88, ~n~0=v_~n~0_56, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_25|, ~front~0=v_~front~0_79} OutVars{~sum~0=v_~sum~0_57, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_31|, ~queue~0.offset=v_~queue~0.offset_88, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~element~0=v_~element~0_48, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~queue~0.base=v_~queue~0.base_88, ~n~0=v_~n~0_56, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_43|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_25|, ~front~0=v_~front~0_78} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~element~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] and [530] L100-4-->L101-1: Formula: (= (select (select |v_#memory_int_134| |v_ULTIMATE.start_main_~#t1~0#1.base_33|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) |v_ULTIMATE.start_main_#t~mem15#1_24|) InVars {#memory_int=|v_#memory_int_134|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_33|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_37|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_24|, #memory_int=|v_#memory_int_134|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_33|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-06 02:30:05,246 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L57-->L55: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_25| 256) 0)) (= (ite (and (<= 0 v_~front~0_79) (< v_~front~0_79 v_~n~0_56)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (= (+ v_~element~0_48 v_~sum~0_58) v_~sum~0_57) (= (+ v_~front~0_79 1) v_~front~0_78) (= v_~element~0_48 (select (select |v_#memory_int_128| v_~queue~0.base_88) (+ (* v_~front~0_79 4) v_~queue~0.offset_88)))) InVars {~sum~0=v_~sum~0_58, ~queue~0.offset=v_~queue~0.offset_88, #memory_int=|v_#memory_int_128|, ~queue~0.base=v_~queue~0.base_88, ~n~0=v_~n~0_56, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_25|, ~front~0=v_~front~0_79} OutVars{~sum~0=v_~sum~0_57, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_31|, ~queue~0.offset=v_~queue~0.offset_88, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~element~0=v_~element~0_48, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~queue~0.base=v_~queue~0.base_88, ~n~0=v_~n~0_56, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_43|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_25|, ~front~0=v_~front~0_78} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~element~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] and [541] L65-4-->L65-4: Formula: (let ((.cse5 (= (mod |v_thread2Thread1of1ForFork1_~flag~0#1_In_5| 256) 0))) (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_In_3| 256) 0))) (.cse1 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10| 0))) (.cse2 (= (ite (= (ite .cse5 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~flag~0#1_Out_8|)) (.cse3 (select (select |v_#memory_int_In_25| v_~queue~0.base_In_9) (+ (* v_~back~0_In_8 4) v_~queue~0.offset_In_9))) (.cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|)) (.cse6 (= v_~back~0_Out_22 (+ v_~back~0_In_8 1))) (.cse7 (not (= (ite (and (< v_~back~0_In_8 v_~n~0_In_5) (<= 0 v_~back~0_In_8)) 1 0) 0)))) (or (and .cse0 (= |v_thread2Thread1of1ForFork1_#t~mem4#1_Out_8| |v_thread2Thread1of1ForFork1_#t~mem4#1_In_3|) .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~post5#1_In_3| |v_thread2Thread1of1ForFork1_#t~post5#1_Out_8|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (= (+ .cse3 1) 0) 1 0)) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4| |v_thread2Thread1of1ForFork1_#t~mem6#1_In_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (= .cse3 1) 1 0)) (not .cse5) (= |v_thread2Thread1of1ForFork1_#t~post7#1_Out_6| |v_thread2Thread1of1ForFork1_#t~post7#1_In_1|) .cse4 .cse6 .cse7)))) InVars {thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_In_3|, ~queue~0.offset=v_~queue~0.offset_In_9, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_In_5|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_In_3|, ~back~0=v_~back~0_In_8, #memory_int=|v_#memory_int_In_25|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_9, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_In_1|, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_9, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_Out_8|, ~back~0=v_~back~0_Out_22, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_9, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_6|, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_Out_8|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_Out_8|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~flag~0#1, thread2Thread1of1ForFork1_#t~mem4#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~nondet3#1] [2022-12-06 02:30:05,561 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L57-->L55: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_25| 256) 0)) (= (ite (and (<= 0 v_~front~0_79) (< v_~front~0_79 v_~n~0_56)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (= (+ v_~element~0_48 v_~sum~0_58) v_~sum~0_57) (= (+ v_~front~0_79 1) v_~front~0_78) (= v_~element~0_48 (select (select |v_#memory_int_128| v_~queue~0.base_88) (+ (* v_~front~0_79 4) v_~queue~0.offset_88)))) InVars {~sum~0=v_~sum~0_58, ~queue~0.offset=v_~queue~0.offset_88, #memory_int=|v_#memory_int_128|, ~queue~0.base=v_~queue~0.base_88, ~n~0=v_~n~0_56, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_25|, ~front~0=v_~front~0_79} OutVars{~sum~0=v_~sum~0_57, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_31|, ~queue~0.offset=v_~queue~0.offset_88, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~element~0=v_~element~0_48, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~queue~0.base=v_~queue~0.base_88, ~n~0=v_~n~0_56, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_43|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_25|, ~front~0=v_~front~0_78} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~element~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] and [540] L65-4-->thread2EXIT: Formula: (and (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_In_1| 256) 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_6| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_6| 0)) InVars {thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_6|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~nondet3#1] [2022-12-06 02:30:09,801 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 02:30:09,802 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4743 [2022-12-06 02:30:09,802 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 278 transitions, 3390 flow [2022-12-06 02:30:09,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:09,802 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:09,802 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:09,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:10,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:10,003 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:30:10,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:10,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1703955402, now seen corresponding path program 1 times [2022-12-06 02:30:10,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:10,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084292361] [2022-12-06 02:30:10,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:10,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:10,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:10,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084292361] [2022-12-06 02:30:10,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084292361] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:10,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523426809] [2022-12-06 02:30:10,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:10,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:10,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:10,511 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:10,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 02:30:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:10,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 02:30:10,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:10,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 02:30:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:10,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:10,929 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:30:10,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 154 [2022-12-06 02:30:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:11,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523426809] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:11,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:11,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2022-12-06 02:30:11,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633882713] [2022-12-06 02:30:11,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:11,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:30:11,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:11,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:30:11,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:30:11,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:30:11,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 278 transitions, 3390 flow. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:11,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:11,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:30:11,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:12,865 INFO L130 PetriNetUnfolder]: 553/1103 cut-off events. [2022-12-06 02:30:12,865 INFO L131 PetriNetUnfolder]: For 1200/1200 co-relation queries the response was YES. [2022-12-06 02:30:12,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7543 conditions, 1103 events. 553/1103 cut-off events. For 1200/1200 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6188 event pairs, 2 based on Foata normal form. 7/851 useless extension candidates. Maximal degree in co-relation 2751. Up to 916 conditions per place. [2022-12-06 02:30:12,872 INFO L137 encePairwiseOnDemand]: 5/27 looper letters, 111 selfloop transitions, 57 changer transitions 286/454 dead transitions. [2022-12-06 02:30:12,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 454 transitions, 6469 flow [2022-12-06 02:30:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 02:30:12,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 02:30:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 205 transitions. [2022-12-06 02:30:12,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26181353767560667 [2022-12-06 02:30:12,879 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 67 predicate places. [2022-12-06 02:30:12,879 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:12,879 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 454 transitions, 6469 flow [2022-12-06 02:30:12,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 454 transitions, 6469 flow [2022-12-06 02:30:12,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:12,949 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [368] $Ultimate##0-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] and [515] L99-4-->L100-3: Formula: (and (= |v_#pthreadsForks_41| (+ |v_#pthreadsForks_42| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_31| |v_#pthreadsForks_42|) (= (store |v_#memory_int_121| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_121| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre13#1_31|)) |v_#memory_int_120|)) InVars {#pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_31|, #pthreadsForks=|v_#pthreadsForks_41|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 02:30:12,978 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:30:12,978 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 02:30:12,979 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 453 transitions, 6461 flow [2022-12-06 02:30:12,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:12,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:12,979 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:12,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:13,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:13,185 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:30:13,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:13,185 INFO L85 PathProgramCache]: Analyzing trace with hash 236826472, now seen corresponding path program 1 times [2022-12-06 02:30:13,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:13,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851564363] [2022-12-06 02:30:13,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:13,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:30:13,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:13,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851564363] [2022-12-06 02:30:13,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851564363] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:13,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435894974] [2022-12-06 02:30:13,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:13,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:13,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:13,340 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:13,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 02:30:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:13,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 02:30:13,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:13,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 116 [2022-12-06 02:30:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:13,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:13,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-12-06 02:30:13,686 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:30:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:13,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435894974] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:13,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:13,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2022-12-06 02:30:13,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806006125] [2022-12-06 02:30:13,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:13,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:30:13,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:13,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:30:13,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:30:13,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 02:30:13,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 453 transitions, 6461 flow. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:13,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:13,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 02:30:13,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:14,456 INFO L130 PetriNetUnfolder]: 687/1379 cut-off events. [2022-12-06 02:30:14,457 INFO L131 PetriNetUnfolder]: For 1824/1824 co-relation queries the response was YES. [2022-12-06 02:30:14,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10775 conditions, 1379 events. 687/1379 cut-off events. For 1824/1824 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7972 event pairs, 4 based on Foata normal form. 0/1067 useless extension candidates. Maximal degree in co-relation 3035. Up to 1165 conditions per place. [2022-12-06 02:30:14,466 INFO L137 encePairwiseOnDemand]: 13/27 looper letters, 157 selfloop transitions, 37 changer transitions 364/560 dead transitions. [2022-12-06 02:30:14,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 560 transitions, 9077 flow [2022-12-06 02:30:14,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 02:30:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 02:30:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 218 transitions. [2022-12-06 02:30:14,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35104669887278583 [2022-12-06 02:30:14,469 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 84 predicate places. [2022-12-06 02:30:14,469 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:14,469 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 560 transitions, 9077 flow [2022-12-06 02:30:14,490 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 560 transitions, 9077 flow [2022-12-06 02:30:14,490 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:14,492 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:30:14,492 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 02:30:14,493 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 560 transitions, 9077 flow [2022-12-06 02:30:14,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:14,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:14,493 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:14,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:14,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:14,699 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:30:14,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:14,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1864099705, now seen corresponding path program 1 times [2022-12-06 02:30:14,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:14,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750200447] [2022-12-06 02:30:14,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:14,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:14,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:14,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750200447] [2022-12-06 02:30:14,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750200447] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:14,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099825969] [2022-12-06 02:30:14,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:14,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:14,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:14,916 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:14,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 02:30:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:15,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 02:30:15,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:15,069 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:30:15,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 9 [2022-12-06 02:30:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:15,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:15,408 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:30:15,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 241 treesize of output 193 [2022-12-06 02:30:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:15,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099825969] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:15,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:15,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 17 [2022-12-06 02:30:15,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923628627] [2022-12-06 02:30:15,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:15,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:30:15,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:15,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:30:15,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:30:15,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:30:15,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 560 transitions, 9077 flow. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:15,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:15,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:30:15,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:16,689 INFO L130 PetriNetUnfolder]: 1095/2155 cut-off events. [2022-12-06 02:30:16,690 INFO L131 PetriNetUnfolder]: For 1947/1947 co-relation queries the response was YES. [2022-12-06 02:30:16,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19055 conditions, 2155 events. 1095/2155 cut-off events. For 1947/1947 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13212 event pairs, 0 based on Foata normal form. 30/1705 useless extension candidates. Maximal degree in co-relation 6972. Up to 1881 conditions per place. [2022-12-06 02:30:16,712 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 311 selfloop transitions, 137 changer transitions 443/891 dead transitions. [2022-12-06 02:30:16,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 891 transitions, 16143 flow [2022-12-06 02:30:16,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 02:30:16,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 02:30:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 188 transitions. [2022-12-06 02:30:16,714 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23209876543209876 [2022-12-06 02:30:16,715 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 113 predicate places. [2022-12-06 02:30:16,716 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:16,716 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 891 transitions, 16143 flow [2022-12-06 02:30:16,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 891 transitions, 16143 flow [2022-12-06 02:30:16,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:16,750 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:30:16,751 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 02:30:16,751 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 891 transitions, 16143 flow [2022-12-06 02:30:16,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:16,751 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:16,751 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:16,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:16,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:16,957 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:30:16,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash 149853236, now seen corresponding path program 1 times [2022-12-06 02:30:16,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:16,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768196123] [2022-12-06 02:30:16,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:16,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:17,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:17,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768196123] [2022-12-06 02:30:17,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768196123] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:17,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894111858] [2022-12-06 02:30:17,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:17,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:17,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:17,990 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:17,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 02:30:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:18,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 02:30:18,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:18,354 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:30:18,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 14 [2022-12-06 02:30:18,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:18,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:18,809 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-06 02:30:18,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 280 treesize of output 250 [2022-12-06 02:30:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:19,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894111858] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:19,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:19,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 20 [2022-12-06 02:30:19,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379316821] [2022-12-06 02:30:19,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:19,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 02:30:19,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:19,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 02:30:19,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2022-12-06 02:30:19,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:30:19,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 891 transitions, 16143 flow. Second operand has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:19,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:19,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:30:19,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:22,659 INFO L130 PetriNetUnfolder]: 1765/3406 cut-off events. [2022-12-06 02:30:22,659 INFO L131 PetriNetUnfolder]: For 2417/2417 co-relation queries the response was YES. [2022-12-06 02:30:22,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33658 conditions, 3406 events. 1765/3406 cut-off events. For 2417/2417 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22888 event pairs, 0 based on Foata normal form. 19/2630 useless extension candidates. Maximal degree in co-relation 12966. Up to 3075 conditions per place. [2022-12-06 02:30:22,685 INFO L137 encePairwiseOnDemand]: 7/27 looper letters, 376 selfloop transitions, 74 changer transitions 947/1397 dead transitions. [2022-12-06 02:30:22,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 1397 transitions, 28131 flow [2022-12-06 02:30:22,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-12-06 02:30:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2022-12-06 02:30:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 332 transitions. [2022-12-06 02:30:22,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22770919067215364 [2022-12-06 02:30:22,689 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 166 predicate places. [2022-12-06 02:30:22,689 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:22,689 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 1397 transitions, 28131 flow [2022-12-06 02:30:22,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 1397 transitions, 28131 flow [2022-12-06 02:30:22,734 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:25,184 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:30:25,185 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2496 [2022-12-06 02:30:25,185 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 1396 transitions, 28111 flow [2022-12-06 02:30:25,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:25,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:25,186 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:25,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:25,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:25,391 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:30:25,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:25,392 INFO L85 PathProgramCache]: Analyzing trace with hash 164268882, now seen corresponding path program 2 times [2022-12-06 02:30:25,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:25,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756712761] [2022-12-06 02:30:25,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:25,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:25,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:25,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756712761] [2022-12-06 02:30:25,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756712761] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:25,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841411627] [2022-12-06 02:30:25,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:30:25,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:25,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:25,634 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:25,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 02:30:25,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:30:25,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:30:25,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 02:30:25,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:26,011 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:30:26,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 156 [2022-12-06 02:30:26,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:26,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:26,392 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:30:26,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 171 [2022-12-06 02:30:26,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:26,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841411627] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:26,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:26,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 7] total 16 [2022-12-06 02:30:26,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029085167] [2022-12-06 02:30:26,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:26,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:30:26,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:26,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:30:26,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-12-06 02:30:26,460 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 02:30:26,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 1396 transitions, 28111 flow. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:26,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:26,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 02:30:26,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:28,333 INFO L130 PetriNetUnfolder]: 2083/4018 cut-off events. [2022-12-06 02:30:28,334 INFO L131 PetriNetUnfolder]: For 2656/2656 co-relation queries the response was YES. [2022-12-06 02:30:28,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43727 conditions, 4018 events. 2083/4018 cut-off events. For 2656/2656 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 28142 event pairs, 0 based on Foata normal form. 0/3103 useless extension candidates. Maximal degree in co-relation 17238. Up to 3688 conditions per place. [2022-12-06 02:30:28,355 INFO L137 encePairwiseOnDemand]: 11/28 looper letters, 417 selfloop transitions, 142 changer transitions 1096/1655 dead transitions. [2022-12-06 02:30:28,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 1655 transitions, 36593 flow [2022-12-06 02:30:28,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 02:30:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 02:30:28,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 117 transitions. [2022-12-06 02:30:28,356 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2199248120300752 [2022-12-06 02:30:28,357 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 182 predicate places. [2022-12-06 02:30:28,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:28,357 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 1655 transitions, 36593 flow [2022-12-06 02:30:28,405 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 1655 transitions, 36593 flow [2022-12-06 02:30:28,405 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:28,409 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:30:28,410 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 02:30:28,410 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 1655 transitions, 36593 flow [2022-12-06 02:30:28,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:28,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:28,411 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:28,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:28,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:28,616 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:30:28,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:28,616 INFO L85 PathProgramCache]: Analyzing trace with hash -702773388, now seen corresponding path program 3 times [2022-12-06 02:30:28,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:28,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849078706] [2022-12-06 02:30:28,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:28,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:29,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:29,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849078706] [2022-12-06 02:30:29,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849078706] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:29,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485592498] [2022-12-06 02:30:29,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:30:29,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:29,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:29,510 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:29,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 02:30:29,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:30:29,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:30:29,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-06 02:30:29,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:29,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 02:30:29,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:30:29,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:30:29,881 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:30:29,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 14 [2022-12-06 02:30:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:29,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:30,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485592498] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:30,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:30,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 24 [2022-12-06 02:30:30,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109711340] [2022-12-06 02:30:30,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:30,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 02:30:30,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:30,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 02:30:30,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=511, Unknown=2, NotChecked=0, Total=650 [2022-12-06 02:30:30,811 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 02:30:30,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 1655 transitions, 36593 flow. Second operand has 26 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:30,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:30,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 02:30:30,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:42,910 INFO L130 PetriNetUnfolder]: 3232/6106 cut-off events. [2022-12-06 02:30:42,910 INFO L131 PetriNetUnfolder]: For 3968/3968 co-relation queries the response was YES. [2022-12-06 02:30:42,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72397 conditions, 6106 events. 3232/6106 cut-off events. For 3968/3968 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 46047 event pairs, 0 based on Foata normal form. 6/4758 useless extension candidates. Maximal degree in co-relation 24172. Up to 5626 conditions per place. [2022-12-06 02:30:42,944 INFO L137 encePairwiseOnDemand]: 6/28 looper letters, 715 selfloop transitions, 174 changer transitions 1589/2478 dead transitions. [2022-12-06 02:30:42,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 2478 transitions, 59585 flow [2022-12-06 02:30:42,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-06 02:30:42,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-06 02:30:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 296 transitions. [2022-12-06 02:30:42,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22981366459627328 [2022-12-06 02:30:42,950 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 227 predicate places. [2022-12-06 02:30:42,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:42,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 249 places, 2478 transitions, 59585 flow [2022-12-06 02:30:43,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 249 places, 2478 transitions, 59585 flow [2022-12-06 02:30:43,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:43,038 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:30:43,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 02:30:43,039 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 2478 transitions, 59585 flow [2022-12-06 02:30:43,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:43,039 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:43,039 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:43,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:43,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 02:30:43,245 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:30:43,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:43,245 INFO L85 PathProgramCache]: Analyzing trace with hash 250435086, now seen corresponding path program 1 times [2022-12-06 02:30:43,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:43,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106181886] [2022-12-06 02:30:43,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:43,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:44,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:44,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106181886] [2022-12-06 02:30:44,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106181886] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:44,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110970923] [2022-12-06 02:30:44,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:44,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:44,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:44,408 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:44,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 02:30:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:44,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 02:30:44,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:44,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:30:44,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 14 [2022-12-06 02:30:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:44,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:45,242 INFO L321 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2022-12-06 02:30:45,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 234 [2022-12-06 02:30:45,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:45,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110970923] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:45,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:45,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 21 [2022-12-06 02:30:45,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154152126] [2022-12-06 02:30:45,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:45,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 02:30:45,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:45,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 02:30:45,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2022-12-06 02:30:45,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 02:30:45,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 2478 transitions, 59585 flow. Second operand has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:45,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:45,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 02:30:45,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:50,444 INFO L130 PetriNetUnfolder]: 4366/8145 cut-off events. [2022-12-06 02:30:50,444 INFO L131 PetriNetUnfolder]: For 4463/4463 co-relation queries the response was YES. [2022-12-06 02:30:50,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104934 conditions, 8145 events. 4366/8145 cut-off events. For 4463/4463 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 62542 event pairs, 0 based on Foata normal form. 23/6298 useless extension candidates. Maximal degree in co-relation 31721. Up to 7665 conditions per place. [2022-12-06 02:30:50,488 INFO L137 encePairwiseOnDemand]: 10/28 looper letters, 1062 selfloop transitions, 302 changer transitions 1911/3275 dead transitions. [2022-12-06 02:30:50,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 3275 transitions, 85409 flow [2022-12-06 02:30:50,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-06 02:30:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-06 02:30:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 266 transitions. [2022-12-06 02:30:50,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2159090909090909 [2022-12-06 02:30:50,491 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 270 predicate places. [2022-12-06 02:30:50,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:50,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 292 places, 3275 transitions, 85409 flow [2022-12-06 02:30:50,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 292 places, 3275 transitions, 85409 flow [2022-12-06 02:30:50,603 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:50,610 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:30:50,611 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-06 02:30:50,611 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 3275 transitions, 85409 flow [2022-12-06 02:30:50,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:50,611 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:50,611 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:50,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:50,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:50,816 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:30:50,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:50,817 INFO L85 PathProgramCache]: Analyzing trace with hash 581733135, now seen corresponding path program 1 times [2022-12-06 02:30:50,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:50,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401902298] [2022-12-06 02:30:50,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:50,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:52,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:52,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401902298] [2022-12-06 02:30:52,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401902298] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:52,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751117426] [2022-12-06 02:30:52,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:52,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:52,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:52,548 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:52,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 02:30:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:52,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 02:30:52,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:52,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:30:52,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 14 [2022-12-06 02:30:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:52,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:53,443 INFO L321 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2022-12-06 02:30:53,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 268 treesize of output 226 [2022-12-06 02:30:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:53,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751117426] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:53,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:53,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 22 [2022-12-06 02:30:53,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013843623] [2022-12-06 02:30:53,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:53,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:30:53,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:53,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:30:53,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-12-06 02:30:53,803 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 02:30:53,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 3275 transitions, 85409 flow. Second operand has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:53,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:53,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 02:30:53,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:31:02,027 INFO L130 PetriNetUnfolder]: 5236/9663 cut-off events. [2022-12-06 02:31:02,028 INFO L131 PetriNetUnfolder]: For 4809/4809 co-relation queries the response was YES. [2022-12-06 02:31:02,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134158 conditions, 9663 events. 5236/9663 cut-off events. For 4809/4809 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 75941 event pairs, 0 based on Foata normal form. 5/7480 useless extension candidates. Maximal degree in co-relation 41331. Up to 9183 conditions per place. [2022-12-06 02:31:02,077 INFO L137 encePairwiseOnDemand]: 6/28 looper letters, 1350 selfloop transitions, 456 changer transitions 2072/3878 dead transitions. [2022-12-06 02:31:02,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 3878 transitions, 108819 flow [2022-12-06 02:31:02,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-06 02:31:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-12-06 02:31:02,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 325 transitions. [2022-12-06 02:31:02,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2001231527093596 [2022-12-06 02:31:02,081 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 327 predicate places. [2022-12-06 02:31:02,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:31:02,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 349 places, 3878 transitions, 108819 flow [2022-12-06 02:31:02,195 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 349 places, 3878 transitions, 108819 flow [2022-12-06 02:31:02,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:31:05,174 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:31:05,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3094 [2022-12-06 02:31:05,175 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 3877 transitions, 108791 flow [2022-12-06 02:31:05,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:31:05,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:31:05,176 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:31:05,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-06 02:31:05,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 02:31:05,380 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:31:05,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:31:05,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1020603328, now seen corresponding path program 2 times [2022-12-06 02:31:05,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:31:05,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768094645] [2022-12-06 02:31:05,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:31:05,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:31:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:31:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:31:06,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:31:06,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768094645] [2022-12-06 02:31:06,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768094645] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:31:06,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790329536] [2022-12-06 02:31:06,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:31:06,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:31:06,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:31:06,825 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:31:06,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 02:31:06,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:31:06,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:31:06,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 02:31:06,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:31:06,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2022-12-06 02:31:06,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:31:07,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:31:07,445 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:31:07,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 18 [2022-12-06 02:31:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:31:07,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:31:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:31:08,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790329536] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:31:08,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:31:08,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 30 [2022-12-06 02:31:08,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445791391] [2022-12-06 02:31:08,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:31:08,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-06 02:31:08,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:31:08,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-06 02:31:08,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=826, Unknown=1, NotChecked=0, Total=992 [2022-12-06 02:31:08,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 02:31:08,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 3877 transitions, 108791 flow. Second operand has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 31 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:31:08,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:31:08,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 02:31:08,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:31:36,583 INFO L130 PetriNetUnfolder]: 9755/17848 cut-off events. [2022-12-06 02:31:36,583 INFO L131 PetriNetUnfolder]: For 7009/7009 co-relation queries the response was YES. [2022-12-06 02:31:36,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265997 conditions, 17848 events. 9755/17848 cut-off events. For 7009/7009 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 151277 event pairs, 0 based on Foata normal form. 29/13829 useless extension candidates. Maximal degree in co-relation 117128. Up to 17367 conditions per place. [2022-12-06 02:31:36,679 INFO L137 encePairwiseOnDemand]: 6/29 looper letters, 2715 selfloop transitions, 760 changer transitions 3692/7167 dead transitions. [2022-12-06 02:31:36,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 7167 transitions, 215401 flow [2022-12-06 02:31:36,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-12-06 02:31:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2022-12-06 02:31:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 556 transitions. [2022-12-06 02:31:36,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1956368754398311 [2022-12-06 02:31:36,685 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 420 predicate places. [2022-12-06 02:31:36,685 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:31:36,686 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 442 places, 7167 transitions, 215401 flow [2022-12-06 02:31:36,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 442 places, 7167 transitions, 215401 flow [2022-12-06 02:31:36,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:31:36,918 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:31:36,919 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-06 02:31:36,919 INFO L495 AbstractCegarLoop]: Abstraction has has 442 places, 7167 transitions, 215401 flow [2022-12-06 02:31:36,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 31 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:31:36,919 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:31:36,920 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:31:36,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 02:31:37,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 02:31:37,125 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:31:37,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:31:37,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1606638330, now seen corresponding path program 3 times [2022-12-06 02:31:37,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:31:37,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066328254] [2022-12-06 02:31:37,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:31:37,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:31:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:31:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:31:38,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:31:38,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066328254] [2022-12-06 02:31:38,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066328254] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:31:38,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873392235] [2022-12-06 02:31:38,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:31:38,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:31:38,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:31:38,476 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:31:38,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 02:31:38,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:31:38,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:31:38,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-06 02:31:38,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:31:38,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2022-12-06 02:31:38,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:31:38,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:31:39,021 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:31:39,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 18 [2022-12-06 02:31:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:31:39,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:31:40,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:31:40,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873392235] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:31:40,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:31:40,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 30 [2022-12-06 02:31:40,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442399046] [2022-12-06 02:31:40,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:31:40,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-06 02:31:40,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:31:40,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-06 02:31:40,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=802, Unknown=2, NotChecked=0, Total=992 [2022-12-06 02:31:40,150 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 02:31:40,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 7167 transitions, 215401 flow. Second operand has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 31 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:31:40,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:31:40,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 02:31:40,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:32:13,029 INFO L130 PetriNetUnfolder]: 6933/13010 cut-off events. [2022-12-06 02:32:13,029 INFO L131 PetriNetUnfolder]: For 4949/4949 co-relation queries the response was YES. [2022-12-06 02:32:13,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207734 conditions, 13010 events. 6933/13010 cut-off events. For 4949/4949 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 106478 event pairs, 0 based on Foata normal form. 30/9938 useless extension candidates. Maximal degree in co-relation 79624. Up to 12529 conditions per place. [2022-12-06 02:32:13,092 INFO L137 encePairwiseOnDemand]: 6/29 looper letters, 2090 selfloop transitions, 429 changer transitions 2684/5203 dead transitions. [2022-12-06 02:32:13,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 5203 transitions, 167571 flow [2022-12-06 02:32:13,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-12-06 02:32:13,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2022-12-06 02:32:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 476 transitions. [2022-12-06 02:32:13,095 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2159709618874773 [2022-12-06 02:32:13,095 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 477 predicate places. [2022-12-06 02:32:13,096 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:32:13,096 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 499 places, 5203 transitions, 167571 flow [2022-12-06 02:32:13,238 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 499 places, 5203 transitions, 167571 flow [2022-12-06 02:32:13,238 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:32:13,247 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:32:13,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-06 02:32:13,248 INFO L495 AbstractCegarLoop]: Abstraction has has 499 places, 5203 transitions, 167571 flow [2022-12-06 02:32:13,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 31 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:32:13,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:32:13,248 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:32:13,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 02:32:13,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 02:32:13,451 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:32:13,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:32:13,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1235874906, now seen corresponding path program 1 times [2022-12-06 02:32:13,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:32:13,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280763063] [2022-12-06 02:32:13,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:32:13,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:32:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:32:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:15,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:32:15,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280763063] [2022-12-06 02:32:15,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280763063] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:32:15,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802565311] [2022-12-06 02:32:15,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:32:15,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:32:15,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:32:15,560 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:32:15,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 02:32:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:32:15,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 02:32:15,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:32:16,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:32:16,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 18 [2022-12-06 02:32:16,136 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:16,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:32:17,016 INFO L321 Elim1Store]: treesize reduction 40, result has 72.8 percent of original size [2022-12-06 02:32:17,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 332 treesize of output 320 [2022-12-06 02:32:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:17,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802565311] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:32:17,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:32:17,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-12-06 02:32:17,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897779431] [2022-12-06 02:32:17,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:32:17,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-06 02:32:17,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:32:17,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-06 02:32:17,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2022-12-06 02:32:17,889 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 02:32:17,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 5203 transitions, 167571 flow. Second operand has 30 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:32:17,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:32:17,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 02:32:17,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:32:59,191 INFO L130 PetriNetUnfolder]: 12676/23376 cut-off events. [2022-12-06 02:32:59,192 INFO L131 PetriNetUnfolder]: For 6896/6896 co-relation queries the response was YES. [2022-12-06 02:32:59,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396954 conditions, 23376 events. 12676/23376 cut-off events. For 6896/6896 co-relation queries the response was YES. Maximal size of possible extension queue 1139. Compared 200310 event pairs, 0 based on Foata normal form. 122/17830 useless extension candidates. Maximal degree in co-relation 136252. Up to 22703 conditions per place. [2022-12-06 02:32:59,333 INFO L137 encePairwiseOnDemand]: 7/29 looper letters, 3517 selfloop transitions, 1652 changer transitions 4117/9286 dead transitions. [2022-12-06 02:32:59,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 9286 transitions, 317704 flow [2022-12-06 02:32:59,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2022-12-06 02:32:59,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2022-12-06 02:32:59,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 994 transitions. [2022-12-06 02:32:59,336 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2077324973876698 [2022-12-06 02:32:59,336 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 641 predicate places. [2022-12-06 02:32:59,337 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:32:59,337 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 663 places, 9286 transitions, 317704 flow [2022-12-06 02:32:59,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 663 places, 9286 transitions, 317704 flow [2022-12-06 02:32:59,626 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:32:59,641 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:32:59,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 306 [2022-12-06 02:32:59,642 INFO L495 AbstractCegarLoop]: Abstraction has has 663 places, 9286 transitions, 317704 flow [2022-12-06 02:32:59,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:32:59,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:32:59,642 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:32:59,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 02:32:59,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 02:32:59,846 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:32:59,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:32:59,847 INFO L85 PathProgramCache]: Analyzing trace with hash 458587585, now seen corresponding path program 4 times [2022-12-06 02:32:59,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:32:59,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392886337] [2022-12-06 02:32:59,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:32:59,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:32:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:33:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:33:00,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:33:00,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392886337] [2022-12-06 02:33:00,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392886337] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:33:00,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511215782] [2022-12-06 02:33:00,080 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:33:00,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:33:00,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:33:00,081 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:33:00,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 02:33:00,174 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:33:00,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:33:00,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 02:33:00,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:33:00,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 116 [2022-12-06 02:33:00,299 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:33:00,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:33:00,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-12-06 02:33:00,407 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:33:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:33:00,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511215782] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:33:00,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:33:00,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 02:33:00,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043486707] [2022-12-06 02:33:00,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:33:00,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:33:00,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:33:00,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:33:00,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:33:00,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 02:33:00,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 9286 transitions, 317704 flow. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:00,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:33:00,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 02:33:00,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:34:02,711 INFO L130 PetriNetUnfolder]: 11416/21296 cut-off events. [2022-12-06 02:34:02,711 INFO L131 PetriNetUnfolder]: For 6662/6662 co-relation queries the response was YES. [2022-12-06 02:34:02,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382729 conditions, 21296 events. 11416/21296 cut-off events. For 6662/6662 co-relation queries the response was YES. Maximal size of possible extension queue 1170. Compared 182764 event pairs, 0 based on Foata normal form. 164/16452 useless extension candidates. Maximal degree in co-relation 163576. Up to 20623 conditions per place. [2022-12-06 02:34:02,822 INFO L137 encePairwiseOnDemand]: 12/29 looper letters, 3819 selfloop transitions, 171 changer transitions 4529/8519 dead transitions. [2022-12-06 02:34:02,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 8519 transitions, 308340 flow [2022-12-06 02:34:02,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 02:34:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 02:34:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 237 transitions. [2022-12-06 02:34:02,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25538793103448276 [2022-12-06 02:34:02,824 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 662 predicate places. [2022-12-06 02:34:02,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:34:02,825 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 684 places, 8519 transitions, 308340 flow [2022-12-06 02:34:03,108 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 684 places, 8519 transitions, 308340 flow [2022-12-06 02:34:03,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:34:03,123 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:34:03,124 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 300 [2022-12-06 02:34:03,124 INFO L495 AbstractCegarLoop]: Abstraction has has 684 places, 8519 transitions, 308340 flow [2022-12-06 02:34:03,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:34:03,125 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:34:03,125 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:34:03,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 02:34:03,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:34:03,330 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:34:03,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:34:03,330 INFO L85 PathProgramCache]: Analyzing trace with hash -893598781, now seen corresponding path program 1 times [2022-12-06 02:34:03,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:34:03,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286973987] [2022-12-06 02:34:03,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:34:03,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:34:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:34:06,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:34:06,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:34:06,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286973987] [2022-12-06 02:34:06,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286973987] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:34:06,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942507404] [2022-12-06 02:34:06,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:34:06,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:34:06,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:34:06,197 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:34:06,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 02:34:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:34:06,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 02:34:06,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:34:06,630 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:34:06,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 18 [2022-12-06 02:34:06,667 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:34:06,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:34:07,305 INFO L321 Elim1Store]: treesize reduction 64, result has 56.5 percent of original size [2022-12-06 02:34:07,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 318 treesize of output 282 [2022-12-06 02:34:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:34:08,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942507404] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:34:08,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:34:08,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-12-06 02:34:08,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119969259] [2022-12-06 02:34:08,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:34:08,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-06 02:34:08,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:34:08,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-06 02:34:08,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=733, Unknown=0, NotChecked=0, Total=870 [2022-12-06 02:34:08,392 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 02:34:08,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 8519 transitions, 308340 flow. Second operand has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:34:08,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:34:08,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 02:34:08,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:35:38,773 INFO L130 PetriNetUnfolder]: 17259/31752 cut-off events. [2022-12-06 02:35:38,773 INFO L131 PetriNetUnfolder]: For 9330/9330 co-relation queries the response was YES. [2022-12-06 02:35:38,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602485 conditions, 31752 events. 17259/31752 cut-off events. For 9330/9330 co-relation queries the response was YES. Maximal size of possible extension queue 1786. Compared 287398 event pairs, 0 based on Foata normal form. 33/24173 useless extension candidates. Maximal degree in co-relation 222016. Up to 30920 conditions per place. [2022-12-06 02:35:38,972 INFO L137 encePairwiseOnDemand]: 6/29 looper letters, 5382 selfloop transitions, 1229 changer transitions 6025/12636 dead transitions. [2022-12-06 02:35:38,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 752 places, 12636 transitions, 482550 flow [2022-12-06 02:35:38,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-12-06 02:35:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2022-12-06 02:35:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 412 transitions. [2022-12-06 02:35:38,974 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20589705147426288 [2022-12-06 02:35:38,974 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 730 predicate places. [2022-12-06 02:35:38,975 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:35:38,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 752 places, 12636 transitions, 482550 flow [2022-12-06 02:35:39,465 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 752 places, 12636 transitions, 482550 flow [2022-12-06 02:35:39,465 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:35:42,909 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:35:42,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3936 [2022-12-06 02:35:42,910 INFO L495 AbstractCegarLoop]: Abstraction has has 751 places, 12635 transitions, 482512 flow [2022-12-06 02:35:42,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:35:42,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:35:42,911 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:35:42,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 02:35:43,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 02:35:43,116 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:35:43,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:35:43,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1512543861, now seen corresponding path program 2 times [2022-12-06 02:35:43,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:35:43,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466486213] [2022-12-06 02:35:43,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:35:43,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:35:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:35:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:35:43,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:35:43,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466486213] [2022-12-06 02:35:43,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466486213] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:35:43,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086679030] [2022-12-06 02:35:43,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:35:43,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:35:43,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:35:43,464 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:35:43,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 02:35:43,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:35:43,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:35:43,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 02:35:43,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:35:43,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:35:43,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 236 treesize of output 168 [2022-12-06 02:35:43,937 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:35:43,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:35:44,289 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-12-06 02:35:44,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 259 treesize of output 193 [2022-12-06 02:35:44,347 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:35:44,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086679030] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:35:44,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:35:44,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2022-12-06 02:35:44,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631194978] [2022-12-06 02:35:44,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:35:44,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:35:44,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:35:44,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:35:44,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:35:44,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 02:35:44,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 751 places, 12635 transitions, 482512 flow. Second operand has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:35:44,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:35:44,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 02:35:44,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:38:29,617 INFO L130 PetriNetUnfolder]: 20373/37706 cut-off events. [2022-12-06 02:38:29,617 INFO L131 PetriNetUnfolder]: For 10368/10368 co-relation queries the response was YES. [2022-12-06 02:38:29,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753756 conditions, 37706 events. 20373/37706 cut-off events. For 10368/10368 co-relation queries the response was YES. Maximal size of possible extension queue 2146. Compared 352643 event pairs, 0 based on Foata normal form. 0/28568 useless extension candidates. Maximal degree in co-relation 295020. Up to 36875 conditions per place. [2022-12-06 02:38:29,843 INFO L137 encePairwiseOnDemand]: 11/30 looper letters, 6530 selfloop transitions, 1123 changer transitions 7364/15017 dead transitions. [2022-12-06 02:38:29,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 778 places, 15017 transitions, 604010 flow [2022-12-06 02:38:29,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 02:38:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 02:38:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 233 transitions. [2022-12-06 02:38:29,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21574074074074073 [2022-12-06 02:38:29,845 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 756 predicate places. [2022-12-06 02:38:29,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:29,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 778 places, 15017 transitions, 604010 flow [2022-12-06 02:38:30,416 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 778 places, 15017 transitions, 604010 flow [2022-12-06 02:38:30,416 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:38:30,441 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:38:30,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 597 [2022-12-06 02:38:30,442 INFO L495 AbstractCegarLoop]: Abstraction has has 778 places, 15017 transitions, 604010 flow [2022-12-06 02:38:30,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:38:30,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:30,442 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:30,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 02:38:30,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:30,648 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:38:30,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:30,648 INFO L85 PathProgramCache]: Analyzing trace with hash -546483521, now seen corresponding path program 1 times [2022-12-06 02:38:30,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:30,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333580430] [2022-12-06 02:38:30,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:30,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:33,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:38:33,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:33,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333580430] [2022-12-06 02:38:33,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333580430] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:38:33,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299124259] [2022-12-06 02:38:33,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:33,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:33,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:38:33,464 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:38:33,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 02:38:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:33,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-06 02:38:33,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:38:33,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:33,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 18 [2022-12-06 02:38:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:38:33,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:38:34,598 INFO L321 Elim1Store]: treesize reduction 64, result has 56.5 percent of original size [2022-12-06 02:38:34,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 328 treesize of output 292 [2022-12-06 02:38:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:38:35,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299124259] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:38:35,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:38:35,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-06 02:38:35,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003277998] [2022-12-06 02:38:35,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:38:35,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 02:38:35,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:38:35,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 02:38:35,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2022-12-06 02:38:35,192 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 02:38:35,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 778 places, 15017 transitions, 604010 flow. Second operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:38:35,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:38:35,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 02:38:35,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:42:41,310 INFO L130 PetriNetUnfolder]: 25044/45796 cut-off events. [2022-12-06 02:42:41,311 INFO L131 PetriNetUnfolder]: For 12633/12633 co-relation queries the response was YES. [2022-12-06 02:42:41,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 960834 conditions, 45796 events. 25044/45796 cut-off events. For 12633/12633 co-relation queries the response was YES. Maximal size of possible extension queue 2679. Compared 436083 event pairs, 0 based on Foata normal form. 32/34673 useless extension candidates. Maximal degree in co-relation 373172. Up to 44843 conditions per place. [2022-12-06 02:42:41,647 INFO L137 encePairwiseOnDemand]: 6/30 looper letters, 8199 selfloop transitions, 1602 changer transitions 8370/18171 dead transitions. [2022-12-06 02:42:41,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 851 places, 18171 transitions, 766736 flow [2022-12-06 02:42:41,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-12-06 02:42:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2022-12-06 02:42:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 485 transitions. [2022-12-06 02:42:41,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20995670995670995 [2022-12-06 02:42:41,649 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 829 predicate places. [2022-12-06 02:42:41,649 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:42:41,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 851 places, 18171 transitions, 766736 flow [2022-12-06 02:42:42,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 851 places, 18171 transitions, 766736 flow [2022-12-06 02:42:42,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:42:48,051 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:42:48,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6402 [2022-12-06 02:42:48,051 INFO L495 AbstractCegarLoop]: Abstraction has has 850 places, 18170 transitions, 766694 flow [2022-12-06 02:42:48,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:48,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:42:48,052 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:42:48,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 02:42:48,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:42:48,252 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:42:48,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:42:48,253 INFO L85 PathProgramCache]: Analyzing trace with hash 259923438, now seen corresponding path program 3 times [2022-12-06 02:42:48,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:42:48,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244114566] [2022-12-06 02:42:48,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:42:48,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:42:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:42:50,284 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:42:50,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:42:50,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244114566] [2022-12-06 02:42:50,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244114566] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:42:50,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288096271] [2022-12-06 02:42:50,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:42:50,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:42:50,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:42:50,286 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:42:50,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 02:42:50,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:42:50,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:42:50,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 81 conjunts are in the unsatisfiable core [2022-12-06 02:42:50,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:42:50,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 41 [2022-12-06 02:42:50,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:42:50,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:42:51,108 INFO L321 Elim1Store]: treesize reduction 197, result has 4.8 percent of original size [2022-12-06 02:42:51,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 94 treesize of output 33 [2022-12-06 02:42:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:42:51,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:42:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:42:54,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288096271] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:42:54,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:42:54,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 34 [2022-12-06 02:42:54,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959040063] [2022-12-06 02:42:54,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:42:54,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-06 02:42:54,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:42:54,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-06 02:42:54,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1030, Unknown=1, NotChecked=0, Total=1260 [2022-12-06 02:42:54,121 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 02:42:54,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 850 places, 18170 transitions, 766694 flow. Second operand has 36 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:54,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:42:54,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 02:42:54,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 02:43:16,397 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 [2022-12-06 02:43:16,397 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:43:16,488 WARN L249 SmtUtils]: Removed 18 from assertion stack [2022-12-06 02:43:16,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:43:16,489 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 02:43:16,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 02:43:16,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:16,690 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 250 for 21821ms.. [2022-12-06 02:43:16,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 02:43:16,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 02:43:16,692 INFO L458 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:16,694 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:43:16,694 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:43:16,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:43:16 BasicIcfg [2022-12-06 02:43:16,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:43:16,699 INFO L158 Benchmark]: Toolchain (without parser) took 805817.30ms. Allocated memory was 189.8MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 165.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-12-06 02:43:16,699 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory is still 167.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:43:16,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.23ms. Allocated memory is still 189.8MB. Free memory was 165.4MB in the beginning and 152.2MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 02:43:16,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.39ms. Allocated memory is still 189.8MB. Free memory was 152.2MB in the beginning and 150.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:43:16,700 INFO L158 Benchmark]: Boogie Preprocessor took 35.09ms. Allocated memory is still 189.8MB. Free memory was 150.2MB in the beginning and 148.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 02:43:16,700 INFO L158 Benchmark]: RCFGBuilder took 546.91ms. Allocated memory is still 189.8MB. Free memory was 148.6MB in the beginning and 128.7MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 02:43:16,700 INFO L158 Benchmark]: TraceAbstraction took 804868.29ms. Allocated memory was 189.8MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 128.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-06 02:43:16,702 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory is still 167.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 306.23ms. Allocated memory is still 189.8MB. Free memory was 165.4MB in the beginning and 152.2MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.39ms. Allocated memory is still 189.8MB. Free memory was 152.2MB in the beginning and 150.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.09ms. Allocated memory is still 189.8MB. Free memory was 150.2MB in the beginning and 148.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 546.91ms. Allocated memory is still 189.8MB. Free memory was 148.6MB in the beginning and 128.7MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 804868.29ms. Allocated memory was 189.8MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 128.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 117 PlacesBefore, 22 PlacesAfterwards, 121 TransitionsBefore, 19 TransitionsAfterwards, 1242 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 62 TrivialYvCompositions, 33 ConcurrentYvCompositions, 7 ChoiceCompositions, 103 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 778, independent: 768, independent conditional: 768, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 778, independent: 768, independent conditional: 0, independent unconditional: 768, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 778, independent: 768, independent conditional: 0, independent unconditional: 768, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 778, independent: 768, independent conditional: 0, independent unconditional: 768, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 683, independent: 675, independent conditional: 0, independent unconditional: 675, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 683, independent: 675, independent conditional: 0, independent unconditional: 675, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 32, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 778, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 683, unknown conditional: 0, unknown unconditional: 683] , Statistics on independence cache: Total cache size (in pairs): 1219, Positive cache size: 1211, Positive conditional cache size: 0, Positive unconditional cache size: 1211, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, 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, 24 PlacesBefore, 24 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 27 PlacesBefore, 27 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 12 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 1.8s, 30 PlacesBefore, 29 PlacesAfterwards, 54 TransitionsBefore, 53 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 36 PlacesBefore, 36 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.7s, 65 PlacesBefore, 61 PlacesAfterwards, 282 TransitionsBefore, 278 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 89 PlacesBefore, 88 PlacesAfterwards, 454 TransitionsBefore, 453 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 106 PlacesBefore, 106 PlacesAfterwards, 560 TransitionsBefore, 560 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 135 PlacesBefore, 135 PlacesAfterwards, 891 TransitionsBefore, 891 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 2.5s, 188 PlacesBefore, 187 PlacesAfterwards, 1397 TransitionsBefore, 1396 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 204 PlacesBefore, 204 PlacesAfterwards, 1655 TransitionsBefore, 1655 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 249 PlacesBefore, 249 PlacesAfterwards, 2478 TransitionsBefore, 2478 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 292 PlacesBefore, 292 PlacesAfterwards, 3275 TransitionsBefore, 3275 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 3.0s, 349 PlacesBefore, 348 PlacesAfterwards, 3878 TransitionsBefore, 3877 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 442 PlacesBefore, 442 PlacesAfterwards, 7167 TransitionsBefore, 7167 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 499 PlacesBefore, 499 PlacesAfterwards, 5203 TransitionsBefore, 5203 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 663 PlacesBefore, 663 PlacesAfterwards, 9286 TransitionsBefore, 9286 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 684 PlacesBefore, 684 PlacesAfterwards, 8519 TransitionsBefore, 8519 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 3.4s, 752 PlacesBefore, 751 PlacesAfterwards, 12636 TransitionsBefore, 12635 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 778 PlacesBefore, 778 PlacesAfterwards, 15017 TransitionsBefore, 15017 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 5.3s, 851 PlacesBefore, 850 PlacesAfterwards, 18171 TransitionsBefore, 18170 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 250 for 21821ms.. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 250 for 21821ms.. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 250 for 21821ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 156 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 804.7s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 726.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 42 mSolverCounterUnknown, 7940 SdHoareTripleChecker+Valid, 18.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7940 mSDsluCounter, 252 SdHoareTripleChecker+Invalid, 15.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 28 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 1959 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20246 IncrementalHoareTripleChecker+Invalid, 22275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1959 mSolverCounterUnsat, 39 mSDtfsCounter, 20246 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1504 GetRequests, 391 SyntacticMatches, 16 SemanticMatches, 1096 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30426 ImplicationChecksByTransitivity, 70.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=766736occurred in iteration=20, InterpolantAutomatonStates: 905, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 41.6s InterpolantComputationTime, 727 NumberOfCodeBlocks, 727 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1010 ConstructedInterpolants, 26 QuantifiedInterpolants, 33753 SizeOfPredicates, 497 NumberOfNonLiveVariables, 3623 ConjunctsInSsa, 637 ConjunctsInUnsatCore, 57 InterpolantComputations, 3 PerfectInterpolantSequences, 94/477 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown