/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/triangular-longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:15:50,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:15:50,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:15:50,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:15:50,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:15:50,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:15:50,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:15:50,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:15:50,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:15:50,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:15:50,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:15:50,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:15:50,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:15:50,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:15:50,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:15:50,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:15:50,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:15:50,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:15:50,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:15:50,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:15:50,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:15:50,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:15:50,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:15:50,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:15:50,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:15:50,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:15:50,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:15:50,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:15:50,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:15:50,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:15:50,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:15:50,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:15:50,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:15:50,407 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:15:50,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:15:50,408 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:15:50,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:15:50,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:15:50,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:15:50,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:15:50,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:15:50,411 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:15:50,437 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:15:50,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:15:50,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:15:50,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:15:50,439 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:15:50,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:15:50,440 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:15:50,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:15:50,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:15:50,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:15:50,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:15:50,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:15:50,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:15:50,441 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:15:50,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:15:50,442 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:15:50,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:15:50,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:15:50,442 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:15:50,442 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:15:50,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:15:50,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:15:50,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:15:50,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:15:50,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:15:50,443 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:15:50,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:15:50,443 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:15:50,443 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-06 06:15:50,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:15:50,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:15:50,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:15:50,770 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:15:50,771 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:15:50,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2022-12-06 06:15:51,773 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:15:51,994 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:15:51,995 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2022-12-06 06:15:52,006 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/366b9abd6/cf61f0f3cfe7404b92204c23abc5e718/FLAGb595bbc86 [2022-12-06 06:15:52,018 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/366b9abd6/cf61f0f3cfe7404b92204c23abc5e718 [2022-12-06 06:15:52,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:15:52,021 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:15:52,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:15:52,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:15:52,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:15:52,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:15:52" (1/1) ... [2022-12-06 06:15:52,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d05ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:52, skipping insertion in model container [2022-12-06 06:15:52,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:15:52" (1/1) ... [2022-12-06 06:15:52,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:15:52,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:15:52,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:15:52,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:15:52,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:15:52,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:15:52,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:15:52,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:15:52,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:15:52,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:15:52,365 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-longest-2.i[30964,30977] [2022-12-06 06:15:52,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:15:52,376 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:15:52,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:15:52,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:15:52,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:15:52,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:15:52,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:15:52,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:15:52,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:15:52,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:15:52,404 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-longest-2.i[30964,30977] [2022-12-06 06:15:52,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:15:52,435 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:15:52,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:52 WrapperNode [2022-12-06 06:15:52,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:15:52,437 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:15:52,437 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:15:52,437 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:15:52,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:52" (1/1) ... [2022-12-06 06:15:52,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:52" (1/1) ... [2022-12-06 06:15:52,484 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-12-06 06:15:52,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:15:52,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:15:52,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:15:52,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:15:52,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:52" (1/1) ... [2022-12-06 06:15:52,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:52" (1/1) ... [2022-12-06 06:15:52,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:52" (1/1) ... [2022-12-06 06:15:52,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:52" (1/1) ... [2022-12-06 06:15:52,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:52" (1/1) ... [2022-12-06 06:15:52,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:52" (1/1) ... [2022-12-06 06:15:52,512 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:52" (1/1) ... [2022-12-06 06:15:52,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:52" (1/1) ... [2022-12-06 06:15:52,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:15:52,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:15:52,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:15:52,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:15:52,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:52" (1/1) ... [2022-12-06 06:15:52,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:15:52,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:52,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:15:52,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:15:52,597 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 06:15:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 06:15:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 06:15:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 06:15:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:15:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:15:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:15:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:15:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:15:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:15:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:15:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:15:52,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:15:52,600 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:15:52,696 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:15:52,697 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:15:52,858 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:15:52,863 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:15:52,863 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 06:15:52,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:15:52 BoogieIcfgContainer [2022-12-06 06:15:52,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:15:52,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:15:52,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:15:52,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:15:52,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:15:52" (1/3) ... [2022-12-06 06:15:52,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1c21ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:15:52, skipping insertion in model container [2022-12-06 06:15:52,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:52" (2/3) ... [2022-12-06 06:15:52,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1c21ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:15:52, skipping insertion in model container [2022-12-06 06:15:52,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:15:52" (3/3) ... [2022-12-06 06:15:52,884 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2022-12-06 06:15:52,897 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:15:52,898 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 06:15:52,898 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:15:52,967 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:15:52,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 66 transitions, 142 flow [2022-12-06 06:15:53,044 INFO L130 PetriNetUnfolder]: 5/64 cut-off events. [2022-12-06 06:15:53,045 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:15:53,049 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-06 06:15:53,049 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 66 transitions, 142 flow [2022-12-06 06:15:53,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 64 transitions, 134 flow [2022-12-06 06:15:53,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:53,068 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 64 transitions, 134 flow [2022-12-06 06:15:53,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 64 transitions, 134 flow [2022-12-06 06:15:53,082 INFO L130 PetriNetUnfolder]: 5/64 cut-off events. [2022-12-06 06:15:53,082 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:15:53,083 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-06 06:15:53,092 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 64 transitions, 134 flow [2022-12-06 06:15:53,092 INFO L188 LiptonReduction]: Number of co-enabled transitions 1078 [2022-12-06 06:15:54,967 INFO L203 LiptonReduction]: Total number of compositions: 51 [2022-12-06 06:15:54,984 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:15:55,004 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;@3cb249fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:15:55,005 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 06:15:55,007 INFO L130 PetriNetUnfolder]: 2/11 cut-off events. [2022-12-06 06:15:55,008 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:15:55,008 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:55,012 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 06:15:55,012 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:15:55,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:55,016 INFO L85 PathProgramCache]: Analyzing trace with hash -977143138, now seen corresponding path program 1 times [2022-12-06 06:15:55,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:55,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918327736] [2022-12-06 06:15:55,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:55,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:55,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:55,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918327736] [2022-12-06 06:15:55,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918327736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:55,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:55,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:15:55,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470371463] [2022-12-06 06:15:55,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:55,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:15:55,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:55,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:15:55,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:15:55,384 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 06:15:55,385 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-06 06:15:55,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:55,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 06:15:55,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:55,466 INFO L130 PetriNetUnfolder]: 94/152 cut-off events. [2022-12-06 06:15:55,466 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:15:55,467 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-06 06:15:55,469 INFO L137 encePairwiseOnDemand]: 9/13 looper letters, 18 selfloop transitions, 4 changer transitions 4/26 dead transitions. [2022-12-06 06:15:55,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 26 transitions, 110 flow [2022-12-06 06:15:55,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:15:55,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:15:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-06 06:15:55,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2022-12-06 06:15:55,479 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 32 flow. Second operand 4 states and 27 transitions. [2022-12-06 06:15:55,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 26 transitions, 110 flow [2022-12-06 06:15:55,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:15:55,500 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 53 flow [2022-12-06 06:15:55,501 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-06 06:15:55,505 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2022-12-06 06:15:55,505 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:55,506 INFO L89 Accepts]: Start accepts. Operand has 21 places, 15 transitions, 53 flow [2022-12-06 06:15:55,508 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:55,508 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:55,508 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 15 transitions, 53 flow [2022-12-06 06:15:55,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 15 transitions, 53 flow [2022-12-06 06:15:55,512 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-06 06:15:55,512 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:15:55,512 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-06 06:15:55,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 15 transitions, 53 flow [2022-12-06 06:15:55,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 06:15:55,528 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (<= 46 v_~i~0_26) 1 0)) 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 20) (= (+ 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-06 06:15:55,551 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:15:55,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 06:15:55,552 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 14 transitions, 51 flow [2022-12-06 06:15:55,552 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-06 06:15:55,552 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:55,552 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:55,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:15:55,553 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:15:55,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:55,553 INFO L85 PathProgramCache]: Analyzing trace with hash -226702759, now seen corresponding path program 1 times [2022-12-06 06:15:55,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:55,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137617854] [2022-12-06 06:15:55,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:55,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:55,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:55,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137617854] [2022-12-06 06:15:55,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137617854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:55,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:55,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:15:55,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850128903] [2022-12-06 06:15:55,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:55,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:15:55,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:55,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:15:55,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:15:55,637 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 06:15:55,637 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-06 06:15:55,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:55,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 06:15:55,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:55,682 INFO L130 PetriNetUnfolder]: 91/157 cut-off events. [2022-12-06 06:15:55,682 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-12-06 06:15:55,683 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-06 06:15:55,683 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 26 selfloop transitions, 5 changer transitions 3/34 dead transitions. [2022-12-06 06:15:55,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 34 transitions, 181 flow [2022-12-06 06:15:55,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:15:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:15:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-12-06 06:15:55,684 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5230769230769231 [2022-12-06 06:15:55,685 INFO L175 Difference]: Start difference. First operand has 19 places, 14 transitions, 51 flow. Second operand 5 states and 34 transitions. [2022-12-06 06:15:55,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 34 transitions, 181 flow [2022-12-06 06:15:55,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 34 transitions, 173 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:55,686 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 91 flow [2022-12-06 06:15:55,686 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-06 06:15:55,686 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 06:15:55,687 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:55,687 INFO L89 Accepts]: Start accepts. Operand has 25 places, 18 transitions, 91 flow [2022-12-06 06:15:55,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:55,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:55,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 18 transitions, 91 flow [2022-12-06 06:15:55,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 18 transitions, 91 flow [2022-12-06 06:15:55,690 INFO L130 PetriNetUnfolder]: 11/32 cut-off events. [2022-12-06 06:15:55,690 INFO L131 PetriNetUnfolder]: For 18/19 co-relation queries the response was YES. [2022-12-06 06:15:55,691 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-06 06:15:55,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 18 transitions, 91 flow [2022-12-06 06:15:55,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-06 06:15:55,693 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:55,694 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 06:15:55,694 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 91 flow [2022-12-06 06:15:55,695 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-06 06:15:55,695 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:55,695 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:55,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:15:55,695 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:15:55,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:55,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1562125437, now seen corresponding path program 1 times [2022-12-06 06:15:55,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:55,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581328541] [2022-12-06 06:15:55,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:55,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:55,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:55,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581328541] [2022-12-06 06:15:55,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581328541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:55,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:55,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:15:55,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397247680] [2022-12-06 06:15:55,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:55,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:15:55,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:55,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:15:55,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:15:55,756 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 06:15:55,756 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-06 06:15:55,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:55,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 06:15:55,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:55,834 INFO L130 PetriNetUnfolder]: 91/159 cut-off events. [2022-12-06 06:15:55,834 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 06:15:55,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 159 events. 91/159 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 452 event pairs, 16 based on Foata normal form. 10/169 useless extension candidates. Maximal degree in co-relation 479. Up to 66 conditions per place. [2022-12-06 06:15:55,835 INFO L137 encePairwiseOnDemand]: 7/13 looper letters, 24 selfloop transitions, 12 changer transitions 8/44 dead transitions. [2022-12-06 06:15:55,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 44 transitions, 270 flow [2022-12-06 06:15:55,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:15:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:15:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-12-06 06:15:55,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4725274725274725 [2022-12-06 06:15:55,836 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 91 flow. Second operand 7 states and 43 transitions. [2022-12-06 06:15:55,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 44 transitions, 270 flow [2022-12-06 06:15:55,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 44 transitions, 263 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:55,838 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 171 flow [2022-12-06 06:15:55,838 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=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=171, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2022-12-06 06:15:55,839 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 16 predicate places. [2022-12-06 06:15:55,839 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:55,839 INFO L89 Accepts]: Start accepts. Operand has 34 places, 25 transitions, 171 flow [2022-12-06 06:15:55,840 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:55,840 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:55,840 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 171 flow [2022-12-06 06:15:55,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 171 flow [2022-12-06 06:15:55,843 INFO L130 PetriNetUnfolder]: 16/42 cut-off events. [2022-12-06 06:15:55,843 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-06 06:15:55,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 42 events. 16/42 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 88 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 126. Up to 13 conditions per place. [2022-12-06 06:15:55,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 171 flow [2022-12-06 06:15:55,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 06:15:55,854 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:15:55,855 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 06:15:55,855 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 163 flow [2022-12-06 06:15:55,855 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-06 06:15:55,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:55,856 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:55,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:15:55,856 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:15:55,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:55,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1436153506, now seen corresponding path program 1 times [2022-12-06 06:15:55,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:55,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59729395] [2022-12-06 06:15:55,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:55,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:55,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:55,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59729395] [2022-12-06 06:15:55,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59729395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:55,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:55,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:15:55,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501233795] [2022-12-06 06:15:55,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:55,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:15:55,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:55,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:15:55,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:15:55,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 06:15:55,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 163 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-06 06:15:55,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:55,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 06:15:55,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:55,962 INFO L130 PetriNetUnfolder]: 115/203 cut-off events. [2022-12-06 06:15:55,962 INFO L131 PetriNetUnfolder]: For 453/453 co-relation queries the response was YES. [2022-12-06 06:15:55,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 203 events. 115/203 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 621 event pairs, 28 based on Foata normal form. 8/211 useless extension candidates. Maximal degree in co-relation 728. Up to 63 conditions per place. [2022-12-06 06:15:55,963 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 27 selfloop transitions, 12 changer transitions 4/43 dead transitions. [2022-12-06 06:15:55,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 339 flow [2022-12-06 06:15:55,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:15:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:15:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-12-06 06:15:55,964 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2022-12-06 06:15:55,964 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 163 flow. Second operand 6 states and 35 transitions. [2022-12-06 06:15:55,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 339 flow [2022-12-06 06:15:55,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 331 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-06 06:15:55,967 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 224 flow [2022-12-06 06:15:55,967 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-12-06 06:15:55,967 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 24 predicate places. [2022-12-06 06:15:55,968 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:55,968 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 224 flow [2022-12-06 06:15:55,968 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:55,968 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:55,968 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 224 flow [2022-12-06 06:15:55,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 27 transitions, 224 flow [2022-12-06 06:15:55,973 INFO L130 PetriNetUnfolder]: 19/53 cut-off events. [2022-12-06 06:15:55,973 INFO L131 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2022-12-06 06:15:55,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 53 events. 19/53 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 205. Up to 16 conditions per place. [2022-12-06 06:15:55,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 27 transitions, 224 flow [2022-12-06 06:15:55,974 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-06 06:15:55,976 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:55,977 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 06:15:55,977 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 224 flow [2022-12-06 06:15:55,977 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-06 06:15:55,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:55,977 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:55,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:15:55,978 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:15:55,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:55,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1617536060, now seen corresponding path program 1 times [2022-12-06 06:15:55,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:55,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938857440] [2022-12-06 06:15:55,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:55,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:56,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:56,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938857440] [2022-12-06 06:15:56,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938857440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:56,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:56,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:15:56,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805303531] [2022-12-06 06:15:56,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:56,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:15:56,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:56,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:15:56,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:15:56,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 06:15:56,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 224 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-06 06:15:56,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:56,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 06:15:56,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:56,102 INFO L130 PetriNetUnfolder]: 111/199 cut-off events. [2022-12-06 06:15:56,102 INFO L131 PetriNetUnfolder]: For 765/765 co-relation queries the response was YES. [2022-12-06 06:15:56,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 199 events. 111/199 cut-off events. For 765/765 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 626 event pairs, 18 based on Foata normal form. 8/207 useless extension candidates. Maximal degree in co-relation 807. Up to 53 conditions per place. [2022-12-06 06:15:56,104 INFO L137 encePairwiseOnDemand]: 7/13 looper letters, 21 selfloop transitions, 17 changer transitions 6/44 dead transitions. [2022-12-06 06:15:56,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 403 flow [2022-12-06 06:15:56,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:15:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:15:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-12-06 06:15:56,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2022-12-06 06:15:56,105 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 224 flow. Second operand 6 states and 34 transitions. [2022-12-06 06:15:56,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 403 flow [2022-12-06 06:15:56,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 369 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 06:15:56,108 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 285 flow [2022-12-06 06:15:56,108 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2022-12-06 06:15:56,109 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 30 predicate places. [2022-12-06 06:15:56,109 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:56,109 INFO L89 Accepts]: Start accepts. Operand has 48 places, 30 transitions, 285 flow [2022-12-06 06:15:56,109 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:56,110 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:56,110 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 30 transitions, 285 flow [2022-12-06 06:15:56,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 30 transitions, 285 flow [2022-12-06 06:15:56,114 INFO L130 PetriNetUnfolder]: 19/54 cut-off events. [2022-12-06 06:15:56,114 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2022-12-06 06:15:56,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 54 events. 19/54 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 138 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 217. Up to 16 conditions per place. [2022-12-06 06:15:56,115 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 30 transitions, 285 flow [2022-12-06 06:15:56,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 06:15:56,117 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:56,119 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 06:15:56,119 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 285 flow [2022-12-06 06:15:56,119 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-06 06:15:56,119 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:56,120 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:56,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:15:56,120 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:15:56,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:56,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1571201197, now seen corresponding path program 1 times [2022-12-06 06:15:56,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:56,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3203608] [2022-12-06 06:15:56,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:56,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:56,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:56,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3203608] [2022-12-06 06:15:56,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3203608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:56,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:56,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:15:56,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891218043] [2022-12-06 06:15:56,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:56,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:15:56,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:56,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:15:56,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:15:56,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 06:15:56,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 285 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-06 06:15:56,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:56,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 06:15:56,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:56,340 INFO L130 PetriNetUnfolder]: 129/235 cut-off events. [2022-12-06 06:15:56,340 INFO L131 PetriNetUnfolder]: For 1059/1059 co-relation queries the response was YES. [2022-12-06 06:15:56,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 235 events. 129/235 cut-off events. For 1059/1059 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 806 event pairs, 34 based on Foata normal form. 8/243 useless extension candidates. Maximal degree in co-relation 1012. Up to 126 conditions per place. [2022-12-06 06:15:56,342 INFO L137 encePairwiseOnDemand]: 7/13 looper letters, 33 selfloop transitions, 13 changer transitions 11/57 dead transitions. [2022-12-06 06:15:56,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 549 flow [2022-12-06 06:15:56,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:15:56,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:15:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-12-06 06:15:56,344 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4423076923076923 [2022-12-06 06:15:56,344 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 285 flow. Second operand 8 states and 46 transitions. [2022-12-06 06:15:56,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 549 flow [2022-12-06 06:15:56,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 57 transitions, 485 flow, removed 23 selfloop flow, removed 3 redundant places. [2022-12-06 06:15:56,347 INFO L231 Difference]: Finished difference. Result has 56 places, 35 transitions, 345 flow [2022-12-06 06:15:56,347 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=345, PETRI_PLACES=56, PETRI_TRANSITIONS=35} [2022-12-06 06:15:56,349 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 38 predicate places. [2022-12-06 06:15:56,349 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:56,349 INFO L89 Accepts]: Start accepts. Operand has 56 places, 35 transitions, 345 flow [2022-12-06 06:15:56,350 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:56,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:56,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 35 transitions, 345 flow [2022-12-06 06:15:56,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 35 transitions, 345 flow [2022-12-06 06:15:56,355 INFO L130 PetriNetUnfolder]: 23/65 cut-off events. [2022-12-06 06:15:56,355 INFO L131 PetriNetUnfolder]: For 226/226 co-relation queries the response was YES. [2022-12-06 06:15:56,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 65 events. 23/65 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 185 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 265. Up to 20 conditions per place. [2022-12-06 06:15:56,356 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 35 transitions, 345 flow [2022-12-06 06:15:56,356 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 06:15:56,364 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (<= 46 v_~i~0_26) 1 0)) 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 20)) 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-06 06:15:56,382 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (<= 46 v_~i~0_26) 1 0)) 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 20) (= (+ 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-06 06:15:56,407 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:15:56,409 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 06:15:56,409 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 35 transitions, 359 flow [2022-12-06 06:15:56,409 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-06 06:15:56,409 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:56,409 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:56,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:15:56,409 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:15:56,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:56,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1458297736, now seen corresponding path program 2 times [2022-12-06 06:15:56,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:56,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135929350] [2022-12-06 06:15:56,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:56,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:56,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:56,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135929350] [2022-12-06 06:15:56,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135929350] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:15:56,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080116005] [2022-12-06 06:15:56,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 06:15:56,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:56,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:56,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:15:56,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 06:15:56,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 06:15:56,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:15:56,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 06:15:56,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:15:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:56,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:15:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:56,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080116005] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:15:56,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:15:56,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 06:15:56,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648634145] [2022-12-06 06:15:56,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:15:56,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 06:15:56,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:56,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 06:15:56,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-06 06:15:56,799 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 06:15:56,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 35 transitions, 359 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-06 06:15:56,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:56,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 06:15:56,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:57,033 INFO L130 PetriNetUnfolder]: 185/331 cut-off events. [2022-12-06 06:15:57,034 INFO L131 PetriNetUnfolder]: For 1486/1486 co-relation queries the response was YES. [2022-12-06 06:15:57,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 331 events. 185/331 cut-off events. For 1486/1486 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1173 event pairs, 12 based on Foata normal form. 16/347 useless extension candidates. Maximal degree in co-relation 1450. Up to 79 conditions per place. [2022-12-06 06:15:57,038 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 30 selfloop transitions, 36 changer transitions 23/89 dead transitions. [2022-12-06 06:15:57,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 89 transitions, 862 flow [2022-12-06 06:15:57,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 06:15:57,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 06:15:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-12-06 06:15:57,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2022-12-06 06:15:57,039 INFO L175 Difference]: Start difference. First operand has 56 places, 35 transitions, 359 flow. Second operand 14 states and 78 transitions. [2022-12-06 06:15:57,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 89 transitions, 862 flow [2022-12-06 06:15:57,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 816 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-06 06:15:57,043 INFO L231 Difference]: Finished difference. Result has 71 places, 52 transitions, 631 flow [2022-12-06 06:15:57,043 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=631, PETRI_PLACES=71, PETRI_TRANSITIONS=52} [2022-12-06 06:15:57,043 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 53 predicate places. [2022-12-06 06:15:57,044 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:57,044 INFO L89 Accepts]: Start accepts. Operand has 71 places, 52 transitions, 631 flow [2022-12-06 06:15:57,045 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:57,045 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:57,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 52 transitions, 631 flow [2022-12-06 06:15:57,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 52 transitions, 631 flow [2022-12-06 06:15:57,052 INFO L130 PetriNetUnfolder]: 36/97 cut-off events. [2022-12-06 06:15:57,052 INFO L131 PetriNetUnfolder]: For 495/495 co-relation queries the response was YES. [2022-12-06 06:15:57,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 97 events. 36/97 cut-off events. For 495/495 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 297 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 475. Up to 33 conditions per place. [2022-12-06 06:15:57,053 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 52 transitions, 631 flow [2022-12-06 06:15:57,053 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 06:15:57,065 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:15:57,066 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 06:15:57,066 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 597 flow [2022-12-06 06:15:57,066 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-06 06:15:57,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:57,066 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:57,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 06:15:57,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:57,286 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:15:57,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:57,287 INFO L85 PathProgramCache]: Analyzing trace with hash 531828353, now seen corresponding path program 1 times [2022-12-06 06:15:57,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:57,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765297137] [2022-12-06 06:15:57,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:57,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:15:57,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:57,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765297137] [2022-12-06 06:15:57,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765297137] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:15:57,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507278549] [2022-12-06 06:15:57,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:57,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:57,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:57,384 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:15:57,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 06:15:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:57,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 06:15:57,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:15:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:15:57,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:15:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:15:57,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507278549] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:15:57,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:15:57,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 06:15:57,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225514921] [2022-12-06 06:15:57,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:15:57,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 06:15:57,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:57,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 06:15:57,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-06 06:15:57,643 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 06:15:57,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 597 flow. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:57,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:57,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 06:15:57,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:58,009 INFO L130 PetriNetUnfolder]: 238/450 cut-off events. [2022-12-06 06:15:58,009 INFO L131 PetriNetUnfolder]: For 3579/3579 co-relation queries the response was YES. [2022-12-06 06:15:58,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2289 conditions, 450 events. 238/450 cut-off events. For 3579/3579 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1750 event pairs, 40 based on Foata normal form. 32/482 useless extension candidates. Maximal degree in co-relation 2252. Up to 155 conditions per place. [2022-12-06 06:15:58,012 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 56 selfloop transitions, 37 changer transitions 32/125 dead transitions. [2022-12-06 06:15:58,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 125 transitions, 1452 flow [2022-12-06 06:15:58,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 06:15:58,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 06:15:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 97 transitions. [2022-12-06 06:15:58,016 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34035087719298246 [2022-12-06 06:15:58,016 INFO L175 Difference]: Start difference. First operand has 70 places, 49 transitions, 597 flow. Second operand 19 states and 97 transitions. [2022-12-06 06:15:58,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 125 transitions, 1452 flow [2022-12-06 06:15:58,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 125 transitions, 1093 flow, removed 157 selfloop flow, removed 9 redundant places. [2022-12-06 06:15:58,026 INFO L231 Difference]: Finished difference. Result has 91 places, 67 transitions, 756 flow [2022-12-06 06:15:58,026 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=756, PETRI_PLACES=91, PETRI_TRANSITIONS=67} [2022-12-06 06:15:58,028 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 73 predicate places. [2022-12-06 06:15:58,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:58,029 INFO L89 Accepts]: Start accepts. Operand has 91 places, 67 transitions, 756 flow [2022-12-06 06:15:58,030 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:58,030 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:58,030 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 67 transitions, 756 flow [2022-12-06 06:15:58,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 67 transitions, 756 flow [2022-12-06 06:15:58,042 INFO L130 PetriNetUnfolder]: 51/148 cut-off events. [2022-12-06 06:15:58,043 INFO L131 PetriNetUnfolder]: For 1350/1350 co-relation queries the response was YES. [2022-12-06 06:15:58,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 148 events. 51/148 cut-off events. For 1350/1350 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 516 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 766. Up to 51 conditions per place. [2022-12-06 06:15:58,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 67 transitions, 756 flow [2022-12-06 06:15:58,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 06:15:58,048 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:58,050 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 06:15:58,050 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 67 transitions, 756 flow [2022-12-06 06:15:58,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:58,050 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:58,050 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:58,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 06:15:58,255 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,SelfDestructingSolverStorable7 [2022-12-06 06:15:58,256 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:15:58,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:58,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1259191637, now seen corresponding path program 2 times [2022-12-06 06:15:58,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:58,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454229171] [2022-12-06 06:15:58,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:58,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:15:58,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:58,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454229171] [2022-12-06 06:15:58,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454229171] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:15:58,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110475062] [2022-12-06 06:15:58,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 06:15:58,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:58,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:58,360 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:15:58,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 06:15:58,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 06:15:58,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:15:58,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 06:15:58,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:15:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:15:58,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:15:58,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:15:58,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110475062] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:15:58,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:15:58,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-06 06:15:58,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920718715] [2022-12-06 06:15:58,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:15:58,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 06:15:58,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:58,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 06:15:58,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-12-06 06:15:58,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 06:15:58,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 67 transitions, 756 flow. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:58,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:58,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 06:15:58,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:58,857 INFO L130 PetriNetUnfolder]: 362/698 cut-off events. [2022-12-06 06:15:58,857 INFO L131 PetriNetUnfolder]: For 10685/10685 co-relation queries the response was YES. [2022-12-06 06:15:58,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3822 conditions, 698 events. 362/698 cut-off events. For 10685/10685 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3149 event pairs, 37 based on Foata normal form. 32/730 useless extension candidates. Maximal degree in co-relation 3778. Up to 175 conditions per place. [2022-12-06 06:15:58,861 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 48 selfloop transitions, 73 changer transitions 35/156 dead transitions. [2022-12-06 06:15:58,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 156 transitions, 1949 flow [2022-12-06 06:15:58,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 06:15:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 06:15:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2022-12-06 06:15:58,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33 [2022-12-06 06:15:58,862 INFO L175 Difference]: Start difference. First operand has 91 places, 67 transitions, 756 flow. Second operand 20 states and 99 transitions. [2022-12-06 06:15:58,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 156 transitions, 1949 flow [2022-12-06 06:15:58,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 156 transitions, 1767 flow, removed 81 selfloop flow, removed 5 redundant places. [2022-12-06 06:15:58,879 INFO L231 Difference]: Finished difference. Result has 117 places, 99 transitions, 1345 flow [2022-12-06 06:15:58,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1345, PETRI_PLACES=117, PETRI_TRANSITIONS=99} [2022-12-06 06:15:58,880 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 99 predicate places. [2022-12-06 06:15:58,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:58,880 INFO L89 Accepts]: Start accepts. Operand has 117 places, 99 transitions, 1345 flow [2022-12-06 06:15:58,881 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:58,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:58,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 99 transitions, 1345 flow [2022-12-06 06:15:58,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 99 transitions, 1345 flow [2022-12-06 06:15:58,902 INFO L130 PetriNetUnfolder]: 84/242 cut-off events. [2022-12-06 06:15:58,902 INFO L131 PetriNetUnfolder]: For 5505/5505 co-relation queries the response was YES. [2022-12-06 06:15:58,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 242 events. 84/242 cut-off events. For 5505/5505 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1043 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 1687. Up to 82 conditions per place. [2022-12-06 06:15:58,905 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 99 transitions, 1345 flow [2022-12-06 06:15:58,905 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 06:15:58,932 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (<= 46 v_~i~0_26) 1 0)) 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 20) (= (+ 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-06 06:15:58,950 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (<= 46 v_~i~0_26) 1 0)) 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 20)) 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-06 06:15:58,973 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:15:58,973 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 06:15:58,973 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 98 transitions, 1347 flow [2022-12-06 06:15:58,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:58,974 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:58,974 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:58,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 06:15:59,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:59,179 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:15:59,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash -835740951, now seen corresponding path program 3 times [2022-12-06 06:15:59,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:59,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346490260] [2022-12-06 06:15:59,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:59,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:15:59,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:59,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346490260] [2022-12-06 06:15:59,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346490260] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:15:59,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643248982] [2022-12-06 06:15:59,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 06:15:59,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:59,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:59,277 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:15:59,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 06:15:59,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 06:15:59,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:15:59,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 06:15:59,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:15:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:15:59,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:15:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:15:59,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643248982] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:15:59,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:15:59,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-06 06:15:59,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625925552] [2022-12-06 06:15:59,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:15:59,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 06:15:59,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:59,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 06:15:59,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-12-06 06:15:59,433 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:15:59,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 98 transitions, 1347 flow. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:59,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:59,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:15:59,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:59,903 INFO L130 PetriNetUnfolder]: 582/1110 cut-off events. [2022-12-06 06:15:59,903 INFO L131 PetriNetUnfolder]: For 32019/32019 co-relation queries the response was YES. [2022-12-06 06:15:59,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7691 conditions, 1110 events. 582/1110 cut-off events. For 32019/32019 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5708 event pairs, 34 based on Foata normal form. 32/1142 useless extension candidates. Maximal degree in co-relation 7634. Up to 273 conditions per place. [2022-12-06 06:15:59,910 INFO L137 encePairwiseOnDemand]: 7/17 looper letters, 61 selfloop transitions, 100 changer transitions 65/226 dead transitions. [2022-12-06 06:15:59,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 226 transitions, 3426 flow [2022-12-06 06:15:59,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 06:15:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 06:15:59,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 129 transitions. [2022-12-06 06:15:59,911 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3035294117647059 [2022-12-06 06:15:59,912 INFO L175 Difference]: Start difference. First operand has 117 places, 98 transitions, 1347 flow. Second operand 25 states and 129 transitions. [2022-12-06 06:15:59,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 226 transitions, 3426 flow [2022-12-06 06:15:59,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 226 transitions, 3031 flow, removed 168 selfloop flow, removed 8 redundant places. [2022-12-06 06:15:59,961 INFO L231 Difference]: Finished difference. Result has 147 places, 122 transitions, 1978 flow [2022-12-06 06:15:59,962 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1978, PETRI_PLACES=147, PETRI_TRANSITIONS=122} [2022-12-06 06:15:59,962 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 129 predicate places. [2022-12-06 06:15:59,962 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:59,962 INFO L89 Accepts]: Start accepts. Operand has 147 places, 122 transitions, 1978 flow [2022-12-06 06:15:59,965 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:59,965 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:59,965 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 122 transitions, 1978 flow [2022-12-06 06:15:59,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 122 transitions, 1978 flow [2022-12-06 06:15:59,991 INFO L130 PetriNetUnfolder]: 104/292 cut-off events. [2022-12-06 06:15:59,992 INFO L131 PetriNetUnfolder]: For 14550/14550 co-relation queries the response was YES. [2022-12-06 06:15:59,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2762 conditions, 292 events. 104/292 cut-off events. For 14550/14550 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1353 event pairs, 0 based on Foata normal form. 0/292 useless extension candidates. Maximal degree in co-relation 2696. Up to 97 conditions per place. [2022-12-06 06:15:59,996 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 122 transitions, 1978 flow [2022-12-06 06:15:59,996 INFO L188 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-06 06:16:00,005 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:16:00,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 06:16:00,006 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 122 transitions, 1978 flow [2022-12-06 06:16:00,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:00,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:00,006 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:00,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 06:16:00,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:16:00,211 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:16:00,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:00,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1827625191, now seen corresponding path program 4 times [2022-12-06 06:16:00,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:00,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264940888] [2022-12-06 06:16:00,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:00,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:00,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:00,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264940888] [2022-12-06 06:16:00,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264940888] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:16:00,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266074139] [2022-12-06 06:16:00,338 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 06:16:00,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:16:00,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:16:00,352 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:16:00,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 06:16:00,414 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 06:16:00,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:16:00,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:16:00,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:16:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:00,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:16:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:00,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266074139] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:16:00,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:16:00,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-12-06 06:16:00,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799300414] [2022-12-06 06:16:00,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:16:00,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 06:16:00,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:00,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 06:16:00,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2022-12-06 06:16:00,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 06:16:00,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 122 transitions, 1978 flow. Second operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:00,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:00,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 06:16:00,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:01,357 INFO L130 PetriNetUnfolder]: 872/1600 cut-off events. [2022-12-06 06:16:01,358 INFO L131 PetriNetUnfolder]: For 95158/95158 co-relation queries the response was YES. [2022-12-06 06:16:01,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15034 conditions, 1600 events. 872/1600 cut-off events. For 95158/95158 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7913 event pairs, 28 based on Foata normal form. 48/1648 useless extension candidates. Maximal degree in co-relation 14965. Up to 371 conditions per place. [2022-12-06 06:16:01,425 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 63 selfloop transitions, 157 changer transitions 95/315 dead transitions. [2022-12-06 06:16:01,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 315 transitions, 6632 flow [2022-12-06 06:16:01,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-06 06:16:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-06 06:16:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 183 transitions. [2022-12-06 06:16:01,438 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32972972972972975 [2022-12-06 06:16:01,438 INFO L175 Difference]: Start difference. First operand has 147 places, 122 transitions, 1978 flow. Second operand 37 states and 183 transitions. [2022-12-06 06:16:01,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 315 transitions, 6632 flow [2022-12-06 06:16:01,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 315 transitions, 5139 flow, removed 694 selfloop flow, removed 25 redundant places. [2022-12-06 06:16:01,551 INFO L231 Difference]: Finished difference. Result has 175 places, 194 transitions, 3694 flow [2022-12-06 06:16:01,551 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=1455, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=3694, PETRI_PLACES=175, PETRI_TRANSITIONS=194} [2022-12-06 06:16:01,552 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 157 predicate places. [2022-12-06 06:16:01,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:01,552 INFO L89 Accepts]: Start accepts. Operand has 175 places, 194 transitions, 3694 flow [2022-12-06 06:16:01,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:01,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:01,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 194 transitions, 3694 flow [2022-12-06 06:16:01,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 194 transitions, 3694 flow [2022-12-06 06:16:01,610 INFO L130 PetriNetUnfolder]: 162/445 cut-off events. [2022-12-06 06:16:01,610 INFO L131 PetriNetUnfolder]: For 33904/33904 co-relation queries the response was YES. [2022-12-06 06:16:01,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4900 conditions, 445 events. 162/445 cut-off events. For 33904/33904 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2097 event pairs, 0 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 4825. Up to 147 conditions per place. [2022-12-06 06:16:01,620 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 194 transitions, 3694 flow [2022-12-06 06:16:01,620 INFO L188 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-06 06:16:01,623 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (<= 46 v_~i~0_26) 1 0)) 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 20) (= (+ 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-06 06:16:01,662 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:16:01,662 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-06 06:16:01,662 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 186 transitions, 3652 flow [2022-12-06 06:16:01,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:01,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:01,663 INFO L213 CegarLoopForPetriNet]: trace histogram [10, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:01,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 06:16:01,868 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,SelfDestructingSolverStorable10 [2022-12-06 06:16:01,868 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:16:01,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:01,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1103738655, now seen corresponding path program 2 times [2022-12-06 06:16:01,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:01,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791470053] [2022-12-06 06:16:01,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:01,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:16:02,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:02,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791470053] [2022-12-06 06:16:02,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791470053] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:16:02,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496722986] [2022-12-06 06:16:02,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 06:16:02,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:16:02,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:16:02,161 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:16:02,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 06:16:02,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 06:16:02,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:16:02,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 06:16:02,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:16:02,318 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:16:02,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:16:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:16:02,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496722986] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:16:02,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:16:02,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 37 [2022-12-06 06:16:02,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937043147] [2022-12-06 06:16:02,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:16:02,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-06 06:16:02,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:02,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-06 06:16:02,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1153, Unknown=0, NotChecked=0, Total=1482 [2022-12-06 06:16:02,736 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 06:16:02,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 186 transitions, 3652 flow. Second operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 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-06 06:16:02,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:02,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 06:16:02,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:03,902 INFO L130 PetriNetUnfolder]: 798/1538 cut-off events. [2022-12-06 06:16:03,902 INFO L131 PetriNetUnfolder]: For 157319/157319 co-relation queries the response was YES. [2022-12-06 06:16:03,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16059 conditions, 1538 events. 798/1538 cut-off events. For 157319/157319 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7238 event pairs, 226 based on Foata normal form. 80/1618 useless extension candidates. Maximal degree in co-relation 15981. Up to 859 conditions per place. [2022-12-06 06:16:03,914 INFO L137 encePairwiseOnDemand]: 9/16 looper letters, 132 selfloop transitions, 84 changer transitions 134/350 dead transitions. [2022-12-06 06:16:03,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 350 transitions, 8173 flow [2022-12-06 06:16:03,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-06 06:16:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-12-06 06:16:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 205 transitions. [2022-12-06 06:16:03,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29796511627906974 [2022-12-06 06:16:03,916 INFO L175 Difference]: Start difference. First operand has 175 places, 186 transitions, 3652 flow. Second operand 43 states and 205 transitions. [2022-12-06 06:16:03,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 350 transitions, 8173 flow [2022-12-06 06:16:04,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 350 transitions, 5587 flow, removed 1258 selfloop flow, removed 10 redundant places. [2022-12-06 06:16:04,080 INFO L231 Difference]: Finished difference. Result has 227 places, 169 transitions, 2796 flow [2022-12-06 06:16:04,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=2212, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=2796, PETRI_PLACES=227, PETRI_TRANSITIONS=169} [2022-12-06 06:16:04,081 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 209 predicate places. [2022-12-06 06:16:04,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:04,081 INFO L89 Accepts]: Start accepts. Operand has 227 places, 169 transitions, 2796 flow [2022-12-06 06:16:04,086 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:04,086 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:04,086 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 169 transitions, 2796 flow [2022-12-06 06:16:04,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 169 transitions, 2796 flow [2022-12-06 06:16:04,136 INFO L130 PetriNetUnfolder]: 141/417 cut-off events. [2022-12-06 06:16:04,137 INFO L131 PetriNetUnfolder]: For 45900/45900 co-relation queries the response was YES. [2022-12-06 06:16:04,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4589 conditions, 417 events. 141/417 cut-off events. For 45900/45900 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1560 event pairs, 0 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 4495. Up to 140 conditions per place. [2022-12-06 06:16:04,143 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 169 transitions, 2796 flow [2022-12-06 06:16:04,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-06 06:16:04,145 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:16:04,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 06:16:04,145 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 169 transitions, 2796 flow [2022-12-06 06:16:04,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 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-06 06:16:04,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:04,146 INFO L213 CegarLoopForPetriNet]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:04,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 06:16:04,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:16:04,350 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:16:04,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:04,351 INFO L85 PathProgramCache]: Analyzing trace with hash -412450456, now seen corresponding path program 1 times [2022-12-06 06:16:04,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:04,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427489927] [2022-12-06 06:16:04,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:04,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:16:04,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:04,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427489927] [2022-12-06 06:16:04,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427489927] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:16:04,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412373375] [2022-12-06 06:16:04,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:04,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:16:04,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:16:04,540 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:16:04,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 06:16:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:04,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 06:16:04,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:16:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:16:04,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:16:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:16:04,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412373375] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:16:04,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:16:04,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2022-12-06 06:16:04,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320646720] [2022-12-06 06:16:04,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:16:04,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-06 06:16:04,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:04,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-06 06:16:04,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1093, Unknown=0, NotChecked=0, Total=1406 [2022-12-06 06:16:04,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 06:16:04,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 169 transitions, 2796 flow. Second operand has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:04,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:04,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 06:16:04,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:06,527 INFO L130 PetriNetUnfolder]: 936/1788 cut-off events. [2022-12-06 06:16:06,527 INFO L131 PetriNetUnfolder]: For 274330/274330 co-relation queries the response was YES. [2022-12-06 06:16:06,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18926 conditions, 1788 events. 936/1788 cut-off events. For 274330/274330 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 8111 event pairs, 15 based on Foata normal form. 80/1868 useless extension candidates. Maximal degree in co-relation 18829. Up to 437 conditions per place. [2022-12-06 06:16:06,547 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 128 selfloop transitions, 223 changer transitions 121/472 dead transitions. [2022-12-06 06:16:06,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 472 transitions, 10232 flow [2022-12-06 06:16:06,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-12-06 06:16:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2022-12-06 06:16:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 327 transitions. [2022-12-06 06:16:06,556 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.296195652173913 [2022-12-06 06:16:06,556 INFO L175 Difference]: Start difference. First operand has 226 places, 169 transitions, 2796 flow. Second operand 69 states and 327 transitions. [2022-12-06 06:16:06,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 472 transitions, 10232 flow [2022-12-06 06:16:06,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 472 transitions, 8796 flow, removed 599 selfloop flow, removed 37 redundant places. [2022-12-06 06:16:06,790 INFO L231 Difference]: Finished difference. Result has 294 places, 255 transitions, 4948 flow [2022-12-06 06:16:06,791 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=1713, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=4948, PETRI_PLACES=294, PETRI_TRANSITIONS=255} [2022-12-06 06:16:06,791 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 276 predicate places. [2022-12-06 06:16:06,791 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:06,791 INFO L89 Accepts]: Start accepts. Operand has 294 places, 255 transitions, 4948 flow [2022-12-06 06:16:06,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:06,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:06,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 294 places, 255 transitions, 4948 flow [2022-12-06 06:16:06,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 294 places, 255 transitions, 4948 flow [2022-12-06 06:16:06,890 INFO L130 PetriNetUnfolder]: 230/644 cut-off events. [2022-12-06 06:16:06,891 INFO L131 PetriNetUnfolder]: For 158202/158202 co-relation queries the response was YES. [2022-12-06 06:16:06,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10045 conditions, 644 events. 230/644 cut-off events. For 158202/158202 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2762 event pairs, 0 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 9922. Up to 213 conditions per place. [2022-12-06 06:16:06,900 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 294 places, 255 transitions, 4948 flow [2022-12-06 06:16:06,901 INFO L188 LiptonReduction]: Number of co-enabled transitions 584 [2022-12-06 06:16:06,919 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:16:06,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-06 06:16:06,920 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 244 transitions, 4860 flow [2022-12-06 06:16:06,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:06,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:06,920 INFO L213 CegarLoopForPetriNet]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:06,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 06:16:07,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:16:07,125 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:16:07,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:07,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1156763688, now seen corresponding path program 5 times [2022-12-06 06:16:07,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:07,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447428715] [2022-12-06 06:16:07,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:07,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:07,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:07,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447428715] [2022-12-06 06:16:07,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447428715] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:16:07,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923553016] [2022-12-06 06:16:07,538 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 06:16:07,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:16:07,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:16:07,539 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:16:07,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 06:16:07,626 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2022-12-06 06:16:07,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:16:07,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 06:16:07,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:16:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:07,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:16:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:08,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923553016] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:16:08,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:16:08,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 57 [2022-12-06 06:16:08,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342955349] [2022-12-06 06:16:08,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:16:08,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-12-06 06:16:08,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:08,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-12-06 06:16:08,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=795, Invalid=2627, Unknown=0, NotChecked=0, Total=3422 [2022-12-06 06:16:08,200 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 06:16:08,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 244 transitions, 4860 flow. Second operand has 59 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:08,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:08,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 06:16:08,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:10,966 INFO L130 PetriNetUnfolder]: 1392/2696 cut-off events. [2022-12-06 06:16:10,966 INFO L131 PetriNetUnfolder]: For 652023/652023 co-relation queries the response was YES. [2022-12-06 06:16:10,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41156 conditions, 2696 events. 1392/2696 cut-off events. For 652023/652023 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13275 event pairs, 12 based on Foata normal form. 60/2756 useless extension candidates. Maximal degree in co-relation 41030. Up to 663 conditions per place. [2022-12-06 06:16:10,993 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 112 selfloop transitions, 218 changer transitions 221/551 dead transitions. [2022-12-06 06:16:10,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 551 transitions, 17276 flow [2022-12-06 06:16:10,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-12-06 06:16:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2022-12-06 06:16:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 359 transitions. [2022-12-06 06:16:10,998 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28401898734177217 [2022-12-06 06:16:10,998 INFO L175 Difference]: Start difference. First operand has 295 places, 244 transitions, 4860 flow. Second operand 79 states and 359 transitions. [2022-12-06 06:16:10,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 551 transitions, 17276 flow [2022-12-06 06:16:11,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 551 transitions, 12868 flow, removed 2146 selfloop flow, removed 20 redundant places. [2022-12-06 06:16:11,976 INFO L231 Difference]: Finished difference. Result has 379 places, 251 transitions, 5321 flow [2022-12-06 06:16:11,977 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=2688, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=79, PETRI_FLOW=5321, PETRI_PLACES=379, PETRI_TRANSITIONS=251} [2022-12-06 06:16:11,977 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 361 predicate places. [2022-12-06 06:16:11,977 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:11,977 INFO L89 Accepts]: Start accepts. Operand has 379 places, 251 transitions, 5321 flow [2022-12-06 06:16:12,002 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:12,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:12,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 379 places, 251 transitions, 5321 flow [2022-12-06 06:16:12,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 251 transitions, 5321 flow [2022-12-06 06:16:12,098 INFO L130 PetriNetUnfolder]: 220/624 cut-off events. [2022-12-06 06:16:12,098 INFO L131 PetriNetUnfolder]: For 253665/253665 co-relation queries the response was YES. [2022-12-06 06:16:12,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11864 conditions, 624 events. 220/624 cut-off events. For 253665/253665 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2434 event pairs, 0 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 11716. Up to 206 conditions per place. [2022-12-06 06:16:12,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 377 places, 251 transitions, 5321 flow [2022-12-06 06:16:12,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-06 06:16:12,165 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (<= 46 v_~i~0_26) 1 0)) 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 20)) 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-06 06:16:12,238 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:16:12,240 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 263 [2022-12-06 06:16:12,240 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 243 transitions, 5369 flow [2022-12-06 06:16:12,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:12,240 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:12,240 INFO L213 CegarLoopForPetriNet]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:12,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 06:16:12,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 06:16:12,448 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:16:12,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:12,449 INFO L85 PathProgramCache]: Analyzing trace with hash -646623016, now seen corresponding path program 6 times [2022-12-06 06:16:12,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:12,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837384539] [2022-12-06 06:16:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:12,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:13,284 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:13,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:13,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837384539] [2022-12-06 06:16:13,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837384539] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:16:13,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194369957] [2022-12-06 06:16:13,285 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 06:16:13,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:16:13,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:16:13,286 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:16:13,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 06:16:13,418 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-12-06 06:16:13,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:16:13,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 06:16:13,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:16:13,518 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:13,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:16:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:14,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194369957] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:16:14,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:16:14,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 47 [2022-12-06 06:16:14,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119492211] [2022-12-06 06:16:14,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:16:14,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-06 06:16:14,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:14,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-06 06:16:14,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=1822, Unknown=0, NotChecked=0, Total=2352 [2022-12-06 06:16:14,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:16:14,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 243 transitions, 5369 flow. Second operand has 49 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:14,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:14,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:16:14,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:16,793 INFO L130 PetriNetUnfolder]: 1084/2108 cut-off events. [2022-12-06 06:16:16,793 INFO L131 PetriNetUnfolder]: For 748506/748506 co-relation queries the response was YES. [2022-12-06 06:16:16,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37729 conditions, 2108 events. 1084/2108 cut-off events. For 748506/748506 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9454 event pairs, 13 based on Foata normal form. 20/2128 useless extension candidates. Maximal degree in co-relation 37578. Up to 534 conditions per place. [2022-12-06 06:16:16,814 INFO L137 encePairwiseOnDemand]: 7/17 looper letters, 132 selfloop transitions, 223 changer transitions 190/545 dead transitions. [2022-12-06 06:16:16,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 545 transitions, 18317 flow [2022-12-06 06:16:16,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-12-06 06:16:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2022-12-06 06:16:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 377 transitions. [2022-12-06 06:16:16,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2549019607843137 [2022-12-06 06:16:16,828 INFO L175 Difference]: Start difference. First operand has 378 places, 243 transitions, 5369 flow. Second operand 87 states and 377 transitions. [2022-12-06 06:16:16,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 545 transitions, 18317 flow [2022-12-06 06:16:17,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 545 transitions, 11884 flow, removed 3070 selfloop flow, removed 74 redundant places. [2022-12-06 06:16:17,731 INFO L231 Difference]: Finished difference. Result has 400 places, 254 transitions, 4002 flow [2022-12-06 06:16:17,732 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=2606, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=4002, PETRI_PLACES=400, PETRI_TRANSITIONS=254} [2022-12-06 06:16:17,732 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 382 predicate places. [2022-12-06 06:16:17,732 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:17,732 INFO L89 Accepts]: Start accepts. Operand has 400 places, 254 transitions, 4002 flow [2022-12-06 06:16:17,746 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:17,746 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:17,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 400 places, 254 transitions, 4002 flow [2022-12-06 06:16:17,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 398 places, 254 transitions, 4002 flow [2022-12-06 06:16:17,863 INFO L130 PetriNetUnfolder]: 224/653 cut-off events. [2022-12-06 06:16:17,863 INFO L131 PetriNetUnfolder]: For 208744/208744 co-relation queries the response was YES. [2022-12-06 06:16:17,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10673 conditions, 653 events. 224/653 cut-off events. For 208744/208744 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2576 event pairs, 0 based on Foata normal form. 0/653 useless extension candidates. Maximal degree in co-relation 10538. Up to 217 conditions per place. [2022-12-06 06:16:17,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 398 places, 254 transitions, 4002 flow [2022-12-06 06:16:17,878 INFO L188 LiptonReduction]: Number of co-enabled transitions 552 [2022-12-06 06:16:17,891 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:16:17,892 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 06:16:17,892 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 250 transitions, 3956 flow [2022-12-06 06:16:17,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:17,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:17,893 INFO L213 CegarLoopForPetriNet]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:17,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 06:16:18,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 06:16:18,098 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:16:18,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:18,099 INFO L85 PathProgramCache]: Analyzing trace with hash 708696108, now seen corresponding path program 2 times [2022-12-06 06:16:18,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:18,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050887174] [2022-12-06 06:16:18,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:18,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:16:18,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:16:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:16:18,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:16:18,185 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:16:18,185 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 06:16:18,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 06:16:18,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 06:16:18,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:16:18,187 INFO L458 BasicCegarLoop]: Path program histogram: [6, 2, 2, 2, 1, 1, 1, 1] [2022-12-06 06:16:18,190 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:16:18,190 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:16:18,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:16:18 BasicIcfg [2022-12-06 06:16:18,272 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:16:18,272 INFO L158 Benchmark]: Toolchain (without parser) took 26251.30ms. Allocated memory was 221.2MB in the beginning and 762.3MB in the end (delta: 541.1MB). Free memory was 196.0MB in the beginning and 532.0MB in the end (delta: -336.0MB). Peak memory consumption was 205.9MB. Max. memory is 8.0GB. [2022-12-06 06:16:18,273 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 221.2MB. Free memory was 197.9MB in the beginning and 197.8MB in the end (delta: 68.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:16:18,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.21ms. Allocated memory is still 221.2MB. Free memory was 196.0MB in the beginning and 175.9MB in the end (delta: 20.1MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 06:16:18,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.41ms. Allocated memory is still 221.2MB. Free memory was 175.9MB in the beginning and 173.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:16:18,273 INFO L158 Benchmark]: Boogie Preprocessor took 30.01ms. Allocated memory is still 221.2MB. Free memory was 173.8MB in the beginning and 172.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:16:18,273 INFO L158 Benchmark]: RCFGBuilder took 349.41ms. Allocated memory is still 221.2MB. Free memory was 172.2MB in the beginning and 159.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 06:16:18,273 INFO L158 Benchmark]: TraceAbstraction took 25405.45ms. Allocated memory was 221.2MB in the beginning and 762.3MB in the end (delta: 541.1MB). Free memory was 159.1MB in the beginning and 532.0MB in the end (delta: -372.9MB). Peak memory consumption was 169.2MB. Max. memory is 8.0GB. [2022-12-06 06:16:18,275 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.11ms. Allocated memory is still 221.2MB. Free memory was 197.9MB in the beginning and 197.8MB in the end (delta: 68.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 414.21ms. Allocated memory is still 221.2MB. Free memory was 196.0MB in the beginning and 175.9MB in the end (delta: 20.1MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.41ms. Allocated memory is still 221.2MB. Free memory was 175.9MB in the beginning and 173.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.01ms. Allocated memory is still 221.2MB. Free memory was 173.8MB in the beginning and 172.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 349.41ms. Allocated memory is still 221.2MB. Free memory was 172.2MB in the beginning and 159.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 25405.45ms. Allocated memory was 221.2MB in the beginning and 762.3MB in the end (delta: 541.1MB). Free memory was 159.1MB in the beginning and 532.0MB in the end (delta: -372.9MB). Peak memory consumption was 169.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 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: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 0, dependent unconditional: 26, 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: 10, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, 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, 34 PlacesBefore, 34 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, 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: 9, independent: 7, independent conditional: 3, independent unconditional: 4, 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: 9, independent: 7, independent conditional: 3, independent unconditional: 4, 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: 9, independent: 7, independent conditional: 3, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 2, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 9, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 12, Positive conditional cache size: 6, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 100 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): 16, Positive cache size: 12, Positive conditional cache size: 6, 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, 48 PlacesBefore, 48 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 110 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): 16, Positive cache size: 12, Positive conditional cache size: 6, 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, 56 PlacesBefore, 56 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 120 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): 17, Positive cache size: 13, Positive conditional cache size: 7, 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, 70 PlacesBefore, 70 PlacesAfterwards, 52 TransitionsBefore, 49 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, 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: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 22, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 19, Positive conditional cache size: 13, Positive unconditional cache size: 6, 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.0s, 91 PlacesBefore, 91 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 186 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): 25, Positive cache size: 19, Positive conditional cache size: 13, Positive unconditional cache size: 6, 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, 117 PlacesBefore, 117 PlacesAfterwards, 99 TransitionsBefore, 98 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 6, 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: 8, independent: 8, independent conditional: 6, 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: 8, independent: 8, independent conditional: 6, 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: 2, independent: 2, independent conditional: 1, 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: 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: 8, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 21, Positive conditional cache size: 14, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 146 PlacesBefore, 147 PlacesAfterwards, 122 TransitionsBefore, 122 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 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: 12, 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: 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 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] ], Cache Queries: [ total: 12, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 28, Positive conditional cache size: 21, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 174 PlacesBefore, 175 PlacesAfterwards, 194 TransitionsBefore, 186 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 44, independent conditional: 44, 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: 46, independent: 44, independent conditional: 44, independent unconditional: 0, 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: 46, independent: 44, independent conditional: 44, independent unconditional: 0, 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: 46, independent: 44, independent conditional: 44, independent unconditional: 0, 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: 22, independent: 22, independent conditional: 22, 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: 22, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 50, Positive conditional cache size: 43, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 226 PlacesBefore, 226 PlacesAfterwards, 169 TransitionsBefore, 169 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 50, Positive conditional cache size: 43, 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.0s, 294 PlacesBefore, 295 PlacesAfterwards, 255 TransitionsBefore, 244 TransitionsAfterwards, 584 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 32, independent unconditional: 8, 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: 40, independent: 40, independent conditional: 32, independent unconditional: 8, 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: 40, independent: 40, independent conditional: 32, independent unconditional: 8, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 21, independent conditional: 13, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 69, Positive conditional cache size: 62, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 377 PlacesBefore, 378 PlacesAfterwards, 251 TransitionsBefore, 243 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 35, independent conditional: 35, 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: 37, independent: 35, independent conditional: 35, independent unconditional: 0, 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: 37, independent: 35, independent conditional: 35, independent unconditional: 0, 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: 37, independent: 35, independent conditional: 35, independent unconditional: 0, 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: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 37, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 93, Positive conditional cache size: 85, Positive unconditional cache size: 8, 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, 398 PlacesBefore, 399 PlacesAfterwards, 254 TransitionsBefore, 250 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 16, 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: 18, independent: 16, independent conditional: 10, independent unconditional: 6, 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: 18, independent: 16, independent conditional: 10, independent unconditional: 6, 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: 18, independent: 16, independent conditional: 10, independent unconditional: 6, 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: 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] , 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: 10, independent conditional: 4, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 99, Positive conditional cache size: 91, Positive unconditional cache size: 8, 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 < 20 [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=1, k=0] [L704] COND TRUE 2 k < 20 [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 < 20 [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=2, k=1] [L704] COND TRUE 2 k < 20 [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 < 20 [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 < 20 [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 < 20 [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 < 20 [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 < 20 [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 < 20 [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 < 20 [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=6, k=5] [L704] COND TRUE 2 k < 20 [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 < 20 [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=7, k=6] [L704] COND TRUE 2 k < 20 [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 < 20 [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 < 20 [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] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=9, k=8] [L716] 0 int condI = i >= (2*20 +6); [L704] COND TRUE 0 k < 20 [L706] 0 j = i + 1 [L704] 0 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 < 20 [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 < 20 [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] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=12, k=11] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=13, k=12] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=14, k=13] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=18, k=17] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=20, k=19] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=20, k=20] [L719] 0 int condJ = j >= (2*20 +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=45, id1={5:0}, id2={3:0}, j=46, k=20, k=20] - 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: 25.2s, OverallIterations: 16, TraceHistogramMax: 20, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5414 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5414 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 798 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3015 IncrementalHoareTripleChecker+Invalid, 3813 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 798 mSolverCounterUnsat, 0 mSDtfsCounter, 3015 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 910 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 640 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17193 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5369occurred in iteration=14, InterpolantAutomatonStates: 429, 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.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 495 NumberOfCodeBlocks, 494 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 614 ConstructedInterpolants, 0 QuantifiedInterpolants, 2437 SizeOfPredicates, 124 NumberOfNonLiveVariables, 1640 ConjunctsInSsa, 183 ConjunctsInUnsatCore, 33 InterpolantComputations, 6 PerfectInterpolantSequences, 15/1992 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-06 06:16:18,308 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...