/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/triangular-longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:52:50,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:52:50,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:52:50,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:52:50,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:52:50,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:52:50,325 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:52:50,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:52:50,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:52:50,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:52:50,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:52:50,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:52:50,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:52:50,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:52:50,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:52:50,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:52:50,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:52:50,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:52:50,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:52:50,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:52:50,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:52:50,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:52:50,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:52:50,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:52:50,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:52:50,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:52:50,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:52:50,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:52:50,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:52:50,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:52:50,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:52:50,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:52:50,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:52:50,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:52:50,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:52:50,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:52:50,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:52:50,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:52:50,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:52:50,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:52:50,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:52:50,370 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-05 22:52:50,396 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:52:50,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:52:50,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:52:50,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:52:50,397 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:52:50,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:52:50,398 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:52:50,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:52:50,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:52:50,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:52:50,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:52:50,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:52:50,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:52:50,399 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:52:50,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:52:50,400 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:52:50,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:52:50,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:52:50,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:52:50,400 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:52:50,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:52:50,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:52:50,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:52:50,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:52:50,400 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:52:50,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:52:50,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:52:50,401 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:52:50,401 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 22:52:50,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:52:50,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:52:50,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:52:50,644 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:52:50,645 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:52:50,645 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-2.i [2022-12-05 22:52:51,517 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:52:51,709 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:52:51,709 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i [2022-12-05 22:52:51,721 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d12419a1/9612be196e474565b803212c4f1d86b7/FLAGf86ba4b71 [2022-12-05 22:52:51,732 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d12419a1/9612be196e474565b803212c4f1d86b7 [2022-12-05 22:52:51,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:52:51,734 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:52:51,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:52:51,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:52:51,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:52:51,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:52:51" (1/1) ... [2022-12-05 22:52:51,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ab15032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:51, skipping insertion in model container [2022-12-05 22:52:51,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:52:51" (1/1) ... [2022-12-05 22:52:51,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:52:51,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:52:52,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:52,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:52,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:52,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:52,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:52,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:52,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:52,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:52,023 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2022-12-05 22:52:52,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:52:52,033 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:52:52,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:52,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:52,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:52,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:52,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:52,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:52,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:52,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:52,075 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2022-12-05 22:52:52,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:52:52,107 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:52:52,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52 WrapperNode [2022-12-05 22:52:52,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:52:52,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:52:52,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:52:52,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:52:52,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,154 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-12-05 22:52:52,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:52:52,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:52:52,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:52:52,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:52:52,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,185 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:52:52,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:52:52,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:52:52,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:52:52,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (1/1) ... [2022-12-05 22:52:52,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:52:52,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:52,216 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-05 22:52:52,240 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-05 22:52:52,250 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-05 22:52:52,251 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-05 22:52:52,251 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-05 22:52:52,251 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-05 22:52:52,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:52:52,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:52:52,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:52:52,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:52:52,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:52:52,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:52:52,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:52:52,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:52:52,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:52:52,253 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 22:52:52,389 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:52:52,391 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:52:52,532 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:52:52,537 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:52:52,537 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-05 22:52:52,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:52:52 BoogieIcfgContainer [2022-12-05 22:52:52,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:52:52,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:52:52,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:52:52,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:52:52,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:52:51" (1/3) ... [2022-12-05 22:52:52,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f03a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:52:52, skipping insertion in model container [2022-12-05 22:52:52,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:52" (2/3) ... [2022-12-05 22:52:52,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f03a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:52:52, skipping insertion in model container [2022-12-05 22:52:52,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:52:52" (3/3) ... [2022-12-05 22:52:52,544 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2022-12-05 22:52:52,557 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:52:52,557 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 22:52:52,557 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:52:52,591 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:52:52,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 66 transitions, 142 flow [2022-12-05 22:52:52,654 INFO L130 PetriNetUnfolder]: 5/64 cut-off events. [2022-12-05 22:52:52,655 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:52:52,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 64 events. 5/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-12-05 22:52:52,659 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 66 transitions, 142 flow [2022-12-05 22:52:52,662 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 64 transitions, 134 flow [2022-12-05 22:52:52,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:52,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 64 transitions, 134 flow [2022-12-05 22:52:52,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 64 transitions, 134 flow [2022-12-05 22:52:52,702 INFO L130 PetriNetUnfolder]: 5/64 cut-off events. [2022-12-05 22:52:52,702 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:52:52,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 64 events. 5/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-12-05 22:52:52,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 64 transitions, 134 flow [2022-12-05 22:52:52,705 INFO L188 LiptonReduction]: Number of co-enabled transitions 1078 [2022-12-05 22:52:54,753 INFO L203 LiptonReduction]: Total number of compositions: 51 [2022-12-05 22:52:54,764 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:52:54,768 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;@4401ae91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:52:54,768 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-05 22:52:54,771 INFO L130 PetriNetUnfolder]: 2/11 cut-off events. [2022-12-05 22:52:54,771 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:52:54,771 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:54,771 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 22:52:54,772 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:54,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:54,775 INFO L85 PathProgramCache]: Analyzing trace with hash -977143138, now seen corresponding path program 1 times [2022-12-05 22:52:54,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:54,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963145089] [2022-12-05 22:52:54,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:54,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:55,083 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-05 22:52:55,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:55,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963145089] [2022-12-05 22:52:55,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963145089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:55,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:55,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:52:55,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324704628] [2022-12-05 22:52:55,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:55,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:52:55,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:55,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:52:55,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:52:55,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:55,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 32 flow. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-05 22:52:55,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:55,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:55,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:55,193 INFO L130 PetriNetUnfolder]: 94/152 cut-off events. [2022-12-05 22:52:55,193 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 22:52:55,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 152 events. 94/152 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 395 event pairs, 11 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 306. Up to 76 conditions per place. [2022-12-05 22:52:55,195 INFO L137 encePairwiseOnDemand]: 9/13 looper letters, 18 selfloop transitions, 4 changer transitions 4/26 dead transitions. [2022-12-05 22:52:55,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 26 transitions, 110 flow [2022-12-05 22:52:55,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:52:55,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:52:55,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-05 22:52:55,203 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2022-12-05 22:52:55,204 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 32 flow. Second operand 4 states and 27 transitions. [2022-12-05 22:52:55,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 26 transitions, 110 flow [2022-12-05 22:52:55,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:52:55,207 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 53 flow [2022-12-05 22:52:55,208 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=53, PETRI_PLACES=21, PETRI_TRANSITIONS=15} [2022-12-05 22:52:55,211 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2022-12-05 22:52:55,211 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:55,211 INFO L89 Accepts]: Start accepts. Operand has 21 places, 15 transitions, 53 flow [2022-12-05 22:52:55,213 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:55,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:55,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 15 transitions, 53 flow [2022-12-05 22:52:55,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 15 transitions, 53 flow [2022-12-05 22:52:55,217 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-05 22:52:55,217 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 22:52:55,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 18 events. 4/18 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 28. Up to 5 conditions per place. [2022-12-05 22:52:55,218 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 15 transitions, 53 flow [2022-12-05 22:52:55,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-05 22:52:55,227 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= (ite (<= 26 v_~i~0_26) 1 0) |v_ULTIMATE.start_main_~condI~0#1_25|) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-05 22:52:55,248 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:52:55,249 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-05 22:52:55,249 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 14 transitions, 51 flow [2022-12-05 22:52:55,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-05 22:52:55,249 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:55,250 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:55,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:52:55,250 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:55,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:55,250 INFO L85 PathProgramCache]: Analyzing trace with hash -226702759, now seen corresponding path program 1 times [2022-12-05 22:52:55,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:55,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210139900] [2022-12-05 22:52:55,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:55,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:55,318 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-05 22:52:55,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:55,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210139900] [2022-12-05 22:52:55,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210139900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:55,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:55,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:52:55,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759756491] [2022-12-05 22:52:55,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:55,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:52:55,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:55,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:52:55,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:52:55,321 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:55,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 14 transitions, 51 flow. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-05 22:52:55,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:55,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:55,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:55,393 INFO L130 PetriNetUnfolder]: 91/157 cut-off events. [2022-12-05 22:52:55,393 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-12-05 22:52:55,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 157 events. 91/157 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 450 event pairs, 32 based on Foata normal form. 10/141 useless extension candidates. Maximal degree in co-relation 390. Up to 69 conditions per place. [2022-12-05 22:52:55,397 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 26 selfloop transitions, 5 changer transitions 3/34 dead transitions. [2022-12-05 22:52:55,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 34 transitions, 181 flow [2022-12-05 22:52:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:52:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:52:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-12-05 22:52:55,400 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5230769230769231 [2022-12-05 22:52:55,400 INFO L175 Difference]: Start difference. First operand has 19 places, 14 transitions, 51 flow. Second operand 5 states and 34 transitions. [2022-12-05 22:52:55,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 34 transitions, 181 flow [2022-12-05 22:52:55,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 34 transitions, 173 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 22:52:55,402 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 91 flow [2022-12-05 22:52:55,402 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2022-12-05 22:52:55,403 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-05 22:52:55,403 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:55,403 INFO L89 Accepts]: Start accepts. Operand has 25 places, 18 transitions, 91 flow [2022-12-05 22:52:55,403 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:55,403 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:55,404 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 18 transitions, 91 flow [2022-12-05 22:52:55,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 18 transitions, 91 flow [2022-12-05 22:52:55,410 INFO L130 PetriNetUnfolder]: 11/32 cut-off events. [2022-12-05 22:52:55,410 INFO L131 PetriNetUnfolder]: For 18/19 co-relation queries the response was YES. [2022-12-05 22:52:55,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 32 events. 11/32 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 75. Up to 10 conditions per place. [2022-12-05 22:52:55,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 18 transitions, 91 flow [2022-12-05 22:52:55,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-05 22:52:55,414 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:52:55,415 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-05 22:52:55,416 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 91 flow [2022-12-05 22:52:55,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-05 22:52:55,416 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:55,416 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:55,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 22:52:55,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:55,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:55,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1562125437, now seen corresponding path program 1 times [2022-12-05 22:52:55,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:55,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229111648] [2022-12-05 22:52:55,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:55,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:55,496 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-05 22:52:55,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:55,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229111648] [2022-12-05 22:52:55,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229111648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:55,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:55,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:52:55,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143686597] [2022-12-05 22:52:55,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:55,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:52:55,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:55,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:52:55,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:52:55,498 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:55,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 91 flow. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-05 22:52:55,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:55,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:55,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:55,575 INFO L130 PetriNetUnfolder]: 83/147 cut-off events. [2022-12-05 22:52:55,575 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-05 22:52:55,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 147 events. 83/147 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 414 event pairs, 18 based on Foata normal form. 10/157 useless extension candidates. Maximal degree in co-relation 443. Up to 66 conditions per place. [2022-12-05 22:52:55,576 INFO L137 encePairwiseOnDemand]: 7/13 looper letters, 23 selfloop transitions, 8 changer transitions 4/35 dead transitions. [2022-12-05 22:52:55,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 35 transitions, 221 flow [2022-12-05 22:52:55,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:52:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:52:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-12-05 22:52:55,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5076923076923077 [2022-12-05 22:52:55,577 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 91 flow. Second operand 5 states and 33 transitions. [2022-12-05 22:52:55,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 35 transitions, 221 flow [2022-12-05 22:52:55,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 35 transitions, 215 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-05 22:52:55,580 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 136 flow [2022-12-05 22:52:55,580 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-05 22:52:55,581 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 13 predicate places. [2022-12-05 22:52:55,581 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:55,581 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 136 flow [2022-12-05 22:52:55,581 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:55,582 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:55,582 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 136 flow [2022-12-05 22:52:55,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 136 flow [2022-12-05 22:52:55,585 INFO L130 PetriNetUnfolder]: 12/34 cut-off events. [2022-12-05 22:52:55,585 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-05 22:52:55,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 34 events. 12/34 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 95. Up to 10 conditions per place. [2022-12-05 22:52:55,586 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 136 flow [2022-12-05 22:52:55,586 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-05 22:52:55,587 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:52:55,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-05 22:52:55,587 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 136 flow [2022-12-05 22:52:55,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-05 22:52:55,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:55,588 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:55,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 22:52:55,588 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:55,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:55,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1436153506, now seen corresponding path program 1 times [2022-12-05 22:52:55,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:55,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059979934] [2022-12-05 22:52:55,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:55,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:55,647 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-05 22:52:55,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:55,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059979934] [2022-12-05 22:52:55,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059979934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:55,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:55,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:52:55,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840419733] [2022-12-05 22:52:55,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:55,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:52:55,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:55,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:52:55,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:52:55,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:55,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 136 flow. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:55,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:55,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:55,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:55,737 INFO L130 PetriNetUnfolder]: 111/195 cut-off events. [2022-12-05 22:52:55,737 INFO L131 PetriNetUnfolder]: For 374/374 co-relation queries the response was YES. [2022-12-05 22:52:55,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 195 events. 111/195 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 581 event pairs, 27 based on Foata normal form. 8/203 useless extension candidates. Maximal degree in co-relation 675. Up to 57 conditions per place. [2022-12-05 22:52:55,740 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 26 selfloop transitions, 11 changer transitions 4/41 dead transitions. [2022-12-05 22:52:55,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 309 flow [2022-12-05 22:52:55,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:52:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:52:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-12-05 22:52:55,743 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2022-12-05 22:52:55,743 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 136 flow. Second operand 6 states and 35 transitions. [2022-12-05 22:52:55,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 309 flow [2022-12-05 22:52:55,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 290 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-05 22:52:55,747 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 196 flow [2022-12-05 22:52:55,747 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-05 22:52:55,748 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 20 predicate places. [2022-12-05 22:52:55,748 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:55,748 INFO L89 Accepts]: Start accepts. Operand has 38 places, 25 transitions, 196 flow [2022-12-05 22:52:55,749 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:55,750 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:55,750 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 196 flow [2022-12-05 22:52:55,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 25 transitions, 196 flow [2022-12-05 22:52:55,756 INFO L130 PetriNetUnfolder]: 17/48 cut-off events. [2022-12-05 22:52:55,756 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2022-12-05 22:52:55,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 48 events. 17/48 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 115 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 166. Up to 15 conditions per place. [2022-12-05 22:52:55,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 25 transitions, 196 flow [2022-12-05 22:52:55,757 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-05 22:52:55,762 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:52:55,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-05 22:52:55,769 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 196 flow [2022-12-05 22:52:55,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:55,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:55,769 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:55,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 22:52:55,770 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:55,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:55,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1617536060, now seen corresponding path program 1 times [2022-12-05 22:52:55,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:55,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10430550] [2022-12-05 22:52:55,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:55,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:55,884 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-05 22:52:55,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:55,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10430550] [2022-12-05 22:52:55,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10430550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:55,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:55,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:52:55,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834647097] [2022-12-05 22:52:55,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:55,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:52:55,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:55,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:52:55,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:52:55,887 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:55,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 196 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:55,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:55,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:55,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:55,964 INFO L130 PetriNetUnfolder]: 107/191 cut-off events. [2022-12-05 22:52:55,964 INFO L131 PetriNetUnfolder]: For 560/560 co-relation queries the response was YES. [2022-12-05 22:52:55,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 191 events. 107/191 cut-off events. For 560/560 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 574 event pairs, 20 based on Foata normal form. 8/199 useless extension candidates. Maximal degree in co-relation 725. Up to 47 conditions per place. [2022-12-05 22:52:55,965 INFO L137 encePairwiseOnDemand]: 7/13 looper letters, 20 selfloop transitions, 16 changer transitions 6/42 dead transitions. [2022-12-05 22:52:55,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 359 flow [2022-12-05 22:52:55,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:52:55,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:52:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-12-05 22:52:55,967 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2022-12-05 22:52:55,967 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 196 flow. Second operand 6 states and 34 transitions. [2022-12-05 22:52:55,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 359 flow [2022-12-05 22:52:55,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 340 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-05 22:52:55,969 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 261 flow [2022-12-05 22:52:55,969 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=261, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-05 22:52:55,970 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 26 predicate places. [2022-12-05 22:52:55,970 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:55,970 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 261 flow [2022-12-05 22:52:55,970 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:55,970 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:55,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 261 flow [2022-12-05 22:52:55,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 28 transitions, 261 flow [2022-12-05 22:52:55,974 INFO L130 PetriNetUnfolder]: 17/49 cut-off events. [2022-12-05 22:52:55,975 INFO L131 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2022-12-05 22:52:55,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 49 events. 17/49 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 192. Up to 15 conditions per place. [2022-12-05 22:52:55,975 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 28 transitions, 261 flow [2022-12-05 22:52:55,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-05 22:52:55,976 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:52:55,977 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-05 22:52:55,977 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 261 flow [2022-12-05 22:52:55,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:55,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:55,977 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:55,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 22:52:55,977 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:55,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:55,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1570456670, now seen corresponding path program 2 times [2022-12-05 22:52:55,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:55,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200710700] [2022-12-05 22:52:55,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:55,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:56,033 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-05 22:52:56,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:56,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200710700] [2022-12-05 22:52:56,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200710700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:56,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:56,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:52:56,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011804101] [2022-12-05 22:52:56,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:56,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:52:56,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:56,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:52:56,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:52:56,035 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:56,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 261 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:56,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:56,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:56,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:56,123 INFO L130 PetriNetUnfolder]: 119/211 cut-off events. [2022-12-05 22:52:56,123 INFO L131 PetriNetUnfolder]: For 875/875 co-relation queries the response was YES. [2022-12-05 22:52:56,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 211 events. 119/211 cut-off events. For 875/875 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 684 event pairs, 27 based on Foata normal form. 4/215 useless extension candidates. Maximal degree in co-relation 892. Up to 112 conditions per place. [2022-12-05 22:52:56,124 INFO L137 encePairwiseOnDemand]: 7/13 looper letters, 30 selfloop transitions, 13 changer transitions 8/51 dead transitions. [2022-12-05 22:52:56,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 473 flow [2022-12-05 22:52:56,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 22:52:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 22:52:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-12-05 22:52:56,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-05 22:52:56,127 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 261 flow. Second operand 7 states and 42 transitions. [2022-12-05 22:52:56,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 473 flow [2022-12-05 22:52:56,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 417 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-05 22:52:56,131 INFO L231 Difference]: Finished difference. Result has 50 places, 32 transitions, 304 flow [2022-12-05 22:52:56,131 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=50, PETRI_TRANSITIONS=32} [2022-12-05 22:52:56,133 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 32 predicate places. [2022-12-05 22:52:56,133 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:56,133 INFO L89 Accepts]: Start accepts. Operand has 50 places, 32 transitions, 304 flow [2022-12-05 22:52:56,135 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:56,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:56,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 32 transitions, 304 flow [2022-12-05 22:52:56,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 32 transitions, 304 flow [2022-12-05 22:52:56,140 INFO L130 PetriNetUnfolder]: 20/56 cut-off events. [2022-12-05 22:52:56,140 INFO L131 PetriNetUnfolder]: For 163/165 co-relation queries the response was YES. [2022-12-05 22:52:56,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 56 events. 20/56 cut-off events. For 163/165 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 148 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 214. Up to 17 conditions per place. [2022-12-05 22:52:56,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 32 transitions, 304 flow [2022-12-05 22:52:56,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-05 22:52:56,142 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:52:56,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-05 22:52:56,143 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 32 transitions, 304 flow [2022-12-05 22:52:56,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:56,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:56,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:56,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 22:52:56,144 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:56,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:56,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1571201197, now seen corresponding path program 1 times [2022-12-05 22:52:56,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:56,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644678717] [2022-12-05 22:52:56,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:56,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:56,232 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-05 22:52:56,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:56,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644678717] [2022-12-05 22:52:56,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644678717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:56,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:56,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:52:56,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451248181] [2022-12-05 22:52:56,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:56,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:52:56,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:56,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:52:56,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:52:56,234 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:56,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 32 transitions, 304 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:56,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:56,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:56,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:56,327 INFO L130 PetriNetUnfolder]: 137/247 cut-off events. [2022-12-05 22:52:56,327 INFO L131 PetriNetUnfolder]: For 869/869 co-relation queries the response was YES. [2022-12-05 22:52:56,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 247 events. 137/247 cut-off events. For 869/869 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 857 event pairs, 34 based on Foata normal form. 8/255 useless extension candidates. Maximal degree in co-relation 1025. Up to 138 conditions per place. [2022-12-05 22:52:56,329 INFO L137 encePairwiseOnDemand]: 7/13 looper letters, 35 selfloop transitions, 13 changer transitions 11/59 dead transitions. [2022-12-05 22:52:56,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 59 transitions, 559 flow [2022-12-05 22:52:56,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 22:52:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 22:52:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-12-05 22:52:56,330 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4423076923076923 [2022-12-05 22:52:56,330 INFO L175 Difference]: Start difference. First operand has 50 places, 32 transitions, 304 flow. Second operand 8 states and 46 transitions. [2022-12-05 22:52:56,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 59 transitions, 559 flow [2022-12-05 22:52:56,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 528 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-05 22:52:56,335 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 378 flow [2022-12-05 22:52:56,335 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=378, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2022-12-05 22:52:56,335 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 40 predicate places. [2022-12-05 22:52:56,336 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:56,336 INFO L89 Accepts]: Start accepts. Operand has 58 places, 37 transitions, 378 flow [2022-12-05 22:52:56,336 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:56,336 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:56,336 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 37 transitions, 378 flow [2022-12-05 22:52:56,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 37 transitions, 378 flow [2022-12-05 22:52:56,348 INFO L130 PetriNetUnfolder]: 25/69 cut-off events. [2022-12-05 22:52:56,348 INFO L131 PetriNetUnfolder]: For 281/281 co-relation queries the response was YES. [2022-12-05 22:52:56,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 69 events. 25/69 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 205 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 295. Up to 22 conditions per place. [2022-12-05 22:52:56,349 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 37 transitions, 378 flow [2022-12-05 22:52:56,349 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-05 22:52:56,360 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= (ite (<= 26 v_~i~0_26) 1 0) |v_ULTIMATE.start_main_~condI~0#1_25|) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 10)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-05 22:52:56,378 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= (ite (<= 26 v_~i~0_26) 1 0) |v_ULTIMATE.start_main_~condI~0#1_25|) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-05 22:52:56,401 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:52:56,402 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-05 22:52:56,402 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 394 flow [2022-12-05 22:52:56,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:56,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:56,402 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:56,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 22:52:56,402 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:56,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:56,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1459042263, now seen corresponding path program 2 times [2022-12-05 22:52:56,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:56,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360555176] [2022-12-05 22:52:56,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:56,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:56,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:56,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360555176] [2022-12-05 22:52:56,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360555176] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:56,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524066430] [2022-12-05 22:52:56,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:52:56,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:56,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:56,516 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-05 22:52:56,539 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-05 22:52:56,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:52:56,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:52:56,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-05 22:52:56,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:56,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:52:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:56,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524066430] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:52:56,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:52:56,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-05 22:52:56,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750167566] [2022-12-05 22:52:56,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:52:56,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 22:52:56,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:56,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 22:52:56,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-05 22:52:56,721 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 22:52:56,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 394 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-05 22:52:56,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:56,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 22:52:56,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:56,953 INFO L130 PetriNetUnfolder]: 217/395 cut-off events. [2022-12-05 22:52:56,953 INFO L131 PetriNetUnfolder]: For 2361/2361 co-relation queries the response was YES. [2022-12-05 22:52:56,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 395 events. 217/395 cut-off events. For 2361/2361 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1467 event pairs, 16 based on Foata normal form. 28/423 useless extension candidates. Maximal degree in co-relation 1814. Up to 95 conditions per place. [2022-12-05 22:52:56,955 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 41 selfloop transitions, 40 changer transitions 19/100 dead transitions. [2022-12-05 22:52:56,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 100 transitions, 1014 flow [2022-12-05 22:52:56,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 22:52:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 22:52:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 89 transitions. [2022-12-05 22:52:56,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34901960784313724 [2022-12-05 22:52:56,958 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 394 flow. Second operand 17 states and 89 transitions. [2022-12-05 22:52:56,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 100 transitions, 1014 flow [2022-12-05 22:52:56,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 100 transitions, 979 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-05 22:52:56,965 INFO L231 Difference]: Finished difference. Result has 82 places, 52 transitions, 703 flow [2022-12-05 22:52:56,965 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=703, PETRI_PLACES=82, PETRI_TRANSITIONS=52} [2022-12-05 22:52:56,967 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 64 predicate places. [2022-12-05 22:52:56,967 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:56,968 INFO L89 Accepts]: Start accepts. Operand has 82 places, 52 transitions, 703 flow [2022-12-05 22:52:56,969 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:56,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:56,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 52 transitions, 703 flow [2022-12-05 22:52:56,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 52 transitions, 703 flow [2022-12-05 22:52:56,979 INFO L130 PetriNetUnfolder]: 45/118 cut-off events. [2022-12-05 22:52:56,979 INFO L131 PetriNetUnfolder]: For 1676/1676 co-relation queries the response was YES. [2022-12-05 22:52:56,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 118 events. 45/118 cut-off events. For 1676/1676 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 793. Up to 40 conditions per place. [2022-12-05 22:52:56,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 52 transitions, 703 flow [2022-12-05 22:52:56,980 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-05 22:52:57,015 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= (ite (<= 26 v_~i~0_26) 1 0) |v_ULTIMATE.start_main_~condI~0#1_25|) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-05 22:52:57,033 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= (ite (<= 26 v_~i~0_26) 1 0) |v_ULTIMATE.start_main_~condI~0#1_25|) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 10)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-05 22:52:57,054 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:52:57,055 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-05 22:52:57,055 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 52 transitions, 719 flow [2022-12-05 22:52:57,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-05 22:52:57,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:57,055 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:57,066 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-05 22:52:57,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:57,262 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:57,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:57,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1439509225, now seen corresponding path program 3 times [2022-12-05 22:52:57,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:57,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003886395] [2022-12-05 22:52:57,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:57,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:57,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:57,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003886395] [2022-12-05 22:52:57,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003886395] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:57,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069320799] [2022-12-05 22:52:57,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 22:52:57,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:57,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:57,364 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-05 22:52:57,379 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-05 22:52:57,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-05 22:52:57,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:52:57,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-05 22:52:57,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:57,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:57,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:52:57,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:57,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069320799] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:52:57,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:52:57,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-05 22:52:57,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178140186] [2022-12-05 22:52:57,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:52:57,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 22:52:57,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:57,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 22:52:57,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-05 22:52:57,509 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 22:52:57,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 52 transitions, 719 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-05 22:52:57,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:57,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 22:52:57,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:57,813 INFO L130 PetriNetUnfolder]: 342/630 cut-off events. [2022-12-05 22:52:57,813 INFO L131 PetriNetUnfolder]: For 10638/10638 co-relation queries the response was YES. [2022-12-05 22:52:57,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4170 conditions, 630 events. 342/630 cut-off events. For 10638/10638 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2728 event pairs, 61 based on Foata normal form. 24/654 useless extension candidates. Maximal degree in co-relation 4126. Up to 221 conditions per place. [2022-12-05 22:52:57,817 INFO L137 encePairwiseOnDemand]: 7/17 looper letters, 42 selfloop transitions, 39 changer transitions 43/124 dead transitions. [2022-12-05 22:52:57,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 124 transitions, 1795 flow [2022-12-05 22:52:57,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 22:52:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 22:52:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-12-05 22:52:57,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32525951557093424 [2022-12-05 22:52:57,819 INFO L175 Difference]: Start difference. First operand has 82 places, 52 transitions, 719 flow. Second operand 17 states and 94 transitions. [2022-12-05 22:52:57,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 124 transitions, 1795 flow [2022-12-05 22:52:57,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 124 transitions, 1484 flow, removed 135 selfloop flow, removed 7 redundant places. [2022-12-05 22:52:57,836 INFO L231 Difference]: Finished difference. Result has 101 places, 59 transitions, 831 flow [2022-12-05 22:52:57,837 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=831, PETRI_PLACES=101, PETRI_TRANSITIONS=59} [2022-12-05 22:52:57,837 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 83 predicate places. [2022-12-05 22:52:57,837 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:57,838 INFO L89 Accepts]: Start accepts. Operand has 101 places, 59 transitions, 831 flow [2022-12-05 22:52:57,839 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:57,839 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:57,839 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 59 transitions, 831 flow [2022-12-05 22:52:57,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 59 transitions, 831 flow [2022-12-05 22:52:57,852 INFO L130 PetriNetUnfolder]: 53/142 cut-off events. [2022-12-05 22:52:57,852 INFO L131 PetriNetUnfolder]: For 3662/3662 co-relation queries the response was YES. [2022-12-05 22:52:57,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 142 events. 53/142 cut-off events. For 3662/3662 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 455 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 1092. Up to 55 conditions per place. [2022-12-05 22:52:57,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 59 transitions, 831 flow [2022-12-05 22:52:57,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 164 [2022-12-05 22:52:57,867 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:52:57,868 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-05 22:52:57,868 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 58 transitions, 821 flow [2022-12-05 22:52:57,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-05 22:52:57,868 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:57,868 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:57,891 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-05 22:52:58,073 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,SelfDestructingSolverStorable8 [2022-12-05 22:52:58,073 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:58,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:58,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2037417729, now seen corresponding path program 4 times [2022-12-05 22:52:58,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:58,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574963402] [2022-12-05 22:52:58,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:58,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:58,147 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-05 22:52:58,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:58,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574963402] [2022-12-05 22:52:58,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574963402] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:58,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597660095] [2022-12-05 22:52:58,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 22:52:58,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:58,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:58,162 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-05 22:52:58,164 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-05 22:52:58,212 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 22:52:58,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:52:58,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-05 22:52:58,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:58,245 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-05 22:52:58,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:52:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:58,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597660095] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:52:58,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:52:58,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-05 22:52:58,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996241449] [2022-12-05 22:52:58,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:52:58,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-05 22:52:58,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:58,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-05 22:52:58,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-12-05 22:52:58,316 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 22:52:58,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 58 transitions, 821 flow. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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-05 22:52:58,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:58,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 22:52:58,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:58,641 INFO L130 PetriNetUnfolder]: 340/624 cut-off events. [2022-12-05 22:52:58,641 INFO L131 PetriNetUnfolder]: For 17871/17871 co-relation queries the response was YES. [2022-12-05 22:52:58,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4795 conditions, 624 events. 340/624 cut-off events. For 17871/17871 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2607 event pairs, 13 based on Foata normal form. 24/648 useless extension candidates. Maximal degree in co-relation 4744. Up to 211 conditions per place. [2022-12-05 22:52:58,645 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 36 selfloop transitions, 54 changer transitions 45/135 dead transitions. [2022-12-05 22:52:58,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 135 transitions, 2185 flow [2022-12-05 22:52:58,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-05 22:52:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-05 22:52:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 99 transitions. [2022-12-05 22:52:58,646 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3473684210526316 [2022-12-05 22:52:58,646 INFO L175 Difference]: Start difference. First operand has 100 places, 58 transitions, 821 flow. Second operand 19 states and 99 transitions. [2022-12-05 22:52:58,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 135 transitions, 2185 flow [2022-12-05 22:52:58,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 135 transitions, 1677 flow, removed 210 selfloop flow, removed 24 redundant places. [2022-12-05 22:52:58,669 INFO L231 Difference]: Finished difference. Result has 104 places, 67 transitions, 995 flow [2022-12-05 22:52:58,670 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=995, PETRI_PLACES=104, PETRI_TRANSITIONS=67} [2022-12-05 22:52:58,670 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 86 predicate places. [2022-12-05 22:52:58,670 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:58,670 INFO L89 Accepts]: Start accepts. Operand has 104 places, 67 transitions, 995 flow [2022-12-05 22:52:58,682 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:58,683 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:58,683 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 67 transitions, 995 flow [2022-12-05 22:52:58,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 67 transitions, 995 flow [2022-12-05 22:52:58,695 INFO L130 PetriNetUnfolder]: 55/148 cut-off events. [2022-12-05 22:52:58,695 INFO L131 PetriNetUnfolder]: For 4632/4632 co-relation queries the response was YES. [2022-12-05 22:52:58,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 148 events. 55/148 cut-off events. For 4632/4632 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 482 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 1267. Up to 68 conditions per place. [2022-12-05 22:52:58,697 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 67 transitions, 995 flow [2022-12-05 22:52:58,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-05 22:52:58,743 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= (ite (<= 26 v_~i~0_26) 1 0) |v_ULTIMATE.start_main_~condI~0#1_25|) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-05 22:52:58,760 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= (ite (<= 26 v_~i~0_26) 1 0) |v_ULTIMATE.start_main_~condI~0#1_25|) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 10)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-05 22:52:58,777 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:52:58,778 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-05 22:52:58,778 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 65 transitions, 999 flow [2022-12-05 22:52:58,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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-05 22:52:58,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:58,778 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:58,787 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-05 22:52:58,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:58,983 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:58,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:58,983 INFO L85 PathProgramCache]: Analyzing trace with hash 887507261, now seen corresponding path program 5 times [2022-12-05 22:52:58,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:58,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704289578] [2022-12-05 22:52:58,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:58,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:59,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:59,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704289578] [2022-12-05 22:52:59,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704289578] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:59,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647682193] [2022-12-05 22:52:59,076 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-05 22:52:59,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:59,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:59,077 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-05 22:52:59,079 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-05 22:52:59,142 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-05 22:52:59,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:52:59,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-05 22:52:59,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:59,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:52:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:59,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647682193] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:52:59,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:52:59,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2022-12-05 22:52:59,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43319807] [2022-12-05 22:52:59,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:52:59,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-05 22:52:59,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:59,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-05 22:52:59,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2022-12-05 22:52:59,296 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 22:52:59,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 65 transitions, 999 flow. Second operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:59,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:59,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 22:52:59,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:59,906 INFO L130 PetriNetUnfolder]: 422/774 cut-off events. [2022-12-05 22:52:59,907 INFO L131 PetriNetUnfolder]: For 28701/28701 co-relation queries the response was YES. [2022-12-05 22:52:59,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6617 conditions, 774 events. 422/774 cut-off events. For 28701/28701 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3158 event pairs, 14 based on Foata normal form. 36/810 useless extension candidates. Maximal degree in co-relation 6565. Up to 289 conditions per place. [2022-12-05 22:52:59,911 INFO L137 encePairwiseOnDemand]: 7/17 looper letters, 50 selfloop transitions, 71 changer transitions 79/200 dead transitions. [2022-12-05 22:52:59,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 200 transitions, 3533 flow [2022-12-05 22:52:59,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-05 22:52:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-05 22:52:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 175 transitions. [2022-12-05 22:52:59,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29411764705882354 [2022-12-05 22:52:59,912 INFO L175 Difference]: Start difference. First operand has 103 places, 65 transitions, 999 flow. Second operand 35 states and 175 transitions. [2022-12-05 22:52:59,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 200 transitions, 3533 flow [2022-12-05 22:52:59,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 200 transitions, 3045 flow, removed 218 selfloop flow, removed 13 redundant places. [2022-12-05 22:52:59,936 INFO L231 Difference]: Finished difference. Result has 142 places, 82 transitions, 1538 flow [2022-12-05 22:52:59,936 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=1538, PETRI_PLACES=142, PETRI_TRANSITIONS=82} [2022-12-05 22:52:59,936 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 124 predicate places. [2022-12-05 22:52:59,936 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:59,936 INFO L89 Accepts]: Start accepts. Operand has 142 places, 82 transitions, 1538 flow [2022-12-05 22:52:59,940 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:59,940 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:59,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 82 transitions, 1538 flow [2022-12-05 22:52:59,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 82 transitions, 1538 flow [2022-12-05 22:52:59,957 INFO L130 PetriNetUnfolder]: 70/185 cut-off events. [2022-12-05 22:52:59,957 INFO L131 PetriNetUnfolder]: For 12608/12608 co-relation queries the response was YES. [2022-12-05 22:52:59,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2235 conditions, 185 events. 70/185 cut-off events. For 12608/12608 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 563 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 2172. Up to 94 conditions per place. [2022-12-05 22:52:59,960 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 82 transitions, 1538 flow [2022-12-05 22:52:59,960 INFO L188 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-05 22:52:59,962 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= (ite (<= 26 v_~i~0_26) 1 0) |v_ULTIMATE.start_main_~condI~0#1_25|) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-05 22:52:59,981 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= (ite (<= 26 v_~i~0_26) 1 0) |v_ULTIMATE.start_main_~condI~0#1_25|) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-05 22:52:59,999 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= (ite (<= 26 v_~i~0_26) 1 0) |v_ULTIMATE.start_main_~condI~0#1_25|) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 10)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-05 22:53:00,030 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:53:00,030 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-05 22:53:00,030 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 78 transitions, 1565 flow [2022-12-05 22:53:00,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:00,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:00,031 INFO L213 CegarLoopForPetriNet]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:00,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-05 22:53:00,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:53:00,235 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:53:00,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:00,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1967853994, now seen corresponding path program 6 times [2022-12-05 22:53:00,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:00,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676430345] [2022-12-05 22:53:00,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:00,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:00,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:00,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676430345] [2022-12-05 22:53:00,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676430345] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:53:00,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55008525] [2022-12-05 22:53:00,430 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-05 22:53:00,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:53:00,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:53:00,432 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-05 22:53:00,434 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-05 22:53:00,493 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-12-05 22:53:00,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:53:00,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:53:00,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:53:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:00,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:53:00,752 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:00,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55008525] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:53:00,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:53:00,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 33 [2022-12-05 22:53:00,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055281118] [2022-12-05 22:53:00,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:53:00,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-05 22:53:00,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:00,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-05 22:53:00,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2022-12-05 22:53:00,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 22:53:00,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 78 transitions, 1565 flow. Second operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 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-05 22:53:00,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:00,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 22:53:00,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:01,641 INFO L130 PetriNetUnfolder]: 510/962 cut-off events. [2022-12-05 22:53:01,641 INFO L131 PetriNetUnfolder]: For 65518/65518 co-relation queries the response was YES. [2022-12-05 22:53:01,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10974 conditions, 962 events. 510/962 cut-off events. For 65518/65518 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4081 event pairs, 15 based on Foata normal form. 36/998 useless extension candidates. Maximal degree in co-relation 10908. Up to 405 conditions per place. [2022-12-05 22:53:01,649 INFO L137 encePairwiseOnDemand]: 7/17 looper letters, 61 selfloop transitions, 82 changer transitions 90/233 dead transitions. [2022-12-05 22:53:01,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 233 transitions, 5446 flow [2022-12-05 22:53:01,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-05 22:53:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-05 22:53:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 196 transitions. [2022-12-05 22:53:01,650 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2812051649928264 [2022-12-05 22:53:01,650 INFO L175 Difference]: Start difference. First operand has 141 places, 78 transitions, 1565 flow. Second operand 41 states and 196 transitions. [2022-12-05 22:53:01,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 233 transitions, 5446 flow [2022-12-05 22:53:01,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 233 transitions, 3878 flow, removed 754 selfloop flow, removed 19 redundant places. [2022-12-05 22:53:01,724 INFO L231 Difference]: Finished difference. Result has 175 places, 98 transitions, 1691 flow [2022-12-05 22:53:01,725 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=1691, PETRI_PLACES=175, PETRI_TRANSITIONS=98} [2022-12-05 22:53:01,725 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 157 predicate places. [2022-12-05 22:53:01,725 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:01,725 INFO L89 Accepts]: Start accepts. Operand has 175 places, 98 transitions, 1691 flow [2022-12-05 22:53:01,729 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:01,729 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:01,729 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 98 transitions, 1691 flow [2022-12-05 22:53:01,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 98 transitions, 1691 flow [2022-12-05 22:53:01,752 INFO L130 PetriNetUnfolder]: 89/243 cut-off events. [2022-12-05 22:53:01,752 INFO L131 PetriNetUnfolder]: For 23945/23945 co-relation queries the response was YES. [2022-12-05 22:53:01,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 243 events. 89/243 cut-off events. For 23945/23945 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 799 event pairs, 0 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 3024. Up to 138 conditions per place. [2022-12-05 22:53:01,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 98 transitions, 1691 flow [2022-12-05 22:53:01,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-05 22:53:01,759 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= (ite (<= 26 v_~i~0_26) 1 0) |v_ULTIMATE.start_main_~condI~0#1_25|) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-05 22:53:01,775 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= (ite (<= 26 v_~i~0_26) 1 0) |v_ULTIMATE.start_main_~condI~0#1_25|) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 10)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-05 22:53:01,797 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [245] L714-4-->L704-5: Formula: (and (< v_t2Thread1of1ForFork1_~k~1_112 10) (= |v_ULTIMATE.start_main_~condI~0#1_96| (ite (<= 26 v_~i~0_156) 1 0)) (= v_~j~0_141 (+ v_~i~0_156 1)) (= (+ v_t2Thread1of1ForFork1_~k~1_112 1) v_t2Thread1of1ForFork1_~k~1_111)) InVars {~i~0=v_~i~0_156, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_112} OutVars{~j~0=v_~j~0_141, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_59|, ~i~0=v_~i~0_156, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_66|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_78|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_96|, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_111} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1, t2Thread1of1ForFork1_~k~1] and [213] L717-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (<= 26 v_~j~0_31) 1 0) |v_ULTIMATE.start_main_~condJ~0#1_19|) (or (not (= |v_ULTIMATE.start_main_~condI~0#1_21| 0)) (not (= |v_ULTIMATE.start_main_~condJ~0#1_19| 0)))) InVars {~j~0=v_~j~0_31, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_21|} OutVars{~j~0=v_~j~0_31, ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_19|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0#1] [2022-12-05 22:53:01,840 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:53:01,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-05 22:53:01,840 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 96 transitions, 1697 flow [2022-12-05 22:53:01,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 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-05 22:53:01,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:01,841 INFO L213 CegarLoopForPetriNet]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:01,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-05 22:53:02,045 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,SelfDestructingSolverStorable11 [2022-12-05 22:53:02,045 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:53:02,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:02,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1055844758, now seen corresponding path program 1 times [2022-12-05 22:53:02,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:02,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471291815] [2022-12-05 22:53:02,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:02,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:02,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:02,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471291815] [2022-12-05 22:53:02,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471291815] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:53:02,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227044546] [2022-12-05 22:53:02,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:02,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:53:02,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:53:02,247 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-05 22:53:02,248 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-05 22:53:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:02,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-05 22:53:02,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:53:02,385 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:02,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:53:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:02,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227044546] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:53:02,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:53:02,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-12-05 22:53:02,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899432289] [2022-12-05 22:53:02,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:53:02,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-05 22:53:02,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:02,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-05 22:53:02,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2022-12-05 22:53:02,594 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-05 22:53:02,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 96 transitions, 1697 flow. Second operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 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-05 22:53:02,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:02,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-05 22:53:02,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:03,301 INFO L130 PetriNetUnfolder]: 438/830 cut-off events. [2022-12-05 22:53:03,302 INFO L131 PetriNetUnfolder]: For 78178/78178 co-relation queries the response was YES. [2022-12-05 22:53:03,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9338 conditions, 830 events. 438/830 cut-off events. For 78178/78178 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3284 event pairs, 21 based on Foata normal form. 26/856 useless extension candidates. Maximal degree in co-relation 9263. Up to 341 conditions per place. [2022-12-05 22:53:03,308 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 57 selfloop transitions, 76 changer transitions 91/224 dead transitions. [2022-12-05 22:53:03,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 224 transitions, 4994 flow [2022-12-05 22:53:03,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-05 22:53:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-05 22:53:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 187 transitions. [2022-12-05 22:53:03,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24605263157894736 [2022-12-05 22:53:03,310 INFO L175 Difference]: Start difference. First operand has 175 places, 96 transitions, 1697 flow. Second operand 40 states and 187 transitions. [2022-12-05 22:53:03,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 224 transitions, 4994 flow [2022-12-05 22:53:03,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 224 transitions, 4284 flow, removed 305 selfloop flow, removed 33 redundant places. [2022-12-05 22:53:03,377 INFO L231 Difference]: Finished difference. Result has 190 places, 88 transitions, 1651 flow [2022-12-05 22:53:03,377 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=1651, PETRI_PLACES=190, PETRI_TRANSITIONS=88} [2022-12-05 22:53:03,377 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 172 predicate places. [2022-12-05 22:53:03,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:03,378 INFO L89 Accepts]: Start accepts. Operand has 190 places, 88 transitions, 1651 flow [2022-12-05 22:53:03,381 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:03,381 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:03,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 88 transitions, 1651 flow [2022-12-05 22:53:03,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 88 transitions, 1651 flow [2022-12-05 22:53:03,404 INFO L130 PetriNetUnfolder]: 84/231 cut-off events. [2022-12-05 22:53:03,405 INFO L131 PetriNetUnfolder]: For 31870/31944 co-relation queries the response was YES. [2022-12-05 22:53:03,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3363 conditions, 231 events. 84/231 cut-off events. For 31870/31944 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 693 event pairs, 1 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 3289. Up to 129 conditions per place. [2022-12-05 22:53:03,408 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 88 transitions, 1651 flow [2022-12-05 22:53:03,408 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-05 22:53:03,411 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= (ite (<= 26 v_~i~0_26) 1 0) |v_ULTIMATE.start_main_~condI~0#1_25|) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-05 22:53:03,432 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= (ite (<= 26 v_~i~0_26) 1 0) |v_ULTIMATE.start_main_~condI~0#1_25|) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (< v_t2Thread1of1ForFork1_~k~1_34 10) (= (+ v_~i~0_20 1) v_~j~0_26)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-05 22:53:03,451 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= (ite (<= 26 v_~i~0_26) 1 0) |v_ULTIMATE.start_main_~condI~0#1_25|) InVars {~i~0=v_~i~0_26} OutVars{~i~0=v_~i~0_26, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_13|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~condI~0#1] and [232] L696-5-->L696-5: Formula: (and (= v_t1Thread1of1ForFork0_~k~0_27 (+ v_t1Thread1of1ForFork0_~k~0_28 1)) (= (+ v_~j~0_53 1) v_~i~0_41) (< v_t1Thread1of1ForFork0_~k~0_28 10)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-05 22:53:03,475 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:53:03,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-05 22:53:03,476 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 86 transitions, 1591 flow [2022-12-05 22:53:03,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 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-05 22:53:03,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:03,476 INFO L213 CegarLoopForPetriNet]: trace histogram [9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:03,481 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-05 22:53:03,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:53:03,681 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:53:03,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:03,681 INFO L85 PathProgramCache]: Analyzing trace with hash 120831725, now seen corresponding path program 1 times [2022-12-05 22:53:03,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:03,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85949233] [2022-12-05 22:53:03,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:03,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:03,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:03,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85949233] [2022-12-05 22:53:03,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85949233] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:53:03,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931873009] [2022-12-05 22:53:03,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:03,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:53:03,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:53:03,907 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-05 22:53:03,909 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-05 22:53:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:03,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-05 22:53:03,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:53:04,017 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:04,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:53:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:04,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931873009] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:53:04,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:53:04,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 39 [2022-12-05 22:53:04,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118681496] [2022-12-05 22:53:04,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:53:04,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-05 22:53:04,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:04,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-05 22:53:04,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=1274, Unknown=0, NotChecked=0, Total=1640 [2022-12-05 22:53:04,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 22:53:04,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 86 transitions, 1591 flow. Second operand has 41 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 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-05 22:53:04,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:04,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 22:53:04,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:05,280 INFO L130 PetriNetUnfolder]: 404/764 cut-off events. [2022-12-05 22:53:05,280 INFO L131 PetriNetUnfolder]: For 88061/88061 co-relation queries the response was YES. [2022-12-05 22:53:05,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9364 conditions, 764 events. 404/764 cut-off events. For 88061/88061 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2875 event pairs, 13 based on Foata normal form. 28/792 useless extension candidates. Maximal degree in co-relation 9287. Up to 307 conditions per place. [2022-12-05 22:53:05,287 INFO L137 encePairwiseOnDemand]: 7/18 looper letters, 61 selfloop transitions, 93 changer transitions 87/241 dead transitions. [2022-12-05 22:53:05,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 241 transitions, 5935 flow [2022-12-05 22:53:05,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-05 22:53:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-05 22:53:05,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 210 transitions. [2022-12-05 22:53:05,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2536231884057971 [2022-12-05 22:53:05,288 INFO L175 Difference]: Start difference. First operand has 184 places, 86 transitions, 1591 flow. Second operand 46 states and 210 transitions. [2022-12-05 22:53:05,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 241 transitions, 5935 flow [2022-12-05 22:53:05,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 241 transitions, 4797 flow, removed 499 selfloop flow, removed 43 redundant places. [2022-12-05 22:53:05,373 INFO L231 Difference]: Finished difference. Result has 196 places, 104 transitions, 1902 flow [2022-12-05 22:53:05,374 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=1902, PETRI_PLACES=196, PETRI_TRANSITIONS=104} [2022-12-05 22:53:05,374 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 178 predicate places. [2022-12-05 22:53:05,374 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:05,374 INFO L89 Accepts]: Start accepts. Operand has 196 places, 104 transitions, 1902 flow [2022-12-05 22:53:05,378 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:05,378 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:05,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 104 transitions, 1902 flow [2022-12-05 22:53:05,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 104 transitions, 1902 flow [2022-12-05 22:53:05,405 INFO L130 PetriNetUnfolder]: 97/266 cut-off events. [2022-12-05 22:53:05,405 INFO L131 PetriNetUnfolder]: For 37801/37801 co-relation queries the response was YES. [2022-12-05 22:53:05,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3860 conditions, 266 events. 97/266 cut-off events. For 37801/37801 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 842 event pairs, 0 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 3783. Up to 151 conditions per place. [2022-12-05 22:53:05,409 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 104 transitions, 1902 flow [2022-12-05 22:53:05,409 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-05 22:53:05,432 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:53:05,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-05 22:53:05,433 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 101 transitions, 1918 flow [2022-12-05 22:53:05,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 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-05 22:53:05,433 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:05,433 INFO L213 CegarLoopForPetriNet]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:05,440 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-05 22:53:05,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:53:05,643 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:53:05,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:05,643 INFO L85 PathProgramCache]: Analyzing trace with hash -779723956, now seen corresponding path program 1 times [2022-12-05 22:53:05,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:05,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113281323] [2022-12-05 22:53:05,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:05,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:53:05,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 22:53:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:53:05,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 22:53:05,711 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 22:53:05,712 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-05 22:53:05,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-05 22:53:05,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-05 22:53:05,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 22:53:05,714 INFO L458 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:05,718 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:53:05,718 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:53:05,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:53:05 BasicIcfg [2022-12-05 22:53:05,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:53:05,776 INFO L158 Benchmark]: Toolchain (without parser) took 14041.90ms. Allocated memory was 206.6MB in the beginning and 310.4MB in the end (delta: 103.8MB). Free memory was 182.7MB in the beginning and 210.9MB in the end (delta: -28.2MB). Peak memory consumption was 76.2MB. Max. memory is 8.0GB. [2022-12-05 22:53:05,776 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 206.6MB. Free memory was 183.6MB in the beginning and 183.5MB in the end (delta: 65.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:53:05,777 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.88ms. Allocated memory is still 206.6MB. Free memory was 182.2MB in the beginning and 161.8MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-05 22:53:05,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.60ms. Allocated memory is still 206.6MB. Free memory was 161.8MB in the beginning and 160.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 22:53:05,777 INFO L158 Benchmark]: Boogie Preprocessor took 32.13ms. Allocated memory is still 206.6MB. Free memory was 160.2MB in the beginning and 158.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:53:05,777 INFO L158 Benchmark]: RCFGBuilder took 350.74ms. Allocated memory is still 206.6MB. Free memory was 158.6MB in the beginning and 146.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-05 22:53:05,777 INFO L158 Benchmark]: TraceAbstraction took 13236.04ms. Allocated memory was 206.6MB in the beginning and 310.4MB in the end (delta: 103.8MB). Free memory was 145.5MB in the beginning and 210.9MB in the end (delta: -65.4MB). Peak memory consumption was 39.5MB. Max. memory is 8.0GB. [2022-12-05 22:53:05,778 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 206.6MB. Free memory was 183.6MB in the beginning and 183.5MB in the end (delta: 65.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 372.88ms. Allocated memory is still 206.6MB. Free memory was 182.2MB in the beginning and 161.8MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.60ms. Allocated memory is still 206.6MB. Free memory was 161.8MB in the beginning and 160.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.13ms. Allocated memory is still 206.6MB. Free memory was 160.2MB in the beginning and 158.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 350.74ms. Allocated memory is still 206.6MB. Free memory was 158.6MB in the beginning and 146.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 13236.04ms. Allocated memory was 206.6MB in the beginning and 310.4MB in the end (delta: 103.8MB). Free memory was 145.5MB in the beginning and 210.9MB in the end (delta: -65.4MB). Peak memory consumption was 39.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 66 PlacesBefore, 18 PlacesAfterwards, 64 TransitionsBefore, 13 TransitionsAfterwards, 1078 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 18 TrivialYvCompositions, 30 ConcurrentYvCompositions, 3 ChoiceCompositions, 51 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 613, independent: 598, independent conditional: 598, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 613, independent: 598, independent conditional: 0, independent unconditional: 598, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 613, independent: 598, independent conditional: 0, independent unconditional: 598, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 613, independent: 598, independent conditional: 0, independent unconditional: 598, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 598, independent: 588, independent conditional: 0, independent unconditional: 588, 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: 598, independent: 588, independent conditional: 0, independent unconditional: 588, 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: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 613, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 598, unknown conditional: 0, unknown unconditional: 598] , Statistics on independence cache: Total cache size (in pairs): 1033, Positive cache size: 1023, Positive conditional cache size: 0, Positive unconditional cache size: 1023, 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, 20 PlacesBefore, 19 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 5, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 13, independent conditional: 5, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 5, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 10, unknown conditional: 4, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 8, Positive conditional cache size: 4, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 8, Positive conditional cache size: 4, Positive unconditional cache size: 4, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 10, Positive conditional cache size: 4, Positive unconditional cache size: 6, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, 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, 38 PlacesBefore, 38 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 10, Positive conditional cache size: 4, Positive unconditional cache size: 6, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 10, Positive conditional cache size: 4, Positive unconditional cache size: 6, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, 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, 50 PlacesBefore, 50 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 10, Positive conditional cache size: 4, Positive unconditional cache size: 6, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, 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, 58 PlacesBefore, 58 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 81 PlacesBefore, 82 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 9, independent conditional: 8, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 16, Positive conditional cache size: 9, Positive unconditional cache size: 7, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 100 PlacesAfterwards, 59 TransitionsBefore, 58 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 19, Positive conditional cache size: 12, Positive unconditional cache size: 7, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, 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, 102 PlacesBefore, 103 PlacesAfterwards, 67 TransitionsBefore, 65 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 17, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 17, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 30, Positive conditional cache size: 20, Positive unconditional cache size: 10, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 140 PlacesBefore, 141 PlacesAfterwards, 82 TransitionsBefore, 78 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 28, independent conditional: 26, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 28, independent conditional: 26, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 28, independent conditional: 26, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, 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: 13, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 15, independent conditional: 13, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 43, Positive conditional cache size: 33, Positive unconditional cache size: 10, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 174 PlacesBefore, 175 PlacesAfterwards, 98 TransitionsBefore, 96 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 10, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 20, independent conditional: 10, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 10, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 46, Positive conditional cache size: 36, Positive unconditional cache size: 10, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 184 PlacesBefore, 184 PlacesAfterwards, 88 TransitionsBefore, 86 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 7, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 7, independent unconditional: 4, 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: 11, independent: 11, independent conditional: 7, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 49, Positive conditional cache size: 39, Positive unconditional cache size: 10, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 195 PlacesBefore, 196 PlacesAfterwards, 104 TransitionsBefore, 101 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 8, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 8, independent unconditional: 4, 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: 12, independent: 12, independent conditional: 8, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 54, Positive conditional cache size: 43, Positive unconditional cache size: 11, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=51, arg={0:0}, argc=51, argv={49:50}, argv={49:50}, i=3, id1={5:0}, id2={3:0}, j=6, pthread_create(&id1, ((void *)0), t1, ((void *)0))=-2] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=51, arg={0:0}, arg={0:0}, arg={0:0}, argc=51, argv={49:50}, argv={49:50}, i=3, id1={5:0}, id2={3:0}, j=6, k=0, pthread_create(&id2, ((void *)0), t2, ((void *)0))=-1] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=3, k=2] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=5, k=4] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L716] 0 int condI = i >= (2*10 +6); [L696] COND TRUE 0 k < 10 [L698] 0 i = j + 1 [L696] 0 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L719] 0 int condJ = j >= (2*10 +6); [L721] COND TRUE 0 condI || condJ [L722] 0 reach_error() VAL [\old(argc)=51, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=51, argv={49:50}, argv={49:50}, condI=0, condJ=1, i=25, id1={5:0}, id2={3:0}, j=26, k=10, k=10] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 84 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.1s, OverallIterations: 15, TraceHistogramMax: 10, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2385 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2385 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 486 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2286 IncrementalHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 486 mSolverCounterUnsat, 0 mSDtfsCounter, 2286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 529 GetRequests, 138 SyntacticMatches, 7 SemanticMatches, 384 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5920 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1918occurred in iteration=14, InterpolantAutomatonStates: 256, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 392 ConstructedInterpolants, 0 QuantifiedInterpolants, 1471 SizeOfPredicates, 66 NumberOfNonLiveVariables, 1100 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 28 InterpolantComputations, 7 PerfectInterpolantSequences, 0/513 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 proved your program to be incorrect! [2022-12-05 22:53:05,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...