/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/parallel-parallel-sum-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:16:46,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:16:46,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:16:47,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:16:47,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:16:47,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:16:47,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:16:47,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:16:47,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:16:47,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:16:47,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:16:47,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:16:47,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:16:47,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:16:47,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:16:47,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:16:47,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:16:47,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:16:47,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:16:47,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:16:47,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:16:47,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:16:47,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:16:47,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:16:47,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:16:47,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:16:47,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:16:47,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:16:47,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:16:47,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:16:47,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:16:47,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:16:47,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:16:47,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:16:47,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:16:47,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:16:47,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:16:47,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:16:47,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:16:47,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:16:47,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:16:47,097 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:16:47,121 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:16:47,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:16:47,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:16:47,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:16:47,124 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:16:47,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:16:47,125 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:16:47,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:16:47,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:16:47,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:16:47,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:16:47,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:16:47,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:16:47,126 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:16:47,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:16:47,127 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:16:47,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:16:47,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:16:47,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:16:47,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:16:47,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:16:47,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:16:47,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:16:47,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:16:47,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:16:47,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:16:47,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:16:47,129 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:16:47,129 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:16:47,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:16:47,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:16:47,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:16:47,436 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:16:47,436 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:16:47,437 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c [2022-12-06 02:16:48,662 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:16:48,911 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:16:48,913 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c [2022-12-06 02:16:48,920 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80d95cc98/619b5864b14e4eae80cf8b8e3f5860a2/FLAGbc6753989 [2022-12-06 02:16:48,940 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80d95cc98/619b5864b14e4eae80cf8b8e3f5860a2 [2022-12-06 02:16:48,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:16:48,943 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:16:48,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:16:48,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:16:48,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:16:48,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:16:48" (1/1) ... [2022-12-06 02:16:48,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43cf9ed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:16:48, skipping insertion in model container [2022-12-06 02:16:48,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:16:48" (1/1) ... [2022-12-06 02:16:48,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:16:48,981 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:16:49,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:16:49,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:16:49,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:16:49,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:16:49,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:16:49,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:16:49,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:16:49,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:16:49,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:16:49,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:16:49,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:16:49,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:16:49,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:16:49,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:16:49,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:16:49,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:16:49,120 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/parallel-parallel-sum-1.wvr.c[3642,3655] [2022-12-06 02:16:49,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:16:49,139 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:16:49,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:16:49,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:16:49,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:16:49,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:16:49,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:16:49,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:16:49,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:16:49,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:16:49,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:16:49,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:16:49,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:16:49,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:16:49,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:16:49,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:16:49,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:16:49,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:16:49,180 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/parallel-parallel-sum-1.wvr.c[3642,3655] [2022-12-06 02:16:49,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:16:49,201 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:16:49,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:16:49 WrapperNode [2022-12-06 02:16:49,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:16:49,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:16:49,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:16:49,204 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:16:49,209 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:16:49" (1/1) ... [2022-12-06 02:16:49,229 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:16:49" (1/1) ... [2022-12-06 02:16:49,274 INFO L138 Inliner]: procedures = 27, calls = 68, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 297 [2022-12-06 02:16:49,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:16:49,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:16:49,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:16:49,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:16:49,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:16:49" (1/1) ... [2022-12-06 02:16:49,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:16:49" (1/1) ... [2022-12-06 02:16:49,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:16:49" (1/1) ... [2022-12-06 02:16:49,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:16:49" (1/1) ... [2022-12-06 02:16:49,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:16:49" (1/1) ... [2022-12-06 02:16:49,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:16:49" (1/1) ... [2022-12-06 02:16:49,322 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:16:49" (1/1) ... [2022-12-06 02:16:49,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:16:49" (1/1) ... [2022-12-06 02:16:49,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:16:49,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:16:49,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:16:49,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:16:49,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:16:49" (1/1) ... [2022-12-06 02:16:49,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:16:49,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:16:49,372 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:16:49,395 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:16:49,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:16:49,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:16:49,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:16:49,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:16:49,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:16:49,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:16:49,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:16:49,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:16:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:16:49,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:16:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 02:16:49,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 02:16:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:16:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:16:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:16:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:16:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:16:49,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:16:49,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:16:49,422 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:16:49,596 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:16:49,599 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:16:49,978 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:16:50,201 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:16:50,201 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-06 02:16:50,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:16:50 BoogieIcfgContainer [2022-12-06 02:16:50,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:16:50,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:16:50,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:16:50,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:16:50,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:16:48" (1/3) ... [2022-12-06 02:16:50,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef95fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:16:50, skipping insertion in model container [2022-12-06 02:16:50,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:16:49" (2/3) ... [2022-12-06 02:16:50,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef95fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:16:50, skipping insertion in model container [2022-12-06 02:16:50,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:16:50" (3/3) ... [2022-12-06 02:16:50,211 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2022-12-06 02:16:50,232 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:16:50,232 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:16:50,232 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:16:50,343 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 02:16:50,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 192 transitions, 416 flow [2022-12-06 02:16:50,506 INFO L130 PetriNetUnfolder]: 15/188 cut-off events. [2022-12-06 02:16:50,506 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 02:16:50,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 188 events. 15/188 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 118 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2022-12-06 02:16:50,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 192 transitions, 416 flow [2022-12-06 02:16:50,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 176 transitions, 376 flow [2022-12-06 02:16:50,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:16:50,545 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 176 transitions, 376 flow [2022-12-06 02:16:50,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 176 transitions, 376 flow [2022-12-06 02:16:50,610 INFO L130 PetriNetUnfolder]: 15/176 cut-off events. [2022-12-06 02:16:50,610 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 02:16:50,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 176 events. 15/176 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 117 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2022-12-06 02:16:50,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 176 transitions, 376 flow [2022-12-06 02:16:50,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 2160 [2022-12-06 02:16:59,523 INFO L203 LiptonReduction]: Total number of compositions: 145 [2022-12-06 02:16:59,536 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:16:59,541 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;@6a7431af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:16:59,542 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 02:16:59,548 INFO L130 PetriNetUnfolder]: 5/30 cut-off events. [2022-12-06 02:16:59,548 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 02:16:59,548 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:16:59,549 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:16:59,549 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:16:59,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:16:59,554 INFO L85 PathProgramCache]: Analyzing trace with hash 557514244, now seen corresponding path program 1 times [2022-12-06 02:16:59,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:16:59,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853666114] [2022-12-06 02:16:59,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:16:59,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:16:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:17:00,151 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:17:00,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:17:00,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853666114] [2022-12-06 02:17:00,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853666114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:17:00,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:17:00,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 02:17:00,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839776560] [2022-12-06 02:17:00,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:17:00,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:17:00,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:17:00,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:17:00,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:17:00,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 02:17:00,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 86 flow. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:17:00,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:17:00,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 02:17:00,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:17:00,540 INFO L130 PetriNetUnfolder]: 1952/2593 cut-off events. [2022-12-06 02:17:00,540 INFO L131 PetriNetUnfolder]: For 157/157 co-relation queries the response was YES. [2022-12-06 02:17:00,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5430 conditions, 2593 events. 1952/2593 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9168 event pairs, 624 based on Foata normal form. 1/1889 useless extension candidates. Maximal degree in co-relation 4200. Up to 1650 conditions per place. [2022-12-06 02:17:00,559 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 51 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2022-12-06 02:17:00,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 57 transitions, 273 flow [2022-12-06 02:17:00,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:17:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:17:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-06 02:17:00,571 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6236559139784946 [2022-12-06 02:17:00,576 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2022-12-06 02:17:00,578 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:17:00,582 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 57 transitions, 273 flow [2022-12-06 02:17:00,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 57 transitions, 273 flow [2022-12-06 02:17:00,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:17:00,596 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:17:00,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 02:17:00,598 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 57 transitions, 273 flow [2022-12-06 02:17:00,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:17:00,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:17:00,599 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:17:00,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:17:00,602 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:17:00,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:17:00,603 INFO L85 PathProgramCache]: Analyzing trace with hash 670638725, now seen corresponding path program 1 times [2022-12-06 02:17:00,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:17:00,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534407643] [2022-12-06 02:17:00,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:17:00,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:17:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:17:00,918 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:17:00,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:17:00,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534407643] [2022-12-06 02:17:00,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534407643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:17:00,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:17:00,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:17:00,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196380951] [2022-12-06 02:17:00,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:17:00,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:17:00,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:17:00,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:17:00,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:17:00,922 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 02:17:00,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 57 transitions, 273 flow. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:17:00,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:17:00,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 02:17:00,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:17:01,498 INFO L130 PetriNetUnfolder]: 4054/5355 cut-off events. [2022-12-06 02:17:01,499 INFO L131 PetriNetUnfolder]: For 500/500 co-relation queries the response was YES. [2022-12-06 02:17:01,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16514 conditions, 5355 events. 4054/5355 cut-off events. For 500/500 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 21779 event pairs, 260 based on Foata normal form. 1/3927 useless extension candidates. Maximal degree in co-relation 12831. Up to 4271 conditions per place. [2022-12-06 02:17:01,533 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 128 selfloop transitions, 14 changer transitions 2/144 dead transitions. [2022-12-06 02:17:01,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 144 transitions, 963 flow [2022-12-06 02:17:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:17:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:17:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-06 02:17:01,537 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6532258064516129 [2022-12-06 02:17:01,537 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2022-12-06 02:17:01,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:17:01,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 144 transitions, 963 flow [2022-12-06 02:17:01,568 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 144 transitions, 963 flow [2022-12-06 02:17:01,568 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:17:01,572 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:17:01,573 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 02:17:01,574 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 144 transitions, 963 flow [2022-12-06 02:17:01,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:17:01,574 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:17:01,574 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:17:01,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:17:01,574 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:17:01,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:17:01,575 INFO L85 PathProgramCache]: Analyzing trace with hash 665816398, now seen corresponding path program 1 times [2022-12-06 02:17:01,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:17:01,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053530412] [2022-12-06 02:17:01,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:17:01,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:17:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:17:01,809 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:17:01,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:17:01,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053530412] [2022-12-06 02:17:01,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053530412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:17:01,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:17:01,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:17:01,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878520561] [2022-12-06 02:17:01,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:17:01,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:17:01,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:17:01,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:17:01,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:17:01,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 02:17:01,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 144 transitions, 963 flow. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:17:01,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:17:01,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 02:17:01,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:17:02,662 INFO L130 PetriNetUnfolder]: 5996/7909 cut-off events. [2022-12-06 02:17:02,662 INFO L131 PetriNetUnfolder]: For 781/781 co-relation queries the response was YES. [2022-12-06 02:17:02,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32276 conditions, 7909 events. 5996/7909 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 33716 event pairs, 173 based on Foata normal form. 1/5797 useless extension candidates. Maximal degree in co-relation 25008. Up to 6796 conditions per place. [2022-12-06 02:17:02,719 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 202 selfloop transitions, 19 changer transitions 15/236 dead transitions. [2022-12-06 02:17:02,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 236 transitions, 2035 flow [2022-12-06 02:17:02,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:17:02,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:17:02,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-06 02:17:02,722 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6532258064516129 [2022-12-06 02:17:02,723 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2022-12-06 02:17:02,723 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:17:02,724 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 236 transitions, 2035 flow [2022-12-06 02:17:02,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 236 transitions, 2035 flow [2022-12-06 02:17:02,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:17:02,761 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:17:02,762 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 02:17:02,762 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 236 transitions, 2035 flow [2022-12-06 02:17:02,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:17:02,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:17:02,763 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:17:02,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:17:02,763 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:17:02,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:17:02,764 INFO L85 PathProgramCache]: Analyzing trace with hash 283574597, now seen corresponding path program 1 times [2022-12-06 02:17:02,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:17:02,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258447433] [2022-12-06 02:17:02,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:17:02,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:17:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:17:03,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:17:03,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:17:03,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258447433] [2022-12-06 02:17:03,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258447433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:17:03,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:17:03,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:17:03,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269846486] [2022-12-06 02:17:03,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:17:03,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:17:03,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:17:03,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:17:03,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:17:03,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 02:17:03,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 236 transitions, 2035 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 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:17:03,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:17:03,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 02:17:03,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:17:04,071 INFO L130 PetriNetUnfolder]: 6727/8968 cut-off events. [2022-12-06 02:17:04,071 INFO L131 PetriNetUnfolder]: For 976/976 co-relation queries the response was YES. [2022-12-06 02:17:04,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45605 conditions, 8968 events. 6727/8968 cut-off events. For 976/976 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 39839 event pairs, 286 based on Foata normal form. 0/6666 useless extension candidates. Maximal degree in co-relation 31164. Up to 7910 conditions per place. [2022-12-06 02:17:04,113 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 220 selfloop transitions, 2 changer transitions 72/294 dead transitions. [2022-12-06 02:17:04,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 294 transitions, 3138 flow [2022-12-06 02:17:04,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:17:04,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:17:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 02:17:04,117 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2022-12-06 02:17:04,119 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2022-12-06 02:17:04,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:17:04,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 294 transitions, 3138 flow [2022-12-06 02:17:04,153 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 294 transitions, 3138 flow [2022-12-06 02:17:04,153 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:17:07,887 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:17:07,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3770 [2022-12-06 02:17:07,889 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 293 transitions, 3128 flow [2022-12-06 02:17:07,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 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:17:07,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:17:07,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:17:07,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:17:07,889 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:17:07,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:17:07,890 INFO L85 PathProgramCache]: Analyzing trace with hash 306293874, now seen corresponding path program 1 times [2022-12-06 02:17:07,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:17:07,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673237011] [2022-12-06 02:17:07,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:17:07,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:17:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:17:08,219 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:17:08,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:17:08,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673237011] [2022-12-06 02:17:08,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673237011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:17:08,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:17:08,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:17:08,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012061531] [2022-12-06 02:17:08,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:17:08,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:17:08,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:17:08,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:17:08,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:17:08,224 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 02:17:08,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 293 transitions, 3128 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 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:17:08,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:17:08,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 02:17:08,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:17:09,251 INFO L130 PetriNetUnfolder]: 6854/9197 cut-off events. [2022-12-06 02:17:09,252 INFO L131 PetriNetUnfolder]: For 897/897 co-relation queries the response was YES. [2022-12-06 02:17:09,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56029 conditions, 9197 events. 6854/9197 cut-off events. For 897/897 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 41536 event pairs, 401 based on Foata normal form. 0/6894 useless extension candidates. Maximal degree in co-relation 37320. Up to 8991 conditions per place. [2022-12-06 02:17:09,313 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 217 selfloop transitions, 5 changer transitions 96/318 dead transitions. [2022-12-06 02:17:09,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 318 transitions, 4044 flow [2022-12-06 02:17:09,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:17:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:17:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-06 02:17:09,314 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36875 [2022-12-06 02:17:09,316 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2022-12-06 02:17:09,317 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:17:09,317 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 318 transitions, 4044 flow [2022-12-06 02:17:09,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 318 transitions, 4044 flow [2022-12-06 02:17:09,375 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:17:13,430 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:17:13,431 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4114 [2022-12-06 02:17:13,431 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 317 transitions, 4032 flow [2022-12-06 02:17:13,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 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:17:13,432 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:17:13,432 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:17:13,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 02:17:13,432 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:17:13,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:17:13,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2127924120, now seen corresponding path program 1 times [2022-12-06 02:17:13,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:17:13,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588274838] [2022-12-06 02:17:13,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:17:13,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:17:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:17:14,566 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:17:14,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:17:14,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588274838] [2022-12-06 02:17:14,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588274838] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:17:14,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267608151] [2022-12-06 02:17:14,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:17:14,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:17:14,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:17:14,570 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:17:14,571 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:17:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:17:14,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 02:17:14,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:17:14,913 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:17:14,914 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 23 treesize of output 19 [2022-12-06 02:17:15,016 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:17:15,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:17:15,160 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:17:15,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267608151] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:17:15,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:17:15,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 18 [2022-12-06 02:17:15,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046046814] [2022-12-06 02:17:15,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:17:15,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:17:15,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:17:15,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:17:15,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:17:15,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:17:15,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 317 transitions, 4032 flow. Second operand has 19 states, 18 states have (on average 3.888888888888889) internal successors, (70), 19 states have internal predecessors, (70), 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:17:15,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:17:15,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:17:15,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:17:17,414 INFO L130 PetriNetUnfolder]: 9424/12558 cut-off events. [2022-12-06 02:17:17,415 INFO L131 PetriNetUnfolder]: For 1270/1270 co-relation queries the response was YES. [2022-12-06 02:17:17,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88869 conditions, 12558 events. 9424/12558 cut-off events. For 1270/1270 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 57531 event pairs, 451 based on Foata normal form. 2/9481 useless extension candidates. Maximal degree in co-relation 61242. Up to 12352 conditions per place. [2022-12-06 02:17:17,487 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 366 selfloop transitions, 189 changer transitions 120/675 dead transitions. [2022-12-06 02:17:17,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 675 transitions, 9795 flow [2022-12-06 02:17:17,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 02:17:17,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 02:17:17,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 263 transitions. [2022-12-06 02:17:17,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44276094276094274 [2022-12-06 02:17:17,490 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 30 predicate places. [2022-12-06 02:17:17,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:17:17,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 675 transitions, 9795 flow [2022-12-06 02:17:17,569 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 675 transitions, 9795 flow [2022-12-06 02:17:17,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:17:17,573 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:17:17,574 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 02:17:17,575 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 675 transitions, 9795 flow [2022-12-06 02:17:17,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.888888888888889) internal successors, (70), 19 states have internal predecessors, (70), 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:17:17,575 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:17:17,575 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:17:17,587 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:17:17,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 02:17:17,786 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:17:17,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:17:17,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1740759814, now seen corresponding path program 2 times [2022-12-06 02:17:17,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:17:17,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247003635] [2022-12-06 02:17:17,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:17:17,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:17:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:17:18,531 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:17:18,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:17:18,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247003635] [2022-12-06 02:17:18,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247003635] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:17:18,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41405739] [2022-12-06 02:17:18,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:17:18,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:17:18,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:17:18,534 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:17:18,536 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:17:18,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:17:18,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:17:18,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-06 02:17:18,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:17:18,859 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-06 02:17:18,860 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 25 treesize of output 12 [2022-12-06 02:17:18,928 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:17:18,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:17:19,089 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:17:19,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41405739] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:17:19,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:17:19,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 17 [2022-12-06 02:17:19,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970450785] [2022-12-06 02:17:19,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:17:19,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:17:19,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:17:19,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:17:19,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:17:19,092 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:17:19,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 675 transitions, 9795 flow. Second operand has 18 states, 17 states have (on average 4.588235294117647) internal successors, (78), 18 states have internal predecessors, (78), 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:17:19,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:17:19,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:17:19,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:17:26,786 INFO L130 PetriNetUnfolder]: 31514/41710 cut-off events. [2022-12-06 02:17:26,786 INFO L131 PetriNetUnfolder]: For 4200/4200 co-relation queries the response was YES. [2022-12-06 02:17:26,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336346 conditions, 41710 events. 31514/41710 cut-off events. For 4200/4200 co-relation queries the response was YES. Maximal size of possible extension queue 1402. Compared 220529 event pairs, 949 based on Foata normal form. 8/30275 useless extension candidates. Maximal degree in co-relation 119408. Up to 41504 conditions per place. [2022-12-06 02:17:27,014 INFO L137 encePairwiseOnDemand]: 16/33 looper letters, 1565 selfloop transitions, 758 changer transitions 320/2643 dead transitions. [2022-12-06 02:17:27,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 2643 transitions, 43539 flow [2022-12-06 02:17:27,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-12-06 02:17:27,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2022-12-06 02:17:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 983 transitions. [2022-12-06 02:17:27,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43805704099821746 [2022-12-06 02:17:27,025 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 97 predicate places. [2022-12-06 02:17:27,027 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:17:27,027 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 2643 transitions, 43539 flow [2022-12-06 02:17:27,265 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 2643 transitions, 43539 flow [2022-12-06 02:17:27,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:17:27,280 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:17:27,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 256 [2022-12-06 02:17:27,281 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 2643 transitions, 43539 flow [2022-12-06 02:17:27,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.588235294117647) internal successors, (78), 18 states have internal predecessors, (78), 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:17:27,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:17:27,281 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:17:27,287 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:17:27,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-06 02:17:27,484 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:17:27,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:17:27,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1962637094, now seen corresponding path program 3 times [2022-12-06 02:17:27,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:17:27,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314795352] [2022-12-06 02:17:27,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:17:27,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:17:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:17:28,195 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:17:28,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:17:28,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314795352] [2022-12-06 02:17:28,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314795352] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:17:28,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401748511] [2022-12-06 02:17:28,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:17:28,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:17:28,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:17:28,197 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:17:28,223 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:17:28,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:17:28,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:17:28,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-06 02:17:28,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:17:28,544 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-06 02:17:28,544 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 14 [2022-12-06 02:17:28,596 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:17:28,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:17:28,751 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:17:28,752 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 25 treesize of output 12 [2022-12-06 02:17:28,759 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:17:28,760 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 25 treesize of output 12 [2022-12-06 02:17:28,829 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:17:28,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401748511] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:17:28,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:17:28,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 14 [2022-12-06 02:17:28,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292637026] [2022-12-06 02:17:28,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:17:28,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:17:28,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:17:28,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:17:28,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:17:28,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:17:28,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 2643 transitions, 43539 flow. Second operand has 15 states, 14 states have (on average 5.214285714285714) internal successors, (73), 15 states have internal predecessors, (73), 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:17:28,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:17:28,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:17:28,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:17:44,401 INFO L130 PetriNetUnfolder]: 48740/64656 cut-off events. [2022-12-06 02:17:44,401 INFO L131 PetriNetUnfolder]: For 6863/6863 co-relation queries the response was YES. [2022-12-06 02:17:44,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586329 conditions, 64656 events. 48740/64656 cut-off events. For 6863/6863 co-relation queries the response was YES. Maximal size of possible extension queue 2056. Compared 362249 event pairs, 1187 based on Foata normal form. 10/46411 useless extension candidates. Maximal degree in co-relation 201428. Up to 64450 conditions per place. [2022-12-06 02:17:44,816 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 3008 selfloop transitions, 841 changer transitions 549/4398 dead transitions. [2022-12-06 02:17:44,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 4398 transitions, 81426 flow [2022-12-06 02:17:44,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 02:17:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 02:17:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 414 transitions. [2022-12-06 02:17:44,818 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5018181818181818 [2022-12-06 02:17:44,819 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 121 predicate places. [2022-12-06 02:17:44,819 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:17:44,819 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 4398 transitions, 81426 flow [2022-12-06 02:17:45,199 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 4398 transitions, 81426 flow [2022-12-06 02:17:45,199 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:17:45,224 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:17:45,224 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 405 [2022-12-06 02:17:45,225 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 4398 transitions, 81426 flow [2022-12-06 02:17:45,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.214285714285714) internal successors, (73), 15 states have internal predecessors, (73), 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:17:45,225 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:17:45,225 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:17:45,235 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:17:45,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:17:45,430 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:17:45,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:17:45,431 INFO L85 PathProgramCache]: Analyzing trace with hash -83229328, now seen corresponding path program 4 times [2022-12-06 02:17:45,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:17:45,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506558536] [2022-12-06 02:17:45,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:17:45,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:17:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:17:46,559 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:17:46,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:17:46,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506558536] [2022-12-06 02:17:46,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506558536] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:17:46,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23162893] [2022-12-06 02:17:46,560 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:17:46,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:17:46,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:17:46,561 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:17:46,563 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:17:46,679 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:17:46,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:17:46,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-06 02:17:46,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:17:46,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:17:46,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-06 02:17:47,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:17:47,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:17:47,067 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 21 treesize of output 12 [2022-12-06 02:17:47,124 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:17:47,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:17:47,311 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 36 treesize of output 27 [2022-12-06 02:17:47,431 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:17:47,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23162893] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:17:47,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:17:47,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 02:17:47,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705597260] [2022-12-06 02:17:47,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:17:47,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 02:17:47,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:17:47,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 02:17:47,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=405, Unknown=2, NotChecked=0, Total=506 [2022-12-06 02:17:47,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:17:47,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 4398 transitions, 81426 flow. Second operand has 23 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 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:17:47,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:17:47,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:17:47,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:18:30,603 INFO L130 PetriNetUnfolder]: 81404/108159 cut-off events. [2022-12-06 02:18:30,603 INFO L131 PetriNetUnfolder]: For 11274/11274 co-relation queries the response was YES. [2022-12-06 02:18:30,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088944 conditions, 108159 events. 81404/108159 cut-off events. For 11274/11274 co-relation queries the response was YES. Maximal size of possible extension queue 3449. Compared 649201 event pairs, 2730 based on Foata normal form. 4/78111 useless extension candidates. Maximal degree in co-relation 312268. Up to 107953 conditions per place. [2022-12-06 02:18:31,331 INFO L137 encePairwiseOnDemand]: 16/33 looper letters, 5567 selfloop transitions, 1041 changer transitions 801/7409 dead transitions. [2022-12-06 02:18:31,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 7409 transitions, 151951 flow [2022-12-06 02:18:31,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-06 02:18:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2022-12-06 02:18:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 908 transitions. [2022-12-06 02:18:31,335 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49134199134199136 [2022-12-06 02:18:31,336 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 175 predicate places. [2022-12-06 02:18:31,336 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:18:31,337 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 7409 transitions, 151951 flow [2022-12-06 02:18:32,204 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 7409 transitions, 151951 flow [2022-12-06 02:18:32,205 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:18:32,249 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:18:32,250 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 914 [2022-12-06 02:18:32,250 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 7409 transitions, 151951 flow [2022-12-06 02:18:32,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 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:18:32,250 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:18:32,250 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:18:32,255 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:18:32,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:18:32,451 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:18:32,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:18:32,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1891666544, now seen corresponding path program 1 times [2022-12-06 02:18:32,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:18:32,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283087716] [2022-12-06 02:18:32,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:18:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:18:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:18:33,128 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:18:33,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:18:33,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283087716] [2022-12-06 02:18:33,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283087716] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:18:33,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620510936] [2022-12-06 02:18:33,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:18:33,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:18:33,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:18:33,131 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:18:33,133 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:18:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:18:33,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-06 02:18:33,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:18:33,440 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-06 02:18:33,441 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 23 treesize of output 10 [2022-12-06 02:18:33,494 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:18:33,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:18:33,633 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:18:33,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620510936] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:18:33,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:18:33,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 16 [2022-12-06 02:18:33,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174392535] [2022-12-06 02:18:33,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:18:33,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 02:18:33,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:18:33,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 02:18:33,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-12-06 02:18:33,636 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:18:33,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 7409 transitions, 151951 flow. Second operand has 17 states, 16 states have (on average 4.8125) internal successors, (77), 17 states have internal predecessors, (77), 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:18:33,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:18:33,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:18:33,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:20:16,058 INFO L130 PetriNetUnfolder]: 109102/144808 cut-off events. [2022-12-06 02:20:16,059 INFO L131 PetriNetUnfolder]: For 15664/15664 co-relation queries the response was YES. [2022-12-06 02:20:16,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1603199 conditions, 144808 events. 109102/144808 cut-off events. For 15664/15664 co-relation queries the response was YES. Maximal size of possible extension queue 4615. Compared 895600 event pairs, 1982 based on Foata normal form. 15/104184 useless extension candidates. Maximal degree in co-relation 499001. Up to 144602 conditions per place. [2022-12-06 02:20:17,056 INFO L137 encePairwiseOnDemand]: 17/33 looper letters, 7235 selfloop transitions, 1664 changer transitions 960/9859 dead transitions. [2022-12-06 02:20:17,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 9859 transitions, 222043 flow [2022-12-06 02:20:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-12-06 02:20:17,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2022-12-06 02:20:17,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 1152 transitions. [2022-12-06 02:20:17,060 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5289256198347108 [2022-12-06 02:20:17,060 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 240 predicate places. [2022-12-06 02:20:17,061 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:20:17,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 279 places, 9859 transitions, 222043 flow [2022-12-06 02:20:18,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 279 places, 9859 transitions, 222043 flow [2022-12-06 02:20:18,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:20:18,343 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:20:18,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1284 [2022-12-06 02:20:18,344 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 9859 transitions, 222043 flow [2022-12-06 02:20:18,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.8125) internal successors, (77), 17 states have internal predecessors, (77), 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:20:18,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:20:18,344 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:20:18,349 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:20:18,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 02:20:18,545 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:20:18,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:20:18,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1553375732, now seen corresponding path program 2 times [2022-12-06 02:20:18,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:20:18,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3565957] [2022-12-06 02:20:18,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:20:18,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:20:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:20:18,986 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:20:18,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:20:18,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3565957] [2022-12-06 02:20:18,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3565957] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:20:18,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068615355] [2022-12-06 02:20:18,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:20:18,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:20:18,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:20:18,989 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:20:18,991 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:20:19,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:20:19,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:20:19,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 02:20:19,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:20:19,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:20:19,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-06 02:20:19,359 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-06 02:20:19,359 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 25 treesize of output 12 [2022-12-06 02:20:19,411 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:20:19,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:20:19,606 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 36 treesize of output 27 [2022-12-06 02:20:19,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:20:19,671 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:20:19,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068615355] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:20:19,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:20:19,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-12-06 02:20:19,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262396435] [2022-12-06 02:20:19,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:20:19,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:20:19,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:20:19,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:20:19,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=295, Unknown=3, NotChecked=0, Total=380 [2022-12-06 02:20:19,672 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:20:19,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 9859 transitions, 222043 flow. Second operand has 20 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 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:20:19,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:20:19,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:20:19,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:24:43,927 INFO L130 PetriNetUnfolder]: 143199/189808 cut-off events. [2022-12-06 02:24:43,927 INFO L131 PetriNetUnfolder]: For 20456/20456 co-relation queries the response was YES. [2022-12-06 02:24:44,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2291952 conditions, 189808 events. 143199/189808 cut-off events. For 20456/20456 co-relation queries the response was YES. Maximal size of possible extension queue 5990. Compared 1205501 event pairs, 2673 based on Foata normal form. 15/135414 useless extension candidates. Maximal degree in co-relation 635546. Up to 189602 conditions per place. [2022-12-06 02:24:45,522 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 9897 selfloop transitions, 2622 changer transitions 1072/13591 dead transitions. [2022-12-06 02:24:45,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 13591 transitions, 333459 flow [2022-12-06 02:24:45,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 02:24:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 02:24:45,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 520 transitions. [2022-12-06 02:24:45,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2022-12-06 02:24:45,525 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 269 predicate places. [2022-12-06 02:24:45,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:24:45,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 308 places, 13591 transitions, 333459 flow [2022-12-06 02:24:47,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 308 places, 13591 transitions, 333459 flow [2022-12-06 02:24:47,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:24:47,219 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:24:47,220 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1695 [2022-12-06 02:24:47,220 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 13591 transitions, 333459 flow [2022-12-06 02:24:47,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 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:24:47,220 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:24:47,220 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:24:47,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 02:24:47,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:24:47,421 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:24:47,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:24:47,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1062948856, now seen corresponding path program 5 times [2022-12-06 02:24:47,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:24:47,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368514533] [2022-12-06 02:24:47,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:24:47,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:24:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:24:47,868 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:24:47,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:24:47,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368514533] [2022-12-06 02:24:47,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368514533] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:24:47,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709748186] [2022-12-06 02:24:47,869 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:24:47,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:24:47,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:24:47,870 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:24:47,873 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:24:48,000 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:24:48,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:24:48,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-06 02:24:48,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:24:48,011 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 17 [2022-12-06 02:24:48,045 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:24:48,091 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:24:48,153 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:24:48,191 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:24:48,278 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-06 02:24:48,279 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 23 treesize of output 10 [2022-12-06 02:24:48,377 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:24:48,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:24:48,564 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:24:48,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709748186] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:24:48,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:24:48,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 5] total 18 [2022-12-06 02:24:48,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055752187] [2022-12-06 02:24:48,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:24:48,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:24:48,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:24:48,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:24:48,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:24:48,565 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:24:48,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 13591 transitions, 333459 flow. Second operand has 19 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 19 states have internal predecessors, (69), 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:24:48,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:24:48,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:24:48,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 02:29:45,043 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:29:45,043 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:29:45,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 02:29:45,227 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 02:29:45,232 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:29:45,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:45,428 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (19states, 0/33 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 1714926 conditions, 131180 events (101385/131179 cut-off events. For 11067/11067 co-relation queries the response was YES. Maximal size of possible extension queue 6628. Compared 815890 event pairs, 1937 based on Foata normal form. 0/97824 useless extension candidates. Maximal degree in co-relation 578483. Up to 130975 conditions per place.). [2022-12-06 02:29:45,429 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 02:29:45,429 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 02:29:45,429 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 02:29:45,429 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 02:29:45,430 INFO L458 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1] [2022-12-06 02:29:45,432 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:29:45,433 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:29:45,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:29:45 BasicIcfg [2022-12-06 02:29:45,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:29:45,436 INFO L158 Benchmark]: Toolchain (without parser) took 776492.18ms. Allocated memory was 181.4MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 157.6MB in the beginning and 1.1GB in the end (delta: -928.2MB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. [2022-12-06 02:29:45,436 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory was 157.7MB in the beginning and 157.6MB in the end (delta: 83.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:29:45,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.59ms. Allocated memory is still 181.4MB. Free memory was 157.6MB in the beginning and 143.5MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 02:29:45,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.91ms. Allocated memory is still 181.4MB. Free memory was 143.5MB in the beginning and 140.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:29:45,437 INFO L158 Benchmark]: Boogie Preprocessor took 51.73ms. Allocated memory is still 181.4MB. Free memory was 140.9MB in the beginning and 138.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:29:45,437 INFO L158 Benchmark]: RCFGBuilder took 876.02ms. Allocated memory is still 181.4MB. Free memory was 138.8MB in the beginning and 94.2MB in the end (delta: 44.6MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. [2022-12-06 02:29:45,437 INFO L158 Benchmark]: TraceAbstraction took 775229.83ms. Allocated memory was 181.4MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 93.7MB in the beginning and 1.1GB in the end (delta: -992.2MB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. [2022-12-06 02:29:45,438 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory was 157.7MB in the beginning and 157.6MB in the end (delta: 83.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 255.59ms. Allocated memory is still 181.4MB. Free memory was 157.6MB in the beginning and 143.5MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.91ms. Allocated memory is still 181.4MB. Free memory was 143.5MB in the beginning and 140.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.73ms. Allocated memory is still 181.4MB. Free memory was 140.9MB in the beginning and 138.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 876.02ms. Allocated memory is still 181.4MB. Free memory was 138.8MB in the beginning and 94.2MB in the end (delta: 44.6MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. * TraceAbstraction took 775229.83ms. Allocated memory was 181.4MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 93.7MB in the beginning and 1.1GB in the end (delta: -992.2MB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.9s, 174 PlacesBefore, 39 PlacesAfterwards, 176 TransitionsBefore, 31 TransitionsAfterwards, 2160 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 98 TrivialYvCompositions, 37 ConcurrentYvCompositions, 10 ChoiceCompositions, 145 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1166, independent: 1142, independent conditional: 1142, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1166, independent: 1142, independent conditional: 0, independent unconditional: 1142, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1166, independent: 1142, independent conditional: 0, independent unconditional: 1142, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1166, independent: 1142, independent conditional: 0, independent unconditional: 1142, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1073, independent: 1063, independent conditional: 0, independent unconditional: 1063, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1073, independent: 1063, independent conditional: 0, independent unconditional: 1063, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1166, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1073, unknown conditional: 0, unknown unconditional: 1073] , Statistics on independence cache: Total cache size (in pairs): 1699, Positive cache size: 1689, Positive conditional cache size: 0, Positive unconditional cache size: 1689, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 57 TransitionsBefore, 57 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, 44 PlacesBefore, 44 PlacesAfterwards, 144 TransitionsBefore, 144 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, 47 PlacesBefore, 47 PlacesAfterwards, 236 TransitionsBefore, 236 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.7s, 50 PlacesBefore, 49 PlacesAfterwards, 294 TransitionsBefore, 293 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: 4.1s, 53 PlacesBefore, 52 PlacesAfterwards, 318 TransitionsBefore, 317 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, 69 PlacesBefore, 69 PlacesAfterwards, 675 TransitionsBefore, 675 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, 136 PlacesBefore, 136 PlacesAfterwards, 2643 TransitionsBefore, 2643 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, 160 PlacesBefore, 160 PlacesAfterwards, 4398 TransitionsBefore, 4398 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, 214 PlacesBefore, 214 PlacesAfterwards, 7409 TransitionsBefore, 7409 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, 279 PlacesBefore, 279 PlacesAfterwards, 9859 TransitionsBefore, 9859 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.1s, 308 PlacesBefore, 308 PlacesAfterwards, 13591 TransitionsBefore, 13591 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 - TimeoutResultAtElement [Line: 136]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (19states, 0/33 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 1714926 conditions, 131180 events (101385/131179 cut-off events. For 11067/11067 co-relation queries the response was YES. Maximal size of possible extension queue 6628. Compared 815890 event pairs, 1937 based on Foata normal form. 0/97824 useless extension candidates. Maximal degree in co-relation 578483. Up to 130975 conditions per place.). - TimeoutResultAtElement [Line: 128]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (19states, 0/33 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 1714926 conditions, 131180 events (101385/131179 cut-off events. For 11067/11067 co-relation queries the response was YES. Maximal size of possible extension queue 6628. Compared 815890 event pairs, 1937 based on Foata normal form. 0/97824 useless extension candidates. Maximal degree in co-relation 578483. Up to 130975 conditions per place.). - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (19states, 0/33 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 1714926 conditions, 131180 events (101385/131179 cut-off events. For 11067/11067 co-relation queries the response was YES. Maximal size of possible extension queue 6628. Compared 815890 event pairs, 1937 based on Foata normal form. 0/97824 useless extension candidates. Maximal degree in co-relation 578483. Up to 130975 conditions per place.). - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (19states, 0/33 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 1714926 conditions, 131180 events (101385/131179 cut-off events. For 11067/11067 co-relation queries the response was YES. Maximal size of possible extension queue 6628. Compared 815890 event pairs, 1937 based on Foata normal form. 0/97824 useless extension candidates. Maximal degree in co-relation 578483. Up to 130975 conditions per place.). - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (19states, 0/33 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 1714926 conditions, 131180 events (101385/131179 cut-off events. For 11067/11067 co-relation queries the response was YES. Maximal size of possible extension queue 6628. Compared 815890 event pairs, 1937 based on Foata normal form. 0/97824 useless extension candidates. Maximal degree in co-relation 578483. Up to 130975 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 214 locations, 5 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: 775.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 740.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.2s, HoareTripleCheckerStatistics: 101 mSolverCounterUnknown, 4923 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4923 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 964 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10698 IncrementalHoareTripleChecker+Invalid, 11763 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 964 mSolverCounterUnsat, 0 mSDtfsCounter, 10698 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 668 GetRequests, 278 SyntacticMatches, 9 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7014 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333459occurred in iteration=11, InterpolantAutomatonStates: 283, 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.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 486 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 642 ConstructedInterpolants, 6 QuantifiedInterpolants, 10941 SizeOfPredicates, 172 NumberOfNonLiveVariables, 2317 ConjunctsInSsa, 352 ConjunctsInUnsatCore, 26 InterpolantComputations, 5 PerfectInterpolantSequences, 6/48 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