/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/triangular-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:52:45,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:52:45,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:52:45,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:52:45,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:52:45,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:52:45,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:52:45,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:52:45,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:52:45,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:52:45,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:52:45,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:52:45,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:52:45,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:52:45,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:52:45,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:52:45,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:52:45,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:52:45,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:52:45,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:52:45,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:52:45,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:52:45,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:52:45,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:52:45,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:52:45,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:52:45,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:52:45,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:52:45,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:52:45,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:52:45,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:52:45,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:52:45,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:52:45,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:52:45,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:52:45,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:52:45,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:52:45,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:52:45,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:52:45,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:52:45,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:52:45,922 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 22:52:45,936 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:52:45,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:52:45,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:52:45,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:52:45,937 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:52:45,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:52:45,937 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:52:45,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:52:45,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:52:45,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:52:45,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:52:45,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:52:45,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:52:45,938 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:52:45,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:52:45,938 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:52:45,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:52:45,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:52:45,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:52:45,939 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:52:45,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:52:45,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:52:45,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:52:45,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:52:45,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:52:45,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:52:45,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:52:45,939 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:52:45,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 22:52:46,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:52:46,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:52:46,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:52:46,154 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:52:46,154 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:52:46,155 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-1.i [2022-12-05 22:52:47,165 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:52:47,350 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:52:47,350 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-1.i [2022-12-05 22:52:47,359 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cb2d54a1/86f0b226c25648d1a13ebdd2bc496ca1/FLAG462c7f8eb [2022-12-05 22:52:47,372 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cb2d54a1/86f0b226c25648d1a13ebdd2bc496ca1 [2022-12-05 22:52:47,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:52:47,375 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:52:47,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:52:47,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:52:47,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:52:47,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:52:47" (1/1) ... [2022-12-05 22:52:47,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db9b2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:47, skipping insertion in model container [2022-12-05 22:52:47,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:52:47" (1/1) ... [2022-12-05 22:52:47,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:52:47,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:52:47,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:47,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:47,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:47,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:47,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:47,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:47,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:47,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:47,641 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-1.i[30950,30963] [2022-12-05 22:52:47,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:52:47,651 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:52:47,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:47,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:47,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:47,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:47,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:47,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:47,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:52:47,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:52:47,683 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-1.i[30950,30963] [2022-12-05 22:52:47,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:52:47,709 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:52:47,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:47 WrapperNode [2022-12-05 22:52:47,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:52:47,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:52:47,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:52:47,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:52:47,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:47" (1/1) ... [2022-12-05 22:52:47,742 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:47" (1/1) ... [2022-12-05 22:52:47,759 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-12-05 22:52:47,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:52:47,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:52:47,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:52:47,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:52:47,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:47" (1/1) ... [2022-12-05 22:52:47,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:47" (1/1) ... [2022-12-05 22:52:47,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:47" (1/1) ... [2022-12-05 22:52:47,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:47" (1/1) ... [2022-12-05 22:52:47,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:47" (1/1) ... [2022-12-05 22:52:47,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:47" (1/1) ... [2022-12-05 22:52:47,787 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:47" (1/1) ... [2022-12-05 22:52:47,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:47" (1/1) ... [2022-12-05 22:52:47,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:52:47,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:52:47,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:52:47,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:52:47,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:47" (1/1) ... [2022-12-05 22:52:47,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:52:47,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:47,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 22:52:47,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 22:52:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-05 22:52:47,888 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-05 22:52:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-05 22:52:47,889 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-05 22:52:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:52:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:52:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:52:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:52:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:52:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:52:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:52:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:52:47,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:52:47,890 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 22:52:47,980 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:52:47,981 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:52:48,086 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:52:48,091 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:52:48,091 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-05 22:52:48,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:52:48 BoogieIcfgContainer [2022-12-05 22:52:48,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:52:48,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:52:48,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:52:48,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:52:48,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:52:47" (1/3) ... [2022-12-05 22:52:48,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e467f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:52:48, skipping insertion in model container [2022-12-05 22:52:48,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:52:47" (2/3) ... [2022-12-05 22:52:48,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e467f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:52:48, skipping insertion in model container [2022-12-05 22:52:48,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:52:48" (3/3) ... [2022-12-05 22:52:48,098 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-1.i [2022-12-05 22:52:48,109 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:52:48,110 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 22:52:48,110 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:52:48,164 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:52:48,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 66 transitions, 142 flow [2022-12-05 22:52:48,213 INFO L130 PetriNetUnfolder]: 5/64 cut-off events. [2022-12-05 22:52:48,213 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:52:48,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 64 events. 5/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-12-05 22:52:48,216 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 66 transitions, 142 flow [2022-12-05 22:52:48,219 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 64 transitions, 134 flow [2022-12-05 22:52:48,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:48,233 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 64 transitions, 134 flow [2022-12-05 22:52:48,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 64 transitions, 134 flow [2022-12-05 22:52:48,248 INFO L130 PetriNetUnfolder]: 5/64 cut-off events. [2022-12-05 22:52:48,248 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:52:48,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 64 events. 5/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-12-05 22:52:48,250 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 64 transitions, 134 flow [2022-12-05 22:52:48,250 INFO L188 LiptonReduction]: Number of co-enabled transitions 1078 [2022-12-05 22:52:50,125 INFO L203 LiptonReduction]: Total number of compositions: 51 [2022-12-05 22:52:50,138 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:52:50,142 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;@6194af7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:52:50,143 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-05 22:52:50,145 INFO L130 PetriNetUnfolder]: 2/11 cut-off events. [2022-12-05 22:52:50,145 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:52:50,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:50,146 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 22:52:50,146 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:50,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:50,154 INFO L85 PathProgramCache]: Analyzing trace with hash -977143138, now seen corresponding path program 1 times [2022-12-05 22:52:50,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:50,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312987381] [2022-12-05 22:52:50,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:50,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:50,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:50,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312987381] [2022-12-05 22:52:50,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312987381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:50,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:50,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:52:50,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119347886] [2022-12-05 22:52:50,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:50,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:52:50,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:50,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:52:50,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:52:50,504 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:50,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 32 flow. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:50,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:50,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:50,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:50,590 INFO L130 PetriNetUnfolder]: 94/152 cut-off events. [2022-12-05 22:52:50,590 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 22:52:50,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 152 events. 94/152 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 395 event pairs, 11 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 306. Up to 76 conditions per place. [2022-12-05 22:52:50,594 INFO L137 encePairwiseOnDemand]: 9/13 looper letters, 18 selfloop transitions, 4 changer transitions 4/26 dead transitions. [2022-12-05 22:52:50,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 26 transitions, 110 flow [2022-12-05 22:52:50,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:52:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:52:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-05 22:52:50,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2022-12-05 22:52:50,604 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 32 flow. Second operand 4 states and 27 transitions. [2022-12-05 22:52:50,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 26 transitions, 110 flow [2022-12-05 22:52:50,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:52:50,608 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 53 flow [2022-12-05 22:52:50,609 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=53, PETRI_PLACES=21, PETRI_TRANSITIONS=15} [2022-12-05 22:52:50,614 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2022-12-05 22:52:50,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:50,614 INFO L89 Accepts]: Start accepts. Operand has 21 places, 15 transitions, 53 flow [2022-12-05 22:52:50,617 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:50,617 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:50,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 15 transitions, 53 flow [2022-12-05 22:52:50,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 15 transitions, 53 flow [2022-12-05 22:52:50,624 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-05 22:52:50,624 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 22:52:50,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 18 events. 4/18 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 28. Up to 5 conditions per place. [2022-12-05 22:52:50,624 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 15 transitions, 53 flow [2022-12-05 22:52:50,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-05 22:52:50,635 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 16 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_~i~0_20 1) v_~j~0_26) (< v_t2Thread1of1ForFork1_~k~1_34 5)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-05 22:52:50,656 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:52:50,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-05 22:52:50,659 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 14 transitions, 51 flow [2022-12-05 22:52:50,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:50,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:50,662 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:50,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:52:50,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:50,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:50,670 INFO L85 PathProgramCache]: Analyzing trace with hash -226702759, now seen corresponding path program 1 times [2022-12-05 22:52:50,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:50,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088185212] [2022-12-05 22:52:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:50,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:50,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:50,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088185212] [2022-12-05 22:52:50,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088185212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:50,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:50,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:52:50,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716566885] [2022-12-05 22:52:50,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:50,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:52:50,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:50,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:52:50,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:52:50,793 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:50,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 14 transitions, 51 flow. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:50,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:50,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:50,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:50,874 INFO L130 PetriNetUnfolder]: 91/157 cut-off events. [2022-12-05 22:52:50,874 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-12-05 22:52:50,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 157 events. 91/157 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 450 event pairs, 32 based on Foata normal form. 10/141 useless extension candidates. Maximal degree in co-relation 390. Up to 69 conditions per place. [2022-12-05 22:52:50,875 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 26 selfloop transitions, 5 changer transitions 3/34 dead transitions. [2022-12-05 22:52:50,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 34 transitions, 181 flow [2022-12-05 22:52:50,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:52:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:52:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-12-05 22:52:50,880 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5230769230769231 [2022-12-05 22:52:50,880 INFO L175 Difference]: Start difference. First operand has 19 places, 14 transitions, 51 flow. Second operand 5 states and 34 transitions. [2022-12-05 22:52:50,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 34 transitions, 181 flow [2022-12-05 22:52:50,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 34 transitions, 173 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 22:52:50,882 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 91 flow [2022-12-05 22:52:50,882 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2022-12-05 22:52:50,883 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-05 22:52:50,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:50,883 INFO L89 Accepts]: Start accepts. Operand has 25 places, 18 transitions, 91 flow [2022-12-05 22:52:50,884 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:50,884 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:50,884 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 18 transitions, 91 flow [2022-12-05 22:52:50,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 18 transitions, 91 flow [2022-12-05 22:52:50,889 INFO L130 PetriNetUnfolder]: 11/32 cut-off events. [2022-12-05 22:52:50,889 INFO L131 PetriNetUnfolder]: For 18/19 co-relation queries the response was YES. [2022-12-05 22:52:50,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 32 events. 11/32 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 75. Up to 10 conditions per place. [2022-12-05 22:52:50,890 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 18 transitions, 91 flow [2022-12-05 22:52:50,890 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-05 22:52:50,892 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:52:50,893 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-05 22:52:50,894 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 91 flow [2022-12-05 22:52:50,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:50,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:50,894 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:50,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 22:52:50,895 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:50,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:50,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1562125437, now seen corresponding path program 1 times [2022-12-05 22:52:50,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:50,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755210609] [2022-12-05 22:52:50,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:50,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:50,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:50,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755210609] [2022-12-05 22:52:50,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755210609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:50,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:50,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:52:50,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53820593] [2022-12-05 22:52:50,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:50,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:52:50,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:50,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:52:50,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:52:50,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:50,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 91 flow. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:50,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:50,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:50,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:51,089 INFO L130 PetriNetUnfolder]: 91/159 cut-off events. [2022-12-05 22:52:51,090 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-05 22:52:51,092 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-05 22:52:51,095 INFO L137 encePairwiseOnDemand]: 7/13 looper letters, 24 selfloop transitions, 12 changer transitions 8/44 dead transitions. [2022-12-05 22:52:51,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 44 transitions, 270 flow [2022-12-05 22:52:51,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 22:52:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 22:52:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-12-05 22:52:51,097 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4725274725274725 [2022-12-05 22:52:51,097 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 91 flow. Second operand 7 states and 43 transitions. [2022-12-05 22:52:51,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 44 transitions, 270 flow [2022-12-05 22:52:51,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 44 transitions, 263 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-05 22:52:51,100 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 171 flow [2022-12-05 22:52:51,100 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-05 22:52:51,101 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 16 predicate places. [2022-12-05 22:52:51,101 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:51,101 INFO L89 Accepts]: Start accepts. Operand has 34 places, 25 transitions, 171 flow [2022-12-05 22:52:51,102 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:51,102 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:51,102 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 171 flow [2022-12-05 22:52:51,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 171 flow [2022-12-05 22:52:51,107 INFO L130 PetriNetUnfolder]: 16/42 cut-off events. [2022-12-05 22:52:51,107 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-05 22:52:51,108 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-05 22:52:51,108 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 171 flow [2022-12-05 22:52:51,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-05 22:52:51,126 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:52:51,127 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-05 22:52:51,127 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 163 flow [2022-12-05 22:52:51,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:51,127 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:51,127 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:51,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 22:52:51,128 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:51,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:51,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1436153506, now seen corresponding path program 1 times [2022-12-05 22:52:51,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:51,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164220393] [2022-12-05 22:52:51,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:51,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:51,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:51,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164220393] [2022-12-05 22:52:51,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164220393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:51,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:51,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:52:51,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001864168] [2022-12-05 22:52:51,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:51,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:52:51,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:51,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:52:51,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:52:51,191 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:51,191 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-05 22:52:51,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:51,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:51,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:51,245 INFO L130 PetriNetUnfolder]: 115/203 cut-off events. [2022-12-05 22:52:51,245 INFO L131 PetriNetUnfolder]: For 453/453 co-relation queries the response was YES. [2022-12-05 22:52:51,246 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-05 22:52:51,247 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 27 selfloop transitions, 12 changer transitions 4/43 dead transitions. [2022-12-05 22:52:51,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 339 flow [2022-12-05 22:52:51,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:52:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:52:51,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-12-05 22:52:51,249 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2022-12-05 22:52:51,249 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 163 flow. Second operand 6 states and 35 transitions. [2022-12-05 22:52:51,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 339 flow [2022-12-05 22:52:51,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 331 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-05 22:52:51,255 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 224 flow [2022-12-05 22:52:51,255 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-05 22:52:51,256 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 24 predicate places. [2022-12-05 22:52:51,256 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:51,256 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 224 flow [2022-12-05 22:52:51,257 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:51,257 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:51,257 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 224 flow [2022-12-05 22:52:51,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 27 transitions, 224 flow [2022-12-05 22:52:51,272 INFO L130 PetriNetUnfolder]: 19/53 cut-off events. [2022-12-05 22:52:51,272 INFO L131 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2022-12-05 22:52:51,273 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-05 22:52:51,273 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 27 transitions, 224 flow [2022-12-05 22:52:51,273 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-05 22:52:51,277 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:52:51,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-05 22:52:51,282 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 224 flow [2022-12-05 22:52:51,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:51,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:51,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:51,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 22:52:51,282 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:51,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:51,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1617536060, now seen corresponding path program 1 times [2022-12-05 22:52:51,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:51,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898679084] [2022-12-05 22:52:51,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:51,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:51,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:51,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898679084] [2022-12-05 22:52:51,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898679084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:51,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:51,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:52:51,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548308516] [2022-12-05 22:52:51,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:51,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:52:51,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:51,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:52:51,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:52:51,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:51,349 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-05 22:52:51,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:51,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:51,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:51,408 INFO L130 PetriNetUnfolder]: 111/199 cut-off events. [2022-12-05 22:52:51,408 INFO L131 PetriNetUnfolder]: For 765/765 co-relation queries the response was YES. [2022-12-05 22:52:51,409 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-05 22:52:51,409 INFO L137 encePairwiseOnDemand]: 7/13 looper letters, 21 selfloop transitions, 17 changer transitions 6/44 dead transitions. [2022-12-05 22:52:51,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 403 flow [2022-12-05 22:52:51,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:52:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:52:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-12-05 22:52:51,410 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2022-12-05 22:52:51,410 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 224 flow. Second operand 6 states and 34 transitions. [2022-12-05 22:52:51,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 403 flow [2022-12-05 22:52:51,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 369 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-05 22:52:51,412 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 285 flow [2022-12-05 22:52:51,413 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-05 22:52:51,413 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 30 predicate places. [2022-12-05 22:52:51,413 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:51,413 INFO L89 Accepts]: Start accepts. Operand has 48 places, 30 transitions, 285 flow [2022-12-05 22:52:51,414 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:51,414 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:51,414 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 30 transitions, 285 flow [2022-12-05 22:52:51,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 30 transitions, 285 flow [2022-12-05 22:52:51,418 INFO L130 PetriNetUnfolder]: 19/54 cut-off events. [2022-12-05 22:52:51,418 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2022-12-05 22:52:51,418 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-05 22:52:51,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 30 transitions, 285 flow [2022-12-05 22:52:51,418 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-05 22:52:51,419 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:52:51,420 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-05 22:52:51,420 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 285 flow [2022-12-05 22:52:51,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:51,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:51,420 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:51,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 22:52:51,420 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:51,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:51,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1571201197, now seen corresponding path program 1 times [2022-12-05 22:52:51,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:51,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567270849] [2022-12-05 22:52:51,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:51,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:51,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:51,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567270849] [2022-12-05 22:52:51,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567270849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:51,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:52:51,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:52:51,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219264264] [2022-12-05 22:52:51,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:51,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:52:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:51,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:52:51,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:52:51,480 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:52:51,480 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-05 22:52:51,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:51,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:52:51,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:51,552 INFO L130 PetriNetUnfolder]: 129/235 cut-off events. [2022-12-05 22:52:51,552 INFO L131 PetriNetUnfolder]: For 1059/1059 co-relation queries the response was YES. [2022-12-05 22:52:51,553 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-05 22:52:51,554 INFO L137 encePairwiseOnDemand]: 7/13 looper letters, 33 selfloop transitions, 13 changer transitions 11/57 dead transitions. [2022-12-05 22:52:51,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 549 flow [2022-12-05 22:52:51,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 22:52:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 22:52:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-12-05 22:52:51,554 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4423076923076923 [2022-12-05 22:52:51,554 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 285 flow. Second operand 8 states and 46 transitions. [2022-12-05 22:52:51,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 549 flow [2022-12-05 22:52:51,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 57 transitions, 485 flow, removed 23 selfloop flow, removed 3 redundant places. [2022-12-05 22:52:51,557 INFO L231 Difference]: Finished difference. Result has 56 places, 35 transitions, 345 flow [2022-12-05 22:52:51,557 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-05 22:52:51,558 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 38 predicate places. [2022-12-05 22:52:51,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:51,558 INFO L89 Accepts]: Start accepts. Operand has 56 places, 35 transitions, 345 flow [2022-12-05 22:52:51,558 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:51,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:51,559 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 35 transitions, 345 flow [2022-12-05 22:52:51,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 35 transitions, 345 flow [2022-12-05 22:52:51,563 INFO L130 PetriNetUnfolder]: 23/65 cut-off events. [2022-12-05 22:52:51,563 INFO L131 PetriNetUnfolder]: For 226/226 co-relation queries the response was YES. [2022-12-05 22:52:51,564 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-05 22:52:51,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 35 transitions, 345 flow [2022-12-05 22:52:51,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-05 22:52:51,569 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 16 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 5)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-05 22:52:51,586 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 16 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_~i~0_20 1) v_~j~0_26) (< v_t2Thread1of1ForFork1_~k~1_34 5)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-05 22:52:51,606 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:52:51,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-05 22:52:51,607 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 35 transitions, 359 flow [2022-12-05 22:52:51,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:51,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:51,607 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:51,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 22:52:51,607 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:51,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:51,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1458297736, now seen corresponding path program 2 times [2022-12-05 22:52:51,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:51,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139540631] [2022-12-05 22:52:51,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:51,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:51,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:51,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139540631] [2022-12-05 22:52:51,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139540631] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:51,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114572927] [2022-12-05 22:52:51,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:52:51,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:51,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:51,665 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:52:51,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-05 22:52:51,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:52:51,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:52:51,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-05 22:52:51,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:51,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:52:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:51,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114572927] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:52:51,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:52:51,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-05 22:52:51,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761955633] [2022-12-05 22:52:51,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:52:51,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 22:52:51,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:51,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 22:52:51,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-05 22:52:51,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 22:52:51,870 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-05 22:52:51,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:51,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 22:52:51,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:52,084 INFO L130 PetriNetUnfolder]: 185/331 cut-off events. [2022-12-05 22:52:52,084 INFO L131 PetriNetUnfolder]: For 1491/1491 co-relation queries the response was YES. [2022-12-05 22:52:52,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 331 events. 185/331 cut-off events. For 1491/1491 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1163 event pairs, 20 based on Foata normal form. 16/347 useless extension candidates. Maximal degree in co-relation 1450. Up to 79 conditions per place. [2022-12-05 22:52:52,086 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 28 selfloop transitions, 35 changer transitions 21/84 dead transitions. [2022-12-05 22:52:52,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 84 transitions, 840 flow [2022-12-05 22:52:52,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 22:52:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 22:52:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 70 transitions. [2022-12-05 22:52:52,087 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.358974358974359 [2022-12-05 22:52:52,087 INFO L175 Difference]: Start difference. First operand has 56 places, 35 transitions, 359 flow. Second operand 13 states and 70 transitions. [2022-12-05 22:52:52,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 84 transitions, 840 flow [2022-12-05 22:52:52,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 794 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-05 22:52:52,091 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 629 flow [2022-12-05 22:52:52,092 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=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=629, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2022-12-05 22:52:52,092 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 52 predicate places. [2022-12-05 22:52:52,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:52,092 INFO L89 Accepts]: Start accepts. Operand has 70 places, 52 transitions, 629 flow [2022-12-05 22:52:52,093 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:52,093 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:52,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 52 transitions, 629 flow [2022-12-05 22:52:52,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 52 transitions, 629 flow [2022-12-05 22:52:52,100 INFO L130 PetriNetUnfolder]: 36/97 cut-off events. [2022-12-05 22:52:52,100 INFO L131 PetriNetUnfolder]: For 493/493 co-relation queries the response was YES. [2022-12-05 22:52:52,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 97 events. 36/97 cut-off events. For 493/493 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 298 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 474. Up to 33 conditions per place. [2022-12-05 22:52:52,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 52 transitions, 629 flow [2022-12-05 22:52:52,102 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-05 22:52:52,132 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:52:52,132 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-05 22:52:52,132 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 595 flow [2022-12-05 22:52:52,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:52,132 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:52,133 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:52,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-05 22:52:52,337 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-05 22:52:52,338 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:52,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:52,338 INFO L85 PathProgramCache]: Analyzing trace with hash 531828353, now seen corresponding path program 1 times [2022-12-05 22:52:52,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:52,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342740548] [2022-12-05 22:52:52,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:52,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:52,413 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-05 22:52:52,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:52,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342740548] [2022-12-05 22:52:52,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342740548] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:52,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883998676] [2022-12-05 22:52:52,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:52,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:52,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:52,415 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:52:52,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-05 22:52:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:52,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-05 22:52:52,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:52,511 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-05 22:52:52,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:52:52,594 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-05 22:52:52,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883998676] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:52:52,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:52:52,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-05 22:52:52,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568272303] [2022-12-05 22:52:52,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:52:52,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-05 22:52:52,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:52,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-05 22:52:52,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-05 22:52:52,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 22:52:52,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 595 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-05 22:52:52,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:52,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 22:52:52,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:52,861 INFO L130 PetriNetUnfolder]: 238/450 cut-off events. [2022-12-05 22:52:52,861 INFO L131 PetriNetUnfolder]: For 3575/3575 co-relation queries the response was YES. [2022-12-05 22:52:52,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 450 events. 238/450 cut-off events. For 3575/3575 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1745 event pairs, 40 based on Foata normal form. 32/482 useless extension candidates. Maximal degree in co-relation 2247. Up to 155 conditions per place. [2022-12-05 22:52:52,864 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 56 selfloop transitions, 37 changer transitions 32/125 dead transitions. [2022-12-05 22:52:52,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 1450 flow [2022-12-05 22:52:52,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-05 22:52:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-05 22:52:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 97 transitions. [2022-12-05 22:52:52,865 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34035087719298246 [2022-12-05 22:52:52,865 INFO L175 Difference]: Start difference. First operand has 69 places, 49 transitions, 595 flow. Second operand 19 states and 97 transitions. [2022-12-05 22:52:52,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 1450 flow [2022-12-05 22:52:52,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 125 transitions, 1101 flow, removed 156 selfloop flow, removed 7 redundant places. [2022-12-05 22:52:52,874 INFO L231 Difference]: Finished difference. Result has 92 places, 67 transitions, 764 flow [2022-12-05 22:52:52,874 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=62, 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=764, PETRI_PLACES=92, PETRI_TRANSITIONS=67} [2022-12-05 22:52:52,874 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 74 predicate places. [2022-12-05 22:52:52,874 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:52,874 INFO L89 Accepts]: Start accepts. Operand has 92 places, 67 transitions, 764 flow [2022-12-05 22:52:52,875 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:52,875 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:52,876 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 67 transitions, 764 flow [2022-12-05 22:52:52,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 67 transitions, 764 flow [2022-12-05 22:52:52,886 INFO L130 PetriNetUnfolder]: 51/148 cut-off events. [2022-12-05 22:52:52,886 INFO L131 PetriNetUnfolder]: For 1363/1363 co-relation queries the response was YES. [2022-12-05 22:52:52,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 148 events. 51/148 cut-off events. For 1363/1363 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 531 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 769. Up to 51 conditions per place. [2022-12-05 22:52:52,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 67 transitions, 764 flow [2022-12-05 22:52:52,888 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-05 22:52:52,888 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:52:52,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-05 22:52:52,889 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 67 transitions, 764 flow [2022-12-05 22:52:52,889 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-05 22:52:52,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:52,889 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:52,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-05 22:52:53,093 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-05 22:52:53,095 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:53,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:53,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1259191637, now seen corresponding path program 2 times [2022-12-05 22:52:53,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:53,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060812603] [2022-12-05 22:52:53,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:53,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:53,174 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-05 22:52:53,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:53,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060812603] [2022-12-05 22:52:53,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060812603] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:53,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594105223] [2022-12-05 22:52:53,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:52:53,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:53,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:53,176 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:52:53,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-05 22:52:53,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:52:53,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:52:53,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-05 22:52:53,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:53,255 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-05 22:52:53,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:52:53,380 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-05 22:52:53,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594105223] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:52:53,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:52:53,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-05 22:52:53,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270064220] [2022-12-05 22:52:53,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:52:53,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-05 22:52:53,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:53,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-05 22:52:53,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-12-05 22:52:53,381 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 22:52:53,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 67 transitions, 764 flow. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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-05 22:52:53,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:53,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 22:52:53,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:53,712 INFO L130 PetriNetUnfolder]: 338/650 cut-off events. [2022-12-05 22:52:53,712 INFO L131 PetriNetUnfolder]: For 9430/9430 co-relation queries the response was YES. [2022-12-05 22:52:53,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3554 conditions, 650 events. 338/650 cut-off events. For 9430/9430 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2893 event pairs, 39 based on Foata normal form. 24/674 useless extension candidates. Maximal degree in co-relation 3508. Up to 163 conditions per place. [2022-12-05 22:52:53,729 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 44 selfloop transitions, 67 changer transitions 29/140 dead transitions. [2022-12-05 22:52:53,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 140 transitions, 1751 flow [2022-12-05 22:52:53,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 22:52:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 22:52:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 85 transitions. [2022-12-05 22:52:53,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-05 22:52:53,740 INFO L175 Difference]: Start difference. First operand has 92 places, 67 transitions, 764 flow. Second operand 17 states and 85 transitions. [2022-12-05 22:52:53,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 140 transitions, 1751 flow [2022-12-05 22:52:53,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 140 transitions, 1581 flow, removed 73 selfloop flow, removed 6 redundant places. [2022-12-05 22:52:53,779 INFO L231 Difference]: Finished difference. Result has 112 places, 93 transitions, 1245 flow [2022-12-05 22:52:53,779 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=648, 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=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1245, PETRI_PLACES=112, PETRI_TRANSITIONS=93} [2022-12-05 22:52:53,780 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 94 predicate places. [2022-12-05 22:52:53,780 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:53,780 INFO L89 Accepts]: Start accepts. Operand has 112 places, 93 transitions, 1245 flow [2022-12-05 22:52:53,781 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:53,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:53,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 93 transitions, 1245 flow [2022-12-05 22:52:53,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 93 transitions, 1245 flow [2022-12-05 22:52:53,803 INFO L130 PetriNetUnfolder]: 78/224 cut-off events. [2022-12-05 22:52:53,804 INFO L131 PetriNetUnfolder]: For 4519/4519 co-relation queries the response was YES. [2022-12-05 22:52:53,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1552 conditions, 224 events. 78/224 cut-off events. For 4519/4519 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 920 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 1499. Up to 76 conditions per place. [2022-12-05 22:52:53,806 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 93 transitions, 1245 flow [2022-12-05 22:52:53,806 INFO L188 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-05 22:52:53,811 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 16 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 5)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-05 22:52:53,848 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L714-4-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_25| (ite (< 16 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_~i~0_20 1) v_~j~0_26) (< v_t2Thread1of1ForFork1_~k~1_34 5)) InVars {~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_34} OutVars{~j~0=v_~j~0_26, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_15|, ~i~0=v_~i~0_20, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~k~1] [2022-12-05 22:52:53,883 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:52:53,883 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-05 22:52:53,883 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 92 transitions, 1247 flow [2022-12-05 22:52:53,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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-05 22:52:53,883 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:53,884 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:53,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-05 22:52:54,084 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-05 22:52:54,085 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:54,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:54,085 INFO L85 PathProgramCache]: Analyzing trace with hash -835740951, now seen corresponding path program 3 times [2022-12-05 22:52:54,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:54,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250909] [2022-12-05 22:52:54,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:54,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:54,160 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-05 22:52:54,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:54,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250909] [2022-12-05 22:52:54,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250909] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:54,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322613284] [2022-12-05 22:52:54,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 22:52:54,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:54,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:54,175 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:52:54,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-05 22:52:54,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-05 22:52:54,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:52:54,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-05 22:52:54,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:54,302 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-05 22:52:54,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:52:54,362 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-05 22:52:54,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322613284] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:52:54,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:52:54,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-05 22:52:54,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965859910] [2022-12-05 22:52:54,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:52:54,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-05 22:52:54,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:54,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-05 22:52:54,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-12-05 22:52:54,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 22:52:54,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 92 transitions, 1247 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-05 22:52:54,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:54,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 22:52:54,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:54,892 INFO L130 PetriNetUnfolder]: 542/1030 cut-off events. [2022-12-05 22:52:54,892 INFO L131 PetriNetUnfolder]: For 27392/27392 co-relation queries the response was YES. [2022-12-05 22:52:54,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6868 conditions, 1030 events. 542/1030 cut-off events. For 27392/27392 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5266 event pairs, 26 based on Foata normal form. 32/1062 useless extension candidates. Maximal degree in co-relation 6812. Up to 253 conditions per place. [2022-12-05 22:52:54,898 INFO L137 encePairwiseOnDemand]: 7/17 looper letters, 56 selfloop transitions, 89 changer transitions 72/217 dead transitions. [2022-12-05 22:52:54,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 217 transitions, 3166 flow [2022-12-05 22:52:54,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-05 22:52:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-05 22:52:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 129 transitions. [2022-12-05 22:52:54,900 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3035294117647059 [2022-12-05 22:52:54,900 INFO L175 Difference]: Start difference. First operand has 112 places, 92 transitions, 1247 flow. Second operand 25 states and 129 transitions. [2022-12-05 22:52:54,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 217 transitions, 3166 flow [2022-12-05 22:52:54,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 217 transitions, 2865 flow, removed 129 selfloop flow, removed 7 redundant places. [2022-12-05 22:52:54,940 INFO L231 Difference]: Finished difference. Result has 143 places, 108 transitions, 1767 flow [2022-12-05 22:52:54,940 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1767, PETRI_PLACES=143, PETRI_TRANSITIONS=108} [2022-12-05 22:52:54,941 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 125 predicate places. [2022-12-05 22:52:54,941 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:54,941 INFO L89 Accepts]: Start accepts. Operand has 143 places, 108 transitions, 1767 flow [2022-12-05 22:52:54,943 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:54,944 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:54,944 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 108 transitions, 1767 flow [2022-12-05 22:52:54,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 108 transitions, 1767 flow [2022-12-05 22:52:54,966 INFO L130 PetriNetUnfolder]: 93/259 cut-off events. [2022-12-05 22:52:54,966 INFO L131 PetriNetUnfolder]: For 11700/11700 co-relation queries the response was YES. [2022-12-05 22:52:54,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2417 conditions, 259 events. 93/259 cut-off events. For 11700/11700 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1163 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 2352. Up to 85 conditions per place. [2022-12-05 22:52:54,970 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 108 transitions, 1767 flow [2022-12-05 22:52:54,970 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-05 22:52:54,979 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:52:54,980 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-05 22:52:54,980 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 106 transitions, 1751 flow [2022-12-05 22:52:54,980 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-05 22:52:54,980 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:54,980 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:54,985 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-05 22:52:55,185 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-05 22:52:55,185 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:55,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:55,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1827625191, now seen corresponding path program 4 times [2022-12-05 22:52:55,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:55,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848887570] [2022-12-05 22:52:55,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:55,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:55,300 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-05 22:52:55,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:55,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848887570] [2022-12-05 22:52:55,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848887570] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:55,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474312306] [2022-12-05 22:52:55,301 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 22:52:55,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:55,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:55,317 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:52:55,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-05 22:52:55,368 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 22:52:55,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:52:55,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 22:52:55,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:55,408 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-05 22:52:55,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:52:55,527 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-05 22:52:55,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474312306] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:52:55,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:52:55,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-12-05 22:52:55,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855162984] [2022-12-05 22:52:55,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:52:55,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-05 22:52:55,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:55,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-05 22:52:55,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2022-12-05 22:52:55,529 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-05 22:52:55,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 106 transitions, 1751 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-05 22:52:55,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:55,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-05 22:52:55,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:55,985 INFO L130 PetriNetUnfolder]: 634/1190 cut-off events. [2022-12-05 22:52:55,985 INFO L131 PetriNetUnfolder]: For 56292/56292 co-relation queries the response was YES. [2022-12-05 22:52:55,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10609 conditions, 1190 events. 634/1190 cut-off events. For 56292/56292 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6001 event pairs, 41 based on Foata normal form. 20/1210 useless extension candidates. Maximal degree in co-relation 10541. Up to 287 conditions per place. [2022-12-05 22:52:55,992 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 54 selfloop transitions, 92 changer transitions 71/217 dead transitions. [2022-12-05 22:52:55,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 217 transitions, 4383 flow [2022-12-05 22:52:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-05 22:52:55,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-05 22:52:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 108 transitions. [2022-12-05 22:52:55,994 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2022-12-05 22:52:55,994 INFO L175 Difference]: Start difference. First operand has 143 places, 106 transitions, 1751 flow. Second operand 22 states and 108 transitions. [2022-12-05 22:52:55,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 217 transitions, 4383 flow [2022-12-05 22:52:56,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 217 transitions, 3262 flow, removed 511 selfloop flow, removed 22 redundant places. [2022-12-05 22:52:56,073 INFO L231 Difference]: Finished difference. Result has 149 places, 125 transitions, 2060 flow [2022-12-05 22:52:56,073 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2060, PETRI_PLACES=149, PETRI_TRANSITIONS=125} [2022-12-05 22:52:56,073 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 131 predicate places. [2022-12-05 22:52:56,073 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:56,073 INFO L89 Accepts]: Start accepts. Operand has 149 places, 125 transitions, 2060 flow [2022-12-05 22:52:56,075 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:56,076 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:56,076 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 125 transitions, 2060 flow [2022-12-05 22:52:56,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 125 transitions, 2060 flow [2022-12-05 22:52:56,100 INFO L130 PetriNetUnfolder]: 105/289 cut-off events. [2022-12-05 22:52:56,100 INFO L131 PetriNetUnfolder]: For 16210/16210 co-relation queries the response was YES. [2022-12-05 22:52:56,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2809 conditions, 289 events. 105/289 cut-off events. For 16210/16210 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1238 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 2743. Up to 96 conditions per place. [2022-12-05 22:52:56,104 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 125 transitions, 2060 flow [2022-12-05 22:52:56,104 INFO L188 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-05 22:52:56,110 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:52:56,111 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-05 22:52:56,111 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 124 transitions, 2050 flow [2022-12-05 22:52:56,111 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-05 22:52:56,111 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:56,111 INFO L213 CegarLoopForPetriNet]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:56,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-05 22:52:56,316 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-05 22:52:56,316 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:56,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:56,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1048217271, now seen corresponding path program 1 times [2022-12-05 22:52:56,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:56,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282953366] [2022-12-05 22:52:56,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:56,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:56,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:56,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282953366] [2022-12-05 22:52:56,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282953366] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:56,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883100399] [2022-12-05 22:52:56,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:56,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:56,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:56,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:52:56,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-05 22:52:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:56,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-05 22:52:56,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:56,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:52:56,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883100399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:56,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:52:56,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2022-12-05 22:52:56,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332892798] [2022-12-05 22:52:56,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:56,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 22:52:56,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:56,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 22:52:56,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-12-05 22:52:56,432 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 22:52:56,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 124 transitions, 2050 flow. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:56,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:56,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 22:52:56,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:56,658 INFO L130 PetriNetUnfolder]: 846/1513 cut-off events. [2022-12-05 22:52:56,658 INFO L131 PetriNetUnfolder]: For 69679/69679 co-relation queries the response was YES. [2022-12-05 22:52:56,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10722 conditions, 1513 events. 846/1513 cut-off events. For 69679/69679 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8030 event pairs, 45 based on Foata normal form. 178/1691 useless extension candidates. Maximal degree in co-relation 10653. Up to 1008 conditions per place. [2022-12-05 22:52:56,665 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 35 selfloop transitions, 14 changer transitions 213/262 dead transitions. [2022-12-05 22:52:56,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 262 transitions, 4419 flow [2022-12-05 22:52:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 22:52:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 22:52:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-12-05 22:52:56,666 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-05 22:52:56,666 INFO L175 Difference]: Start difference. First operand has 149 places, 124 transitions, 2050 flow. Second operand 8 states and 52 transitions. [2022-12-05 22:52:56,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 262 transitions, 4419 flow [2022-12-05 22:52:56,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 262 transitions, 3531 flow, removed 326 selfloop flow, removed 21 redundant places. [2022-12-05 22:52:56,756 INFO L231 Difference]: Finished difference. Result has 138 places, 39 transitions, 477 flow [2022-12-05 22:52:56,757 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=477, PETRI_PLACES=138, PETRI_TRANSITIONS=39} [2022-12-05 22:52:56,757 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 120 predicate places. [2022-12-05 22:52:56,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:56,757 INFO L89 Accepts]: Start accepts. Operand has 138 places, 39 transitions, 477 flow [2022-12-05 22:52:56,758 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:56,758 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:56,758 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 39 transitions, 477 flow [2022-12-05 22:52:56,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 39 transitions, 477 flow [2022-12-05 22:52:56,765 INFO L130 PetriNetUnfolder]: 15/68 cut-off events. [2022-12-05 22:52:56,765 INFO L131 PetriNetUnfolder]: For 2526/2526 co-relation queries the response was YES. [2022-12-05 22:52:56,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 68 events. 15/68 cut-off events. For 2526/2526 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 144 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 533. Up to 30 conditions per place. [2022-12-05 22:52:56,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 39 transitions, 477 flow [2022-12-05 22:52:56,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-05 22:52:56,831 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [241] $Ultimate##0-->L704-5: Formula: (and (= v_~j~0_145 (+ v_~i~0_156 1)) (= |v_t2Thread1of1ForFork1_#in~arg.offset_12| v_t2Thread1of1ForFork1_~arg.offset_17) (= v_t2Thread1of1ForFork1_~arg.base_17 |v_t2Thread1of1ForFork1_#in~arg.base_12|) (= v_t2Thread1of1ForFork1_~k~1_118 1)) InVars {t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_12|, ~i~0=v_~i~0_156, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_12|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_12|, ~j~0=v_~j~0_145, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_17, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_63|, ~i~0=v_~i~0_156, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_17, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_12|, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_118} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~arg.offset, t2Thread1of1ForFork1_~k~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 5)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-05 22:52:56,863 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (= (+ v_~i~0_20 1) v_~j~0_26) (< v_t2Thread1of1ForFork1_~k~1_34 5)) 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] 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 5)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-05 22:52:56,890 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [242] $Ultimate##0-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~arg.base_19 |v_t2Thread1of1ForFork1_#in~arg.base_14|) (= v_t2Thread1of1ForFork1_~k~1_122 1) (= v_~j~0_147 (+ v_~i~0_158 1)) (= |v_t2Thread1of1ForFork1_#in~arg.offset_14| v_t2Thread1of1ForFork1_~arg.offset_19)) InVars {t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_14|, ~i~0=v_~i~0_158, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_14|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_14|, ~j~0=v_~j~0_147, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_19, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_65|, ~i~0=v_~i~0_158, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_19, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_14|, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_122} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~arg.offset, t2Thread1of1ForFork1_~k~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 5)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-05 22:52:56,922 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [211] L704-5-->L704-5: Formula: (and (= v_t2Thread1of1ForFork1_~k~1_33 (+ v_t2Thread1of1ForFork1_~k~1_34 1)) (= (+ v_~i~0_20 1) v_~j~0_26) (< v_t2Thread1of1ForFork1_~k~1_34 5)) 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] 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 5)) InVars {~j~0=v_~j~0_53, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_28} OutVars{~j~0=v_~j~0_53, ~i~0=v_~i~0_41, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_17|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_27} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~k~0] [2022-12-05 22:52:56,948 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 22:52:56,949 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-05 22:52:56,949 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 34 transitions, 452 flow [2022-12-05 22:52:56,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:56,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:56,949 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:56,964 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-05 22:52:57,149 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-05 22:52:57,149 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:57,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:57,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1935539200, now seen corresponding path program 1 times [2022-12-05 22:52:57,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:57,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042198513] [2022-12-05 22:52:57,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:57,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:57,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:57,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042198513] [2022-12-05 22:52:57,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042198513] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:57,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732312291] [2022-12-05 22:52:57,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:57,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:57,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:57,237 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:52:57,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-05 22:52:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:57,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-05 22:52:57,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:52:57,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:52:57,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732312291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:52:57,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:52:57,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2022-12-05 22:52:57,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079428738] [2022-12-05 22:52:57,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:52:57,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 22:52:57,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:57,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 22:52:57,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-12-05 22:52:57,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 22:52:57,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 34 transitions, 452 flow. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:57,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:57,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 22:52:57,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:57,376 INFO L130 PetriNetUnfolder]: 81/188 cut-off events. [2022-12-05 22:52:57,376 INFO L131 PetriNetUnfolder]: For 4480/4480 co-relation queries the response was YES. [2022-12-05 22:52:57,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1393 conditions, 188 events. 81/188 cut-off events. For 4480/4480 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 681 event pairs, 5 based on Foata normal form. 29/217 useless extension candidates. Maximal degree in co-relation 1341. Up to 124 conditions per place. [2022-12-05 22:52:57,379 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 0 selfloop transitions, 0 changer transitions 75/75 dead transitions. [2022-12-05 22:52:57,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 75 transitions, 1094 flow [2022-12-05 22:52:57,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 22:52:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 22:52:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-12-05 22:52:57,379 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2022-12-05 22:52:57,379 INFO L175 Difference]: Start difference. First operand has 91 places, 34 transitions, 452 flow. Second operand 8 states and 49 transitions. [2022-12-05 22:52:57,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 75 transitions, 1094 flow [2022-12-05 22:52:57,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 75 transitions, 735 flow, removed 107 selfloop flow, removed 29 redundant places. [2022-12-05 22:52:57,384 INFO L231 Difference]: Finished difference. Result has 67 places, 0 transitions, 0 flow [2022-12-05 22:52:57,385 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=67, PETRI_TRANSITIONS=0} [2022-12-05 22:52:57,385 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 49 predicate places. [2022-12-05 22:52:57,386 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:57,386 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 0 transitions, 0 flow [2022-12-05 22:52:57,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-05 22:52:57,386 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 22:52:57,386 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:52:57,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-05 22:52:57,386 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-05 22:52:57,386 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 22:52:57,386 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:52:57,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-05 22:52:57,388 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-05 22:52:57,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:52:57,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-05 22:52:57,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-05 22:52:57,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-05 22:52:57,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-05 22:52:57,595 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-05 22:52:57,595 INFO L458 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:57,597 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:52:57,597 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:52:57,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:52:57 BasicIcfg [2022-12-05 22:52:57,599 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:52:57,600 INFO L158 Benchmark]: Toolchain (without parser) took 10225.14ms. Allocated memory was 203.4MB in the beginning and 361.8MB in the end (delta: 158.3MB). Free memory was 168.1MB in the beginning and 195.5MB in the end (delta: -27.4MB). Peak memory consumption was 132.3MB. Max. memory is 8.0GB. [2022-12-05 22:52:57,600 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 203.4MB. Free memory is still 180.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:52:57,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.77ms. Allocated memory is still 203.4MB. Free memory was 167.9MB in the beginning and 148.0MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-05 22:52:57,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.30ms. Allocated memory is still 203.4MB. Free memory was 148.0MB in the beginning and 145.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:52:57,600 INFO L158 Benchmark]: Boogie Preprocessor took 29.07ms. Allocated memory is still 203.4MB. Free memory was 145.9MB in the beginning and 144.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:52:57,600 INFO L158 Benchmark]: RCFGBuilder took 303.14ms. Allocated memory is still 203.4MB. Free memory was 144.3MB in the beginning and 131.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-05 22:52:57,601 INFO L158 Benchmark]: TraceAbstraction took 9505.81ms. Allocated memory was 203.4MB in the beginning and 361.8MB in the end (delta: 158.3MB). Free memory was 131.2MB in the beginning and 195.5MB in the end (delta: -64.3MB). Peak memory consumption was 95.6MB. Max. memory is 8.0GB. [2022-12-05 22:52:57,602 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 203.4MB. Free memory is still 180.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 334.77ms. Allocated memory is still 203.4MB. Free memory was 167.9MB in the beginning and 148.0MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.30ms. Allocated memory is still 203.4MB. Free memory was 148.0MB in the beginning and 145.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.07ms. Allocated memory is still 203.4MB. Free memory was 145.9MB in the beginning and 144.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 303.14ms. Allocated memory is still 203.4MB. Free memory was 144.3MB in the beginning and 131.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 9505.81ms. Allocated memory was 203.4MB in the beginning and 361.8MB in the end (delta: 158.3MB). Free memory was 131.2MB in the beginning and 195.5MB in the end (delta: -64.3MB). Peak memory consumption was 95.6MB. 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: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 0, dependent unconditional: 22, 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: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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.0s, 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, 69 PlacesBefore, 69 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: 3, dependent conditional: 3, 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, 92 PlacesBefore, 92 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, 112 PlacesBefore, 112 PlacesAfterwards, 93 TransitionsBefore, 92 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 7, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 7, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 7, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, 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: 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: 11, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 23, Positive conditional cache size: 16, 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, 142 PlacesBefore, 143 PlacesAfterwards, 108 TransitionsBefore, 106 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 14, independent: 7, independent conditional: 5, independent unconditional: 2, 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): 36, Positive cache size: 30, Positive conditional cache size: 23, 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, 148 PlacesBefore, 149 PlacesAfterwards, 125 TransitionsBefore, 124 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 11, 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: 13, independent: 11, independent conditional: 9, 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: 13, independent: 11, independent conditional: 9, 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: 13, independent: 11, independent conditional: 9, 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: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 13, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 35, Positive conditional cache size: 28, 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.2s, 97 PlacesBefore, 91 PlacesAfterwards, 39 TransitionsBefore, 34 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 17, independent conditional: 17, 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: 21, independent: 17, independent conditional: 7, independent unconditional: 10, 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: 21, independent: 17, independent conditional: 7, independent unconditional: 10, 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: 21, independent: 17, independent conditional: 7, independent unconditional: 10, 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: 9, independent: 9, independent conditional: 6, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 9, unknown conditional: 6, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 44, Positive conditional cache size: 34, Positive unconditional cache size: 10, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 44, Positive conditional cache size: 34, Positive unconditional cache size: 10, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 722]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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: 9.4s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1158 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1158 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1312 IncrementalHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 274 mSolverCounterUnsat, 0 mSDtfsCounter, 1312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 119 SyntacticMatches, 8 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2060occurred in iteration=11, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 258 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 1140 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1027 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 25 InterpolantComputations, 8 PerfectInterpolantSequences, 74/182 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-05 22:52:57,639 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...