/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 03:12:06,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 03:12:06,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 03:12:06,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 03:12:06,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 03:12:06,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 03:12:06,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 03:12:06,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 03:12:07,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 03:12:07,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 03:12:07,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 03:12:07,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 03:12:07,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 03:12:07,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 03:12:07,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 03:12:07,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 03:12:07,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 03:12:07,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 03:12:07,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 03:12:07,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 03:12:07,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 03:12:07,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 03:12:07,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 03:12:07,022 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 03:12:07,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 03:12:07,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 03:12:07,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 03:12:07,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 03:12:07,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 03:12:07,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 03:12:07,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 03:12:07,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 03:12:07,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 03:12:07,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 03:12:07,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 03:12:07,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 03:12:07,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 03:12:07,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 03:12:07,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 03:12:07,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 03:12:07,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 03:12:07,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 03:12:07,085 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 03:12:07,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 03:12:07,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 03:12:07,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 03:12:07,087 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 03:12:07,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 03:12:07,088 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 03:12:07,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 03:12:07,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 03:12:07,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 03:12:07,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 03:12:07,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 03:12:07,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 03:12:07,090 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 03:12:07,090 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 03:12:07,090 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 03:12:07,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 03:12:07,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 03:12:07,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 03:12:07,091 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 03:12:07,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 03:12:07,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:12:07,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 03:12:07,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 03:12:07,092 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 03:12:07,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 03:12:07,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 03:12:07,092 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 03:12:07,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 03:12:07,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 03:12:07,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 03:12:07,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 03:12:07,424 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 03:12:07,424 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 03:12:07,425 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2022-12-06 03:12:08,414 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 03:12:08,619 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 03:12:08,619 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2022-12-06 03:12:08,624 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/369215e6e/fc6c95e73126425f805984e9e8cd4ce6/FLAG32383c37b [2022-12-06 03:12:08,635 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/369215e6e/fc6c95e73126425f805984e9e8cd4ce6 [2022-12-06 03:12:08,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 03:12:08,638 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 03:12:08,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 03:12:08,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 03:12:08,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 03:12:08,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:12:08" (1/1) ... [2022-12-06 03:12:08,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fda1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:12:08, skipping insertion in model container [2022-12-06 03:12:08,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:12:08" (1/1) ... [2022-12-06 03:12:08,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 03:12:08,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 03:12:08,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:12:08,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:12:08,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:12:08,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:12:08,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:12:08,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:12:08,792 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c[2650,2663] [2022-12-06 03:12:08,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:12:08,804 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 03:12:08,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:12:08,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:12:08,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:12:08,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:12:08,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:12:08,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:12:08,824 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c[2650,2663] [2022-12-06 03:12:08,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:12:08,836 INFO L208 MainTranslator]: Completed translation [2022-12-06 03:12:08,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:12:08 WrapperNode [2022-12-06 03:12:08,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 03:12:08,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 03:12:08,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 03:12:08,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 03:12:08,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:12:08" (1/1) ... [2022-12-06 03:12:08,849 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:12:08" (1/1) ... [2022-12-06 03:12:08,865 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 142 [2022-12-06 03:12:08,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 03:12:08,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 03:12:08,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 03:12:08,869 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 03:12:08,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:12:08" (1/1) ... [2022-12-06 03:12:08,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:12:08" (1/1) ... [2022-12-06 03:12:08,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:12:08" (1/1) ... [2022-12-06 03:12:08,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:12:08" (1/1) ... [2022-12-06 03:12:08,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:12:08" (1/1) ... [2022-12-06 03:12:08,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:12:08" (1/1) ... [2022-12-06 03:12:08,901 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:12:08" (1/1) ... [2022-12-06 03:12:08,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:12:08" (1/1) ... [2022-12-06 03:12:08,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 03:12:08,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 03:12:08,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 03:12:08,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 03:12:08,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:12:08" (1/1) ... [2022-12-06 03:12:08,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:12:08,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:12:08,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 03:12:08,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 03:12:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 03:12:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 03:12:08,992 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 03:12:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 03:12:08,993 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 03:12:08,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 03:12:08,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 03:12:08,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 03:12:08,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 03:12:08,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 03:12:08,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 03:12:08,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 03:12:08,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 03:12:08,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 03:12:08,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 03:12:08,996 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 03:12:09,087 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 03:12:09,088 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 03:12:09,293 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 03:12:09,407 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 03:12:09,414 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 03:12:09,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:12:09 BoogieIcfgContainer [2022-12-06 03:12:09,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 03:12:09,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 03:12:09,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 03:12:09,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 03:12:09,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 03:12:08" (1/3) ... [2022-12-06 03:12:09,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2226f8c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:12:09, skipping insertion in model container [2022-12-06 03:12:09,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:12:08" (2/3) ... [2022-12-06 03:12:09,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2226f8c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:12:09, skipping insertion in model container [2022-12-06 03:12:09,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:12:09" (3/3) ... [2022-12-06 03:12:09,427 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive-alt.wvr.c [2022-12-06 03:12:09,442 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 03:12:09,442 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 03:12:09,443 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 03:12:09,531 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 03:12:09,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 122 transitions, 260 flow [2022-12-06 03:12:09,661 INFO L130 PetriNetUnfolder]: 11/120 cut-off events. [2022-12-06 03:12:09,661 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:12:09,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 120 events. 11/120 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-12-06 03:12:09,667 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 122 transitions, 260 flow [2022-12-06 03:12:09,674 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 112 transitions, 236 flow [2022-12-06 03:12:09,676 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:12:09,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 112 transitions, 236 flow [2022-12-06 03:12:09,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 112 transitions, 236 flow [2022-12-06 03:12:09,774 INFO L130 PetriNetUnfolder]: 11/112 cut-off events. [2022-12-06 03:12:09,774 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:12:09,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 112 events. 11/112 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-12-06 03:12:09,778 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 112 transitions, 236 flow [2022-12-06 03:12:09,778 INFO L188 LiptonReduction]: Number of co-enabled transitions 704 [2022-12-06 03:12:13,974 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-06 03:12:13,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 03:12:13,991 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;@11613e4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 03:12:13,991 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 03:12:14,003 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2022-12-06 03:12:14,003 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:12:14,003 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:12:14,004 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:12:14,004 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:12:14,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:12:14,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1610035340, now seen corresponding path program 1 times [2022-12-06 03:12:14,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:12:14,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986432229] [2022-12-06 03:12:14,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:14,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:12:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:14,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:12:14,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986432229] [2022-12-06 03:12:14,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986432229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:12:14,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:12:14,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 03:12:14,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303815300] [2022-12-06 03:12:14,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:12:14,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:12:14,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:12:14,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:12:14,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:12:14,329 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 03:12:14,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:14,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:12:14,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 03:12:14,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:12:14,376 INFO L130 PetriNetUnfolder]: 64/113 cut-off events. [2022-12-06 03:12:14,376 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 03:12:14,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 113 events. 64/113 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 335 event pairs, 13 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 162. Up to 66 conditions per place. [2022-12-06 03:12:14,378 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 19 selfloop transitions, 2 changer transitions 4/26 dead transitions. [2022-12-06 03:12:14,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 26 transitions, 123 flow [2022-12-06 03:12:14,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:12:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:12:14,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-06 03:12:14,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2022-12-06 03:12:14,392 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places. [2022-12-06 03:12:14,394 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:12:14,394 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 26 transitions, 123 flow [2022-12-06 03:12:14,397 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 26 transitions, 123 flow [2022-12-06 03:12:14,397 INFO L188 LiptonReduction]: Number of co-enabled transitions 20 [2022-12-06 03:12:14,398 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:12:14,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 03:12:14,400 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 26 transitions, 123 flow [2022-12-06 03:12:14,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:14,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:12:14,400 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:12:14,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 03:12:14,401 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:12:14,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:12:14,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1695124947, now seen corresponding path program 1 times [2022-12-06 03:12:14,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:12:14,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764932306] [2022-12-06 03:12:14,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:14,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:12:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:14,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:14,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:12:14,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764932306] [2022-12-06 03:12:14,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764932306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:12:14,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:12:14,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:12:14,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707458875] [2022-12-06 03:12:14,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:12:14,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:12:14,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:12:14,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:12:14,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:12:14,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 03:12:14,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 26 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:14,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:12:14,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 03:12:14,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:12:14,544 INFO L130 PetriNetUnfolder]: 48/96 cut-off events. [2022-12-06 03:12:14,544 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 03:12:14,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 96 events. 48/96 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 230 event pairs, 9 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 192. Up to 66 conditions per place. [2022-12-06 03:12:14,546 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 19 selfloop transitions, 2 changer transitions 9/31 dead transitions. [2022-12-06 03:12:14,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 31 transitions, 206 flow [2022-12-06 03:12:14,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:12:14,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:12:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-06 03:12:14,548 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 03:12:14,548 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 4 predicate places. [2022-12-06 03:12:14,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:12:14,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 31 transitions, 206 flow [2022-12-06 03:12:14,552 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 31 transitions, 206 flow [2022-12-06 03:12:14,552 INFO L188 LiptonReduction]: Number of co-enabled transitions 8 [2022-12-06 03:12:14,553 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:12:14,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 03:12:14,554 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 31 transitions, 206 flow [2022-12-06 03:12:14,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:14,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:12:14,555 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:12:14,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 03:12:14,555 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:12:14,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:12:14,556 INFO L85 PathProgramCache]: Analyzing trace with hash 33163708, now seen corresponding path program 1 times [2022-12-06 03:12:14,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:12:14,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330468241] [2022-12-06 03:12:14,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:14,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:12:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:12:14,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:12:14,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330468241] [2022-12-06 03:12:14,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330468241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:12:14,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:12:14,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:12:14,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100319360] [2022-12-06 03:12:14,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:12:14,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:12:14,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:12:14,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:12:14,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:12:14,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 03:12:14,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 31 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-06 03:12:14,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:12:14,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 03:12:14,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:12:14,781 INFO L130 PetriNetUnfolder]: 57/126 cut-off events. [2022-12-06 03:12:14,782 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-06 03:12:14,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 126 events. 57/126 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 371 event pairs, 18 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 254. Up to 95 conditions per place. [2022-12-06 03:12:14,784 INFO L137 encePairwiseOnDemand]: 12/16 looper letters, 20 selfloop transitions, 2 changer transitions 19/42 dead transitions. [2022-12-06 03:12:14,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 42 transitions, 366 flow [2022-12-06 03:12:14,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:12:14,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:12:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-06 03:12:14,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.484375 [2022-12-06 03:12:14,788 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 7 predicate places. [2022-12-06 03:12:14,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:12:14,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 42 transitions, 366 flow [2022-12-06 03:12:14,790 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 42 transitions, 366 flow [2022-12-06 03:12:14,790 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-06 03:12:16,501 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:12:16,501 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1713 [2022-12-06 03:12:16,501 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 41 transitions, 358 flow [2022-12-06 03:12:16,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-06 03:12:16,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:12:16,502 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:12:16,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 03:12:16,502 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:12:16,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:12:16,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2011942810, now seen corresponding path program 1 times [2022-12-06 03:12:16,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:12:16,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633561279] [2022-12-06 03:12:16,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:16,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:12:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:16,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:12:16,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633561279] [2022-12-06 03:12:16,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633561279] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:12:16,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697575567] [2022-12-06 03:12:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:16,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:16,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:12:16,978 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:12:17,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 03:12:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:17,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 03:12:17,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:12:17,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-06 03:12:17,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:12:17,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:12:17,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:12:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:17,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:12:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:17,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697575567] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:12:17,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:12:17,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 03:12:17,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495729237] [2022-12-06 03:12:17,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:12:17,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 03:12:17,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:12:17,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 03:12:17,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=262, Unknown=2, NotChecked=0, Total=342 [2022-12-06 03:12:17,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 03:12:17,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 41 transitions, 358 flow. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:17,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:12:17,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 03:12:17,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:12:18,131 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~front~0 4))) (let ((.cse8 (+ c_~queue~0.offset .cse4)) (.cse5 (* c_~back~0 4)) (.cse6 (not (< c_~back~0 c_~n~0))) (.cse7 (not (<= 0 c_~back~0)))) (and (<= c_~front~0 0) (or (let ((.cse2 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_73 (Array Int Int)) (v_ArrVal_72 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_72) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_73) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< (+ c_~sum~0 (select .cse0 .cse1)) 0)) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_73 (Array Int Int)) (v_ArrVal_72 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_72) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_73) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse3 .cse2) 1)) (not (< 1 (+ c_~sum~0 (select .cse3 .cse1))))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6 .cse7) (= c_~queue~0.offset 0) (<= 0 c_~front~0) (= (select (select |c_#memory_int| c_~queue~0.base) .cse8) 1) (or (let ((.cse10 (+ c_~queue~0.offset .cse5))) (and (forall ((v_ArrVal_73 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_73) c_~queue~0.base))) (or (not (= (select .cse9 .cse10) 1)) (not (< 1 (+ c_~sum~0 (select .cse9 .cse8))))))) (forall ((v_ArrVal_73 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_73) c_~queue~0.base))) (or (not (= (select .cse11 .cse10) 1)) (not (< (+ c_~sum~0 (select .cse11 .cse8)) 0))))))) .cse6 .cse7) (= c_~sum~0 0)))) is different from false [2022-12-06 03:12:18,403 INFO L130 PetriNetUnfolder]: 207/416 cut-off events. [2022-12-06 03:12:18,403 INFO L131 PetriNetUnfolder]: For 310/310 co-relation queries the response was YES. [2022-12-06 03:12:18,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2082 conditions, 416 events. 207/416 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1825 event pairs, 21 based on Foata normal form. 2/314 useless extension candidates. Maximal degree in co-relation 752. Up to 360 conditions per place. [2022-12-06 03:12:18,405 INFO L137 encePairwiseOnDemand]: 2/17 looper letters, 46 selfloop transitions, 22 changer transitions 72/140 dead transitions. [2022-12-06 03:12:18,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 140 transitions, 1496 flow [2022-12-06 03:12:18,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 03:12:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 03:12:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2022-12-06 03:12:18,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3806228373702422 [2022-12-06 03:12:18,407 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 22 predicate places. [2022-12-06 03:12:18,407 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:12:18,407 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 140 transitions, 1496 flow [2022-12-06 03:12:18,410 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 140 transitions, 1496 flow [2022-12-06 03:12:18,410 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:12:18,412 WARN L322 ript$VariableManager]: TermVariable LBE84 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 03:12:18,412 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 03:12:18,412 WARN L322 ript$VariableManager]: TermVariable LBE220 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 03:12:18,412 WARN L322 ript$VariableManager]: TermVariable LBE67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 03:12:19,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [517] L60-4-->L60-4: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_36| 256) 0)) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_36| 256) 0))) (let ((.cse0 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0))) (.cse3 (= (+ v_~back~0_126 1) v_~back~0_125)) (.cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|)) (.cse1 (select (select |v_#memory_int_108| v_~queue~0.base_78) (+ (* v_~back~0_126 4) v_~queue~0.offset_78))) (.cse5 (= |v_thread2Thread1of1ForFork1_~b~0#1_35| (ite (= (ite .cse2 1 0) 0) 0 1)))) (or (and .cse0 (= (ite (= .cse1 1) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|) (not .cse2) .cse3 .cse4 (= |v_thread2Thread1of1ForFork1_#t~post8#1_14| |v_thread2Thread1of1ForFork1_#t~post8#1_13|) .cse5 (= |v_thread2Thread1of1ForFork1_#t~mem7#1_14| |v_thread2Thread1of1ForFork1_#t~mem7#1_13|)) (and .cse0 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_12| |v_thread2Thread1of1ForFork1_#t~mem5#1_11|) .cse3 .cse4 .cse2 (= (ite (= (+ .cse1 1) 0) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|) .cse5 (= |v_thread2Thread1of1ForFork1_#t~post6#1_12| |v_thread2Thread1of1ForFork1_#t~post6#1_11|))))) (not (= (ite (and (< v_~back~0_126 v_~n~0_62) (<= 0 v_~back~0_126)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_14|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_14|, ~back~0=v_~back~0_126, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_12|, ~queue~0.base=v_~queue~0.base_78, ~n~0=v_~n~0_62, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_36|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_12|, thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_36|} OutVars{~queue~0.offset=v_~queue~0.offset_78, ~back~0=v_~back~0_125, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|, ~queue~0.base=v_~queue~0.base_78, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_13|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_13|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_11|, ~n~0=v_~n~0_62, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~back~0, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~b~0#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~nondet4#1] and [487] L89-4-->L90-1: Formula: (= (select (select |v_#memory_int_76| |v_ULTIMATE.start_main_~#t1~0#1.base_17|) |v_ULTIMATE.start_main_~#t1~0#1.offset_17|) |v_ULTIMATE.start_main_#t~mem16#1_10|) InVars {#memory_int=|v_#memory_int_76|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_17|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_17|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_19|, #memory_int=|v_#memory_int_76|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_17|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_17|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-06 03:12:19,176 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [517] L60-4-->L60-4: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_36| 256) 0)) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_36| 256) 0))) (let ((.cse0 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0))) (.cse3 (= (+ v_~back~0_126 1) v_~back~0_125)) (.cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|)) (.cse1 (select (select |v_#memory_int_108| v_~queue~0.base_78) (+ (* v_~back~0_126 4) v_~queue~0.offset_78))) (.cse5 (= |v_thread2Thread1of1ForFork1_~b~0#1_35| (ite (= (ite .cse2 1 0) 0) 0 1)))) (or (and .cse0 (= (ite (= .cse1 1) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|) (not .cse2) .cse3 .cse4 (= |v_thread2Thread1of1ForFork1_#t~post8#1_14| |v_thread2Thread1of1ForFork1_#t~post8#1_13|) .cse5 (= |v_thread2Thread1of1ForFork1_#t~mem7#1_14| |v_thread2Thread1of1ForFork1_#t~mem7#1_13|)) (and .cse0 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_12| |v_thread2Thread1of1ForFork1_#t~mem5#1_11|) .cse3 .cse4 .cse2 (= (ite (= (+ .cse1 1) 0) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|) .cse5 (= |v_thread2Thread1of1ForFork1_#t~post6#1_12| |v_thread2Thread1of1ForFork1_#t~post6#1_11|))))) (not (= (ite (and (< v_~back~0_126 v_~n~0_62) (<= 0 v_~back~0_126)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_14|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_14|, ~back~0=v_~back~0_126, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_12|, ~queue~0.base=v_~queue~0.base_78, ~n~0=v_~n~0_62, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_36|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_12|, thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_36|} OutVars{~queue~0.offset=v_~queue~0.offset_78, ~back~0=v_~back~0_125, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|, ~queue~0.base=v_~queue~0.base_78, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_13|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_13|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_11|, ~n~0=v_~n~0_62, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~back~0, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~b~0#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~nondet4#1] and [401] L90-2-->L91-1: Formula: (= (select (select |v_#memory_int_40| |v_ULTIMATE.start_main_~#t2~0#1.base_7|) |v_ULTIMATE.start_main_~#t2~0#1.offset_7|) |v_ULTIMATE.start_main_#t~mem17#1_6|) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_7|, #memory_int=|v_#memory_int_40|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_7|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_7|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_6|, #memory_int=|v_#memory_int_40|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~mem16#1] [2022-12-06 03:12:19,324 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [517] L60-4-->L60-4: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_36| 256) 0)) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_36| 256) 0))) (let ((.cse0 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0))) (.cse3 (= (+ v_~back~0_126 1) v_~back~0_125)) (.cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|)) (.cse1 (select (select |v_#memory_int_108| v_~queue~0.base_78) (+ (* v_~back~0_126 4) v_~queue~0.offset_78))) (.cse5 (= |v_thread2Thread1of1ForFork1_~b~0#1_35| (ite (= (ite .cse2 1 0) 0) 0 1)))) (or (and .cse0 (= (ite (= .cse1 1) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|) (not .cse2) .cse3 .cse4 (= |v_thread2Thread1of1ForFork1_#t~post8#1_14| |v_thread2Thread1of1ForFork1_#t~post8#1_13|) .cse5 (= |v_thread2Thread1of1ForFork1_#t~mem7#1_14| |v_thread2Thread1of1ForFork1_#t~mem7#1_13|)) (and .cse0 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_12| |v_thread2Thread1of1ForFork1_#t~mem5#1_11|) .cse3 .cse4 .cse2 (= (ite (= (+ .cse1 1) 0) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|) .cse5 (= |v_thread2Thread1of1ForFork1_#t~post6#1_12| |v_thread2Thread1of1ForFork1_#t~post6#1_11|))))) (not (= (ite (and (< v_~back~0_126 v_~n~0_62) (<= 0 v_~back~0_126)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_14|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_14|, ~back~0=v_~back~0_126, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_12|, ~queue~0.base=v_~queue~0.base_78, ~n~0=v_~n~0_62, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_36|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_12|, thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_36|} OutVars{~queue~0.offset=v_~queue~0.offset_78, ~back~0=v_~back~0_125, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|, ~queue~0.base=v_~queue~0.base_78, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_13|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_13|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_11|, ~n~0=v_~n~0_62, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~back~0, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~b~0#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~nondet4#1] and [511] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_In_1| 256) 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~nondet1#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 03:12:19,544 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [517] L60-4-->L60-4: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_36| 256) 0)) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_36| 256) 0))) (let ((.cse0 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0))) (.cse3 (= (+ v_~back~0_126 1) v_~back~0_125)) (.cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|)) (.cse1 (select (select |v_#memory_int_108| v_~queue~0.base_78) (+ (* v_~back~0_126 4) v_~queue~0.offset_78))) (.cse5 (= |v_thread2Thread1of1ForFork1_~b~0#1_35| (ite (= (ite .cse2 1 0) 0) 0 1)))) (or (and .cse0 (= (ite (= .cse1 1) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|) (not .cse2) .cse3 .cse4 (= |v_thread2Thread1of1ForFork1_#t~post8#1_14| |v_thread2Thread1of1ForFork1_#t~post8#1_13|) .cse5 (= |v_thread2Thread1of1ForFork1_#t~mem7#1_14| |v_thread2Thread1of1ForFork1_#t~mem7#1_13|)) (and .cse0 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_12| |v_thread2Thread1of1ForFork1_#t~mem5#1_11|) .cse3 .cse4 .cse2 (= (ite (= (+ .cse1 1) 0) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|) .cse5 (= |v_thread2Thread1of1ForFork1_#t~post6#1_12| |v_thread2Thread1of1ForFork1_#t~post6#1_11|))))) (not (= (ite (and (< v_~back~0_126 v_~n~0_62) (<= 0 v_~back~0_126)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_14|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_14|, ~back~0=v_~back~0_126, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_12|, ~queue~0.base=v_~queue~0.base_78, ~n~0=v_~n~0_62, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_36|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_12|, thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_36|} OutVars{~queue~0.offset=v_~queue~0.offset_78, ~back~0=v_~back~0_125, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|, ~queue~0.base=v_~queue~0.base_78, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_13|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_13|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_11|, ~n~0=v_~n~0_62, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~back~0, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~b~0#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~nondet4#1] and [505] L52-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (< v_~front~0_81 v_~back~0_119) (<= 0 v_~front~0_81) (< v_~front~0_81 v_~n~0_60)) 1 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_28| 256) 0)) (= (+ v_~front~0_81 1) v_~front~0_80) (= (+ v_~sum~0_56 (select (select |v_#memory_int_96| v_~queue~0.base_70) (+ (* v_~front~0_81 4) v_~queue~0.offset_70))) v_~sum~0_55) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0))) InVars {~sum~0=v_~sum~0_56, ~queue~0.offset=v_~queue~0.offset_70, #memory_int=|v_#memory_int_96|, ~back~0=v_~back~0_119, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_28|, ~queue~0.base=v_~queue~0.base_70, ~n~0=v_~n~0_60, ~front~0=v_~front~0_81} OutVars{~sum~0=v_~sum~0_55, ~queue~0.offset=v_~queue~0.offset_70, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_9|, #memory_int=|v_#memory_int_96|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, ~back~0=v_~back~0_119, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_9|, ~queue~0.base=v_~queue~0.base_70, ~n~0=v_~n~0_60, ~front~0=v_~front~0_80} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1, ~front~0] [2022-12-06 03:12:22,827 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:12:22,839 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4432 [2022-12-06 03:12:22,843 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 138 transitions, 1484 flow [2022-12-06 03:12:22,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:22,844 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:12:22,844 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:12:22,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 03:12:23,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:23,050 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:12:23,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:12:23,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1910967819, now seen corresponding path program 1 times [2022-12-06 03:12:23,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:12:23,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445088009] [2022-12-06 03:12:23,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:23,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:12:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:23,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:12:23,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445088009] [2022-12-06 03:12:23,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445088009] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:12:23,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097613411] [2022-12-06 03:12:23,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:23,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:23,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:12:23,873 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:12:23,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 03:12:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:23,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 03:12:23,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:12:23,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-12-06 03:12:23,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:12:23,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:12:24,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:12:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:24,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:12:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:24,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097613411] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:12:24,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:12:24,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 03:12:24,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118268026] [2022-12-06 03:12:24,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:12:24,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 03:12:24,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:12:24,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 03:12:24,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=178, Unknown=1, NotChecked=0, Total=240 [2022-12-06 03:12:24,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 03:12:24,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 138 transitions, 1484 flow. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:24,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:12:24,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 03:12:24,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:12:24,722 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (let ((.cse0 (select (select |c_#memory_int| c_~queue~0.base) .cse2))) (and (<= .cse0 1) (or (not (< c_~back~0 c_~n~0)) (let ((.cse3 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_111 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) c_~queue~0.base))) (or (not (< (+ c_~sum~0 (select .cse1 .cse2)) 0)) (not (= (select .cse1 .cse3) 1))))) (forall ((v_ArrVal_111 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) c_~queue~0.base))) (or (not (< 1 (+ c_~sum~0 (select .cse4 .cse2)))) (not (= (select .cse4 .cse3) 1))))))) (not (<= 0 c_~back~0))) (<= c_~front~0 0) (= c_~queue~0.offset 0) (<= 1 .cse0) (<= 0 c_~front~0) (= .cse0 1) (= c_~sum~0 0)))) is different from false [2022-12-06 03:12:25,008 INFO L130 PetriNetUnfolder]: 201/455 cut-off events. [2022-12-06 03:12:25,008 INFO L131 PetriNetUnfolder]: For 341/341 co-relation queries the response was YES. [2022-12-06 03:12:25,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2760 conditions, 455 events. 201/455 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2384 event pairs, 32 based on Foata normal form. 1/350 useless extension candidates. Maximal degree in co-relation 892. Up to 399 conditions per place. [2022-12-06 03:12:25,010 INFO L137 encePairwiseOnDemand]: 1/25 looper letters, 43 selfloop transitions, 22 changer transitions 118/183 dead transitions. [2022-12-06 03:12:25,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 183 transitions, 2354 flow [2022-12-06 03:12:25,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 03:12:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 03:12:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 109 transitions. [2022-12-06 03:12:25,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31142857142857144 [2022-12-06 03:12:25,012 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 32 predicate places. [2022-12-06 03:12:25,012 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:12:25,012 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 183 transitions, 2354 flow [2022-12-06 03:12:25,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 183 transitions, 2354 flow [2022-12-06 03:12:25,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:12:25,016 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:12:25,016 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 03:12:25,016 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 183 transitions, 2354 flow [2022-12-06 03:12:25,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:25,016 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:12:25,017 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:12:25,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 03:12:25,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:25,222 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:12:25,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:12:25,222 INFO L85 PathProgramCache]: Analyzing trace with hash -911630601, now seen corresponding path program 1 times [2022-12-06 03:12:25,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:12:25,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647162793] [2022-12-06 03:12:25,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:25,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:12:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:25,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:12:25,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647162793] [2022-12-06 03:12:25,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647162793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:12:25,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:12:25,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 03:12:25,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223568889] [2022-12-06 03:12:25,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:12:25,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:12:25,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:12:25,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:12:25,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:12:25,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 03:12:25,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 183 transitions, 2354 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-06 03:12:25,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:12:25,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 03:12:25,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:12:25,493 INFO L130 PetriNetUnfolder]: 204/473 cut-off events. [2022-12-06 03:12:25,494 INFO L131 PetriNetUnfolder]: For 516/516 co-relation queries the response was YES. [2022-12-06 03:12:25,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3322 conditions, 473 events. 204/473 cut-off events. For 516/516 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2512 event pairs, 32 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 959. Up to 417 conditions per place. [2022-12-06 03:12:25,496 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 51 selfloop transitions, 3 changer transitions 134/191 dead transitions. [2022-12-06 03:12:25,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 191 transitions, 2835 flow [2022-12-06 03:12:25,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:12:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:12:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-12-06 03:12:25,498 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2022-12-06 03:12:25,501 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 37 predicate places. [2022-12-06 03:12:25,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:12:25,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 191 transitions, 2835 flow [2022-12-06 03:12:25,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 191 transitions, 2835 flow [2022-12-06 03:12:25,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:12:25,507 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:12:25,512 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 03:12:25,513 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 191 transitions, 2835 flow [2022-12-06 03:12:25,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-06 03:12:25,513 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:12:25,513 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:12:25,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 03:12:25,514 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:12:25,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:12:25,515 INFO L85 PathProgramCache]: Analyzing trace with hash -643524470, now seen corresponding path program 1 times [2022-12-06 03:12:25,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:12:25,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698213549] [2022-12-06 03:12:25,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:25,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:12:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:12:25,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:12:25,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698213549] [2022-12-06 03:12:25,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698213549] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:12:25,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687978179] [2022-12-06 03:12:25,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:25,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:25,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:12:25,636 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:12:25,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 03:12:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:25,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 03:12:25,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:12:25,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 92 [2022-12-06 03:12:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:12:25,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:12:25,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687978179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:12:25,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:12:25,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 03:12:25,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954945946] [2022-12-06 03:12:25,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:12:25,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:12:25,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:12:25,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:12:25,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:12:25,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 03:12:25,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 191 transitions, 2835 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-06 03:12:25,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:12:25,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 03:12:25,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:12:25,974 INFO L130 PetriNetUnfolder]: 167/408 cut-off events. [2022-12-06 03:12:25,974 INFO L131 PetriNetUnfolder]: For 716/716 co-relation queries the response was YES. [2022-12-06 03:12:25,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 408 events. 167/408 cut-off events. For 716/716 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2183 event pairs, 30 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 760. Up to 352 conditions per place. [2022-12-06 03:12:25,976 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 38 selfloop transitions, 0 changer transitions 125/165 dead transitions. [2022-12-06 03:12:25,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 165 transitions, 2777 flow [2022-12-06 03:12:25,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:12:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:12:25,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 03:12:25,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 03:12:25,978 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 40 predicate places. [2022-12-06 03:12:25,978 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:12:25,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 165 transitions, 2777 flow [2022-12-06 03:12:25,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 165 transitions, 2777 flow [2022-12-06 03:12:25,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:12:25,983 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:12:25,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 03:12:25,984 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 165 transitions, 2777 flow [2022-12-06 03:12:25,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-06 03:12:25,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:12:25,984 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:12:25,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 03:12:26,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:26,191 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:12:26,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:12:26,191 INFO L85 PathProgramCache]: Analyzing trace with hash 866156631, now seen corresponding path program 1 times [2022-12-06 03:12:26,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:12:26,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210343054] [2022-12-06 03:12:26,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:26,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:12:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:26,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:12:26,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210343054] [2022-12-06 03:12:26,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210343054] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:12:26,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143381679] [2022-12-06 03:12:26,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:26,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:26,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:12:26,289 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:12:26,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 03:12:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:26,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 03:12:26,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:12:26,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 92 [2022-12-06 03:12:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:26,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:12:26,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 104 [2022-12-06 03:12:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:26,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143381679] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:12:26,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:12:26,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2022-12-06 03:12:26,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768759681] [2022-12-06 03:12:26,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:12:26,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:12:26,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:12:26,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:12:26,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:12:26,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 03:12:26,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 165 transitions, 2777 flow. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:26,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:12:26,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 03:12:26,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:12:26,598 INFO L130 PetriNetUnfolder]: 255/576 cut-off events. [2022-12-06 03:12:26,599 INFO L131 PetriNetUnfolder]: For 1009/1009 co-relation queries the response was YES. [2022-12-06 03:12:26,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5158 conditions, 576 events. 255/576 cut-off events. For 1009/1009 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3126 event pairs, 27 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 1355. Up to 520 conditions per place. [2022-12-06 03:12:26,602 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 54 selfloop transitions, 14 changer transitions 143/213 dead transitions. [2022-12-06 03:12:26,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 213 transitions, 4001 flow [2022-12-06 03:12:26,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:12:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:12:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 03:12:26,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 03:12:26,605 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 43 predicate places. [2022-12-06 03:12:26,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:12:26,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 213 transitions, 4001 flow [2022-12-06 03:12:26,616 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 213 transitions, 4001 flow [2022-12-06 03:12:26,617 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:12:26,617 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:12:26,619 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 03:12:26,619 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 213 transitions, 4001 flow [2022-12-06 03:12:26,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:26,619 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:12:26,619 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:12:26,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 03:12:26,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:26,825 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:12:26,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:12:26,826 INFO L85 PathProgramCache]: Analyzing trace with hash -335947446, now seen corresponding path program 1 times [2022-12-06 03:12:26,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:12:26,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998099212] [2022-12-06 03:12:26,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:26,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:12:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:27,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:12:27,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998099212] [2022-12-06 03:12:27,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998099212] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:12:27,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027703996] [2022-12-06 03:12:27,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:27,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:27,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:12:27,403 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:12:27,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 03:12:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:27,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 03:12:27,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:12:27,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:12:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:27,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:12:27,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:12:27,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 50 [2022-12-06 03:12:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:27,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027703996] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:12:27,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:12:27,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 13 [2022-12-06 03:12:27,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985115374] [2022-12-06 03:12:27,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:12:27,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 03:12:27,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:12:27,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 03:12:27,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-12-06 03:12:27,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 03:12:27,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 213 transitions, 4001 flow. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:27,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:12:27,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 03:12:27,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:12:28,169 INFO L130 PetriNetUnfolder]: 351/761 cut-off events. [2022-12-06 03:12:28,169 INFO L131 PetriNetUnfolder]: For 1414/1414 co-relation queries the response was YES. [2022-12-06 03:12:28,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7574 conditions, 761 events. 351/761 cut-off events. For 1414/1414 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4281 event pairs, 21 based on Foata normal form. 3/584 useless extension candidates. Maximal degree in co-relation 2030. Up to 699 conditions per place. [2022-12-06 03:12:28,173 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 74 selfloop transitions, 20 changer transitions 177/271 dead transitions. [2022-12-06 03:12:28,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 271 transitions, 5623 flow [2022-12-06 03:12:28,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 03:12:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 03:12:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 83 transitions. [2022-12-06 03:12:28,174 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3143939393939394 [2022-12-06 03:12:28,174 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 53 predicate places. [2022-12-06 03:12:28,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:12:28,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 271 transitions, 5623 flow [2022-12-06 03:12:28,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 271 transitions, 5623 flow [2022-12-06 03:12:28,181 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:12:30,807 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:12:30,808 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2634 [2022-12-06 03:12:30,808 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 270 transitions, 5603 flow [2022-12-06 03:12:30,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:30,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:12:30,808 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:12:30,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 03:12:31,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:31,009 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:12:31,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:12:31,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2115979078, now seen corresponding path program 2 times [2022-12-06 03:12:31,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:12:31,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498475676] [2022-12-06 03:12:31,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:31,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:12:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:31,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:31,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:12:31,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498475676] [2022-12-06 03:12:31,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498475676] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:12:31,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700982714] [2022-12-06 03:12:31,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:12:31,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:31,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:12:31,816 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:12:31,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 03:12:31,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:12:31,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:12:31,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 03:12:31,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:12:32,085 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:12:32,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-12-06 03:12:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:32,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:12:32,306 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-06 03:12:32,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 194 [2022-12-06 03:12:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:32,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700982714] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:12:32,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:12:32,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 17 [2022-12-06 03:12:32,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524622732] [2022-12-06 03:12:32,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:12:32,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 03:12:32,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:12:32,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 03:12:32,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-12-06 03:12:32,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 03:12:32,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 270 transitions, 5603 flow. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:32,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:12:32,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 03:12:32,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:12:34,096 INFO L130 PetriNetUnfolder]: 607/1228 cut-off events. [2022-12-06 03:12:34,096 INFO L131 PetriNetUnfolder]: For 1496/1496 co-relation queries the response was YES. [2022-12-06 03:12:34,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13521 conditions, 1228 events. 607/1228 cut-off events. For 1496/1496 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7166 event pairs, 17 based on Foata normal form. 6/894 useless extension candidates. Maximal degree in co-relation 6107. Up to 1166 conditions per place. [2022-12-06 03:12:34,103 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 135 selfloop transitions, 42 changer transitions 226/403 dead transitions. [2022-12-06 03:12:34,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 403 transitions, 9165 flow [2022-12-06 03:12:34,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 03:12:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 03:12:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 212 transitions. [2022-12-06 03:12:34,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3392 [2022-12-06 03:12:34,105 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 76 predicate places. [2022-12-06 03:12:34,105 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:12:34,105 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 403 transitions, 9165 flow [2022-12-06 03:12:34,122 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 403 transitions, 9165 flow [2022-12-06 03:12:34,122 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:12:34,123 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:12:34,124 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 03:12:34,124 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 403 transitions, 9165 flow [2022-12-06 03:12:34,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:34,124 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:12:34,124 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:12:34,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 03:12:34,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:34,330 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:12:34,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:12:34,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1651742922, now seen corresponding path program 3 times [2022-12-06 03:12:34,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:12:34,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295374501] [2022-12-06 03:12:34,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:34,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:12:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:35,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:12:35,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295374501] [2022-12-06 03:12:35,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295374501] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:12:35,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704151161] [2022-12-06 03:12:35,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:12:35,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:35,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:12:35,095 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:12:35,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 03:12:35,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 03:12:35,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:12:35,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 03:12:35,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:12:35,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-12-06 03:12:35,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:12:35,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:12:35,415 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:12:35,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-12-06 03:12:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:35,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:12:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:35,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704151161] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:12:35,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:12:35,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-06 03:12:35,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409444903] [2022-12-06 03:12:35,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:12:35,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 03:12:35,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:12:35,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 03:12:35,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=367, Unknown=1, NotChecked=0, Total=462 [2022-12-06 03:12:35,889 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 03:12:35,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 403 transitions, 9165 flow. Second operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:35,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:12:35,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 03:12:35,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:12:39,613 INFO L130 PetriNetUnfolder]: 1276/2484 cut-off events. [2022-12-06 03:12:39,613 INFO L131 PetriNetUnfolder]: For 1957/1957 co-relation queries the response was YES. [2022-12-06 03:12:39,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29925 conditions, 2484 events. 1276/2484 cut-off events. For 1957/1957 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 16149 event pairs, 17 based on Foata normal form. 14/1761 useless extension candidates. Maximal degree in co-relation 16294. Up to 2416 conditions per place. [2022-12-06 03:12:39,637 INFO L137 encePairwiseOnDemand]: 7/25 looper letters, 266 selfloop transitions, 90 changer transitions 404/760 dead transitions. [2022-12-06 03:12:39,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 760 transitions, 18800 flow [2022-12-06 03:12:39,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-06 03:12:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-06 03:12:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 326 transitions. [2022-12-06 03:12:39,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3343589743589744 [2022-12-06 03:12:39,650 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 114 predicate places. [2022-12-06 03:12:39,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:12:39,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 760 transitions, 18800 flow [2022-12-06 03:12:39,689 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 760 transitions, 18800 flow [2022-12-06 03:12:39,689 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:12:39,692 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:12:39,693 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 03:12:39,693 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 760 transitions, 18800 flow [2022-12-06 03:12:39,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:39,693 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:12:39,693 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:12:39,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 03:12:39,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:39,900 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:12:39,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:12:39,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2005395388, now seen corresponding path program 1 times [2022-12-06 03:12:39,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:12:39,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247840953] [2022-12-06 03:12:39,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:39,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:12:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:41,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:41,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:12:41,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247840953] [2022-12-06 03:12:41,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247840953] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:12:41,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894379829] [2022-12-06 03:12:41,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:41,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:41,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:12:41,203 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:12:41,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 03:12:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:41,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 03:12:41,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:12:41,460 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:12:41,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-12-06 03:12:41,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:41,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:12:41,709 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-06 03:12:41,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 226 treesize of output 196 [2022-12-06 03:12:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:41,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894379829] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:12:41,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:12:41,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 18 [2022-12-06 03:12:41,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721962793] [2022-12-06 03:12:41,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:12:41,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:12:41,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:12:41,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:12:41,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:12:41,973 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 03:12:41,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 760 transitions, 18800 flow. Second operand has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:41,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:12:41,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 03:12:41,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:12:43,562 INFO L130 PetriNetUnfolder]: 1564/3019 cut-off events. [2022-12-06 03:12:43,562 INFO L131 PetriNetUnfolder]: For 2053/2053 co-relation queries the response was YES. [2022-12-06 03:12:43,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39422 conditions, 3019 events. 1564/3019 cut-off events. For 2053/2053 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 20316 event pairs, 17 based on Foata normal form. 7/2115 useless extension candidates. Maximal degree in co-relation 19789. Up to 2951 conditions per place. [2022-12-06 03:12:43,582 INFO L137 encePairwiseOnDemand]: 9/25 looper letters, 334 selfloop transitions, 86 changer transitions 488/908 dead transitions. [2022-12-06 03:12:43,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 908 transitions, 24282 flow [2022-12-06 03:12:43,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 03:12:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 03:12:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 165 transitions. [2022-12-06 03:12:43,584 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-06 03:12:43,584 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 134 predicate places. [2022-12-06 03:12:43,585 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:12:43,585 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 908 transitions, 24282 flow [2022-12-06 03:12:43,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 908 transitions, 24282 flow [2022-12-06 03:12:43,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:12:45,603 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:12:45,604 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2020 [2022-12-06 03:12:45,604 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 907 transitions, 24256 flow [2022-12-06 03:12:45,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:45,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:12:45,604 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:12:45,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 03:12:45,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 03:12:45,811 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:12:45,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:12:45,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1104229043, now seen corresponding path program 4 times [2022-12-06 03:12:45,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:12:45,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810123885] [2022-12-06 03:12:45,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:45,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:12:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:45,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:12:45,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810123885] [2022-12-06 03:12:45,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810123885] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:12:45,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349966522] [2022-12-06 03:12:45,994 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:12:45,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:45,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:12:46,004 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:12:46,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 03:12:46,076 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:12:46,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:12:46,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 03:12:46,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:12:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:12:46,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:12:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:12:46,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349966522] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:12:46,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:12:46,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-06 03:12:46,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853072892] [2022-12-06 03:12:46,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:12:46,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 03:12:46,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:12:46,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 03:12:46,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-12-06 03:12:46,196 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 03:12:46,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 907 transitions, 24256 flow. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:46,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:12:46,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 03:12:46,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:12:47,502 INFO L130 PetriNetUnfolder]: 1556/3058 cut-off events. [2022-12-06 03:12:47,502 INFO L131 PetriNetUnfolder]: For 2093/2093 co-relation queries the response was YES. [2022-12-06 03:12:47,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43000 conditions, 3058 events. 1556/3058 cut-off events. For 2093/2093 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 21286 event pairs, 20 based on Foata normal form. 0/2179 useless extension candidates. Maximal degree in co-relation 13058. Up to 2990 conditions per place. [2022-12-06 03:12:47,518 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 189 selfloop transitions, 86 changer transitions 643/918 dead transitions. [2022-12-06 03:12:47,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 918 transitions, 26390 flow [2022-12-06 03:12:47,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 03:12:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 03:12:47,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 143 transitions. [2022-12-06 03:12:47,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3235294117647059 [2022-12-06 03:12:47,521 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 142 predicate places. [2022-12-06 03:12:47,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:12:47,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 918 transitions, 26390 flow [2022-12-06 03:12:47,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 918 transitions, 26390 flow [2022-12-06 03:12:47,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:12:47,567 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:12:47,568 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 03:12:47,568 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 918 transitions, 26390 flow [2022-12-06 03:12:47,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:47,568 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:12:47,568 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:12:47,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 03:12:47,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 03:12:47,774 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:12:47,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:12:47,774 INFO L85 PathProgramCache]: Analyzing trace with hash 896507967, now seen corresponding path program 1 times [2022-12-06 03:12:47,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:12:47,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589341877] [2022-12-06 03:12:47,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:47,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:12:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:48,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:12:48,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589341877] [2022-12-06 03:12:48,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589341877] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:12:48,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556565662] [2022-12-06 03:12:48,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:48,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:48,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:12:48,672 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:12:48,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 03:12:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:48,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 03:12:48,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:12:49,020 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:12:49,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 18 [2022-12-06 03:12:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:49,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:12:49,456 INFO L321 Elim1Store]: treesize reduction 26, result has 82.3 percent of original size [2022-12-06 03:12:49,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 298 treesize of output 300 [2022-12-06 03:12:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:50,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556565662] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:12:50,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:12:50,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-12-06 03:12:50,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576877111] [2022-12-06 03:12:50,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:12:50,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 03:12:50,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:12:50,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 03:12:50,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2022-12-06 03:12:50,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 03:12:50,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 918 transitions, 26390 flow. Second operand has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:50,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:12:50,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 03:12:50,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:12:56,197 INFO L130 PetriNetUnfolder]: 3024/5805 cut-off events. [2022-12-06 03:12:56,197 INFO L131 PetriNetUnfolder]: For 2657/2657 co-relation queries the response was YES. [2022-12-06 03:12:56,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87555 conditions, 5805 events. 3024/5805 cut-off events. For 2657/2657 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 42994 event pairs, 18 based on Foata normal form. 23/4063 useless extension candidates. Maximal degree in co-relation 42833. Up to 5737 conditions per place. [2022-12-06 03:12:56,220 INFO L137 encePairwiseOnDemand]: 9/26 looper letters, 498 selfloop transitions, 176 changer transitions 1019/1693 dead transitions. [2022-12-06 03:12:56,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 1693 transitions, 52058 flow [2022-12-06 03:12:56,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-12-06 03:12:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2022-12-06 03:12:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 522 transitions. [2022-12-06 03:12:56,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3291298865069357 [2022-12-06 03:12:56,223 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 202 predicate places. [2022-12-06 03:12:56,223 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:12:56,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 1693 transitions, 52058 flow [2022-12-06 03:12:56,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 1693 transitions, 52058 flow [2022-12-06 03:12:56,271 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:12:56,274 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:12:56,275 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-06 03:12:56,276 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 1693 transitions, 52058 flow [2022-12-06 03:12:56,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:56,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:12:56,276 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:12:56,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 03:12:56,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 03:12:56,480 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:12:56,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:12:56,481 INFO L85 PathProgramCache]: Analyzing trace with hash 588488255, now seen corresponding path program 2 times [2022-12-06 03:12:56,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:12:56,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928744357] [2022-12-06 03:12:56,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:56,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:12:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:57,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:12:57,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928744357] [2022-12-06 03:12:57,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928744357] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:12:57,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002555357] [2022-12-06 03:12:57,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:12:57,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:57,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:12:57,791 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:12:57,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 03:12:57,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:12:57,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:12:57,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-06 03:12:57,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:12:57,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:12:57,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:12:57,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2022-12-06 03:12:57,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:12:57,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:12:58,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:12:58,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 18 [2022-12-06 03:12:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:58,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:12:58,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:58,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002555357] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:12:58,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:12:58,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-06 03:12:58,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651997850] [2022-12-06 03:12:58,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:12:58,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 03:12:58,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:12:58,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 03:12:58,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=604, Unknown=1, NotChecked=0, Total=756 [2022-12-06 03:12:58,854 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 03:12:58,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 1693 transitions, 52058 flow. Second operand has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:58,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:12:58,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 03:12:58,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:13:04,903 INFO L130 PetriNetUnfolder]: 3283/6271 cut-off events. [2022-12-06 03:13:04,903 INFO L131 PetriNetUnfolder]: For 2678/2678 co-relation queries the response was YES. [2022-12-06 03:13:04,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100862 conditions, 6271 events. 3283/6271 cut-off events. For 2678/2678 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 46528 event pairs, 12 based on Foata normal form. 34/4371 useless extension candidates. Maximal degree in co-relation 53234. Up to 6203 conditions per place. [2022-12-06 03:13:04,936 INFO L137 encePairwiseOnDemand]: 7/26 looper letters, 722 selfloop transitions, 169 changer transitions 945/1836 dead transitions. [2022-12-06 03:13:04,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 1836 transitions, 60110 flow [2022-12-06 03:13:04,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-06 03:13:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-06 03:13:04,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 328 transitions. [2022-12-06 03:13:04,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-06 03:13:04,945 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 220 predicate places. [2022-12-06 03:13:04,946 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:13:04,946 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 240 places, 1836 transitions, 60110 flow [2022-12-06 03:13:05,004 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 240 places, 1836 transitions, 60110 flow [2022-12-06 03:13:05,004 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:13:05,008 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:13:05,009 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 03:13:05,009 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 1836 transitions, 60110 flow [2022-12-06 03:13:05,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:05,010 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:13:05,010 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:13:05,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-06 03:13:05,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 03:13:05,215 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:13:05,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:13:05,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2086628023, now seen corresponding path program 3 times [2022-12-06 03:13:05,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:13:05,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783676562] [2022-12-06 03:13:05,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:05,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:13:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:06,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:13:06,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783676562] [2022-12-06 03:13:06,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783676562] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:13:06,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128272833] [2022-12-06 03:13:06,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:13:06,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:13:06,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:13:06,312 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:13:06,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 03:13:06,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 03:13:06,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:13:06,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-06 03:13:06,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:13:06,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:13:06,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:13:06,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2022-12-06 03:13:06,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:13:06,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:13:07,008 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:13:07,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 18 [2022-12-06 03:13:07,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:07,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:13:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:07,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128272833] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:13:07,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:13:07,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-06 03:13:07,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169035835] [2022-12-06 03:13:07,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:13:07,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 03:13:07,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:13:07,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 03:13:07,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=574, Unknown=2, NotChecked=0, Total=756 [2022-12-06 03:13:07,906 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 03:13:07,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 1836 transitions, 60110 flow. Second operand has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:07,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:13:07,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 03:13:07,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:13:17,403 INFO L130 PetriNetUnfolder]: 4989/9668 cut-off events. [2022-12-06 03:13:17,403 INFO L131 PetriNetUnfolder]: For 3332/3332 co-relation queries the response was YES. [2022-12-06 03:13:17,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165264 conditions, 9668 events. 4989/9668 cut-off events. For 3332/3332 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 76762 event pairs, 15 based on Foata normal form. 55/6851 useless extension candidates. Maximal degree in co-relation 108501. Up to 9600 conditions per place. [2022-12-06 03:13:17,489 INFO L137 encePairwiseOnDemand]: 7/26 looper letters, 1076 selfloop transitions, 429 changer transitions 1333/2838 dead transitions. [2022-12-06 03:13:17,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 2838 transitions, 98612 flow [2022-12-06 03:13:17,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-12-06 03:13:17,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-12-06 03:13:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 486 transitions. [2022-12-06 03:13:17,491 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31681877444589307 [2022-12-06 03:13:17,491 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 262 predicate places. [2022-12-06 03:13:17,492 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:13:17,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 282 places, 2838 transitions, 98612 flow [2022-12-06 03:13:17,586 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 282 places, 2838 transitions, 98612 flow [2022-12-06 03:13:17,587 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:13:17,592 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:13:17,592 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-06 03:13:17,592 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 2838 transitions, 98612 flow [2022-12-06 03:13:17,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:17,592 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:13:17,593 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:13:17,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 03:13:17,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 03:13:17,797 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:13:17,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:13:17,798 INFO L85 PathProgramCache]: Analyzing trace with hash 61242959, now seen corresponding path program 4 times [2022-12-06 03:13:17,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:13:17,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078432234] [2022-12-06 03:13:17,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:17,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:13:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:18,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:18,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:13:18,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078432234] [2022-12-06 03:13:18,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078432234] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:13:18,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420682576] [2022-12-06 03:13:18,705 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:13:18,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:13:18,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:13:18,706 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:13:18,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 03:13:18,787 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:13:18,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:13:18,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 03:13:18,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:13:19,046 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:13:19,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 18 [2022-12-06 03:13:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:19,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:13:19,461 INFO L321 Elim1Store]: treesize reduction 26, result has 82.3 percent of original size [2022-12-06 03:13:19,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 298 treesize of output 300 [2022-12-06 03:13:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:20,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420682576] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:13:20,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:13:20,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-12-06 03:13:20,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821580183] [2022-12-06 03:13:20,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:13:20,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 03:13:20,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:13:20,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 03:13:20,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-12-06 03:13:20,721 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 03:13:20,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 2838 transitions, 98612 flow. Second operand has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:20,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:13:20,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 03:13:20,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:13:28,470 INFO L130 PetriNetUnfolder]: 4262/8281 cut-off events. [2022-12-06 03:13:28,470 INFO L131 PetriNetUnfolder]: For 3033/3033 co-relation queries the response was YES. [2022-12-06 03:13:28,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149820 conditions, 8281 events. 4262/8281 cut-off events. For 3033/3033 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 63903 event pairs, 12 based on Foata normal form. 17/5858 useless extension candidates. Maximal degree in co-relation 87492. Up to 8213 conditions per place. [2022-12-06 03:13:28,513 INFO L137 encePairwiseOnDemand]: 9/26 looper letters, 1084 selfloop transitions, 125 changer transitions 1224/2433 dead transitions. [2022-12-06 03:13:28,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 2433 transitions, 89414 flow [2022-12-06 03:13:28,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-06 03:13:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-06 03:13:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 258 transitions. [2022-12-06 03:13:28,515 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2918552036199095 [2022-12-06 03:13:28,516 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 286 predicate places. [2022-12-06 03:13:28,516 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:13:28,516 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 306 places, 2433 transitions, 89414 flow [2022-12-06 03:13:28,603 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 306 places, 2433 transitions, 89414 flow [2022-12-06 03:13:28,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:13:28,608 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:13:28,609 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 03:13:28,609 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 2433 transitions, 89414 flow [2022-12-06 03:13:28,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:28,609 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:13:28,609 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:13:28,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-06 03:13:28,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 03:13:28,815 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:13:28,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:13:28,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1955330266, now seen corresponding path program 5 times [2022-12-06 03:13:28,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:13:28,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545149240] [2022-12-06 03:13:28,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:28,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:13:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:29,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:13:29,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545149240] [2022-12-06 03:13:29,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545149240] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:13:29,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783864142] [2022-12-06 03:13:29,075 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 03:13:29,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:13:29,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:13:29,076 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:13:29,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 03:13:29,266 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 03:13:29,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:13:29,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 03:13:29,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:13:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 03:13:29,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:13:29,431 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 03:13:29,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783864142] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:13:29,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:13:29,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2022-12-06 03:13:29,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687260447] [2022-12-06 03:13:29,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:13:29,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 03:13:29,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:13:29,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 03:13:29,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-12-06 03:13:29,433 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 03:13:29,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 2433 transitions, 89414 flow. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:29,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:13:29,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 03:13:29,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:13:33,333 INFO L130 PetriNetUnfolder]: 3019/5872 cut-off events. [2022-12-06 03:13:33,333 INFO L131 PetriNetUnfolder]: For 2627/2627 co-relation queries the response was YES. [2022-12-06 03:13:33,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112070 conditions, 5872 events. 3019/5872 cut-off events. For 2627/2627 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 45160 event pairs, 12 based on Foata normal form. 0/4148 useless extension candidates. Maximal degree in co-relation 54359. Up to 5804 conditions per place. [2022-12-06 03:13:33,357 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 423 selfloop transitions, 214 changer transitions 1084/1721 dead transitions. [2022-12-06 03:13:33,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 1721 transitions, 66702 flow [2022-12-06 03:13:33,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 03:13:33,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 03:13:33,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 247 transitions. [2022-12-06 03:13:33,358 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31666666666666665 [2022-12-06 03:13:33,358 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 290 predicate places. [2022-12-06 03:13:33,359 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:13:33,359 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 310 places, 1721 transitions, 66702 flow [2022-12-06 03:13:33,417 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 310 places, 1721 transitions, 66702 flow [2022-12-06 03:13:33,417 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:13:33,420 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:13:33,421 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-06 03:13:33,421 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 1721 transitions, 66702 flow [2022-12-06 03:13:33,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:33,421 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:13:33,421 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:13:33,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-06 03:13:33,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:13:33,626 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:13:33,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:13:33,626 INFO L85 PathProgramCache]: Analyzing trace with hash -393057176, now seen corresponding path program 1 times [2022-12-06 03:13:33,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:13:33,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869422992] [2022-12-06 03:13:33,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:33,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:13:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:34,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:13:34,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869422992] [2022-12-06 03:13:34,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869422992] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:13:34,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541117321] [2022-12-06 03:13:34,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:13:34,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:13:34,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:13:34,704 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:13:34,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 03:13:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:13:34,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 03:13:34,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:13:35,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:13:35,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 18 [2022-12-06 03:13:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:35,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:13:35,693 INFO L321 Elim1Store]: treesize reduction 26, result has 82.3 percent of original size [2022-12-06 03:13:35,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 298 treesize of output 300 [2022-12-06 03:13:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:13:37,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541117321] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:13:37,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:13:37,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-06 03:13:37,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038227125] [2022-12-06 03:13:37,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:13:37,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 03:13:37,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:13:37,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 03:13:37,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2022-12-06 03:13:37,100 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 03:13:37,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 1721 transitions, 66702 flow. Second operand has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:13:37,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:13:37,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 03:13:37,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:13:58,808 INFO L130 PetriNetUnfolder]: 11698/21804 cut-off events. [2022-12-06 03:13:58,808 INFO L131 PetriNetUnfolder]: For 5848/5848 co-relation queries the response was YES. [2022-12-06 03:13:58,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438239 conditions, 21804 events. 11698/21804 cut-off events. For 5848/5848 co-relation queries the response was YES. Maximal size of possible extension queue 1311. Compared 195612 event pairs, 12 based on Foata normal form. 114/14840 useless extension candidates. Maximal degree in co-relation 328142. Up to 21736 conditions per place. [2022-12-06 03:13:58,926 INFO L137 encePairwiseOnDemand]: 7/26 looper letters, 2003 selfloop transitions, 1224 changer transitions 2965/6192 dead transitions. [2022-12-06 03:13:58,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 6192 transitions, 252296 flow [2022-12-06 03:13:58,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-12-06 03:13:58,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2022-12-06 03:13:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 1019 transitions. [2022-12-06 03:13:58,931 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3239033693579148 [2022-12-06 03:13:58,936 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 410 predicate places. [2022-12-06 03:13:58,937 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:13:58,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 430 places, 6192 transitions, 252296 flow [2022-12-06 03:13:59,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 430 places, 6192 transitions, 252296 flow [2022-12-06 03:13:59,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:14:02,666 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:14:02,666 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3730 [2022-12-06 03:14:02,667 INFO L495 AbstractCegarLoop]: Abstraction has has 429 places, 6191 transitions, 252256 flow [2022-12-06 03:14:02,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:14:02,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:14:02,667 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:14:02,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-06 03:14:02,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:14:02,872 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:14:02,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:14:02,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1901661389, now seen corresponding path program 1 times [2022-12-06 03:14:02,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:14:02,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108640646] [2022-12-06 03:14:02,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:14:02,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:14:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:14:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:14:04,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:14:04,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108640646] [2022-12-06 03:14:04,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108640646] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:14:04,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423223512] [2022-12-06 03:14:04,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:14:04,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:14:04,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:14:04,380 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:14:04,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 03:14:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:14:04,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 03:14:04,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:14:04,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:14:04,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 18 [2022-12-06 03:14:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:14:04,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:14:05,303 INFO L321 Elim1Store]: treesize reduction 26, result has 82.3 percent of original size [2022-12-06 03:14:05,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 274 treesize of output 276 [2022-12-06 03:14:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:14:06,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423223512] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:14:06,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:14:06,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-12-06 03:14:06,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293683874] [2022-12-06 03:14:06,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:14:06,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 03:14:06,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:14:06,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 03:14:06,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2022-12-06 03:14:06,323 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 03:14:06,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 6191 transitions, 252256 flow. Second operand has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:14:06,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:14:06,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 03:14:06,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:15:21,938 INFO L130 PetriNetUnfolder]: 16654/30835 cut-off events. [2022-12-06 03:15:21,939 INFO L131 PetriNetUnfolder]: For 7938/7938 co-relation queries the response was YES. [2022-12-06 03:15:21,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650605 conditions, 30835 events. 16654/30835 cut-off events. For 7938/7938 co-relation queries the response was YES. Maximal size of possible extension queue 1581. Compared 284328 event pairs, 15 based on Foata normal form. 82/20769 useless extension candidates. Maximal degree in co-relation 469827. Up to 30761 conditions per place. [2022-12-06 03:15:22,110 INFO L137 encePairwiseOnDemand]: 11/27 looper letters, 3648 selfloop transitions, 770 changer transitions 4269/8687 dead transitions. [2022-12-06 03:15:22,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 8687 transitions, 371345 flow [2022-12-06 03:15:22,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 03:15:22,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 03:15:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 275 transitions. [2022-12-06 03:15:22,111 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31828703703703703 [2022-12-06 03:15:22,117 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 440 predicate places. [2022-12-06 03:15:22,118 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:15:22,118 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 460 places, 8687 transitions, 371345 flow [2022-12-06 03:15:22,680 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 460 places, 8687 transitions, 371345 flow [2022-12-06 03:15:22,680 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:15:22,698 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:15:22,698 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 580 [2022-12-06 03:15:22,698 INFO L495 AbstractCegarLoop]: Abstraction has has 460 places, 8687 transitions, 371345 flow [2022-12-06 03:15:22,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:15:22,698 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:15:22,699 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:15:22,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 03:15:22,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:15:22,905 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:15:22,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:15:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash 895166139, now seen corresponding path program 2 times [2022-12-06 03:15:22,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:15:22,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402401169] [2022-12-06 03:15:22,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:15:22,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:15:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:15:24,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:15:24,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:15:24,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402401169] [2022-12-06 03:15:24,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402401169] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:15:24,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569582387] [2022-12-06 03:15:24,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:15:24,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:15:24,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:15:24,835 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:15:24,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 03:15:25,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:15:25,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:15:25,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 03:15:25,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:15:25,241 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:15:25,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 18 [2022-12-06 03:15:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:15:25,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:15:25,812 INFO L321 Elim1Store]: treesize reduction 26, result has 82.3 percent of original size [2022-12-06 03:15:25,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 274 treesize of output 276 [2022-12-06 03:15:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:15:26,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569582387] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:15:26,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:15:26,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-12-06 03:15:26,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438451396] [2022-12-06 03:15:26,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:15:26,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 03:15:26,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:15:26,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 03:15:26,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2022-12-06 03:15:26,574 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 03:15:26,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 8687 transitions, 371345 flow. Second operand has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:15:26,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:15:26,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 03:15:26,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:18:27,093 INFO L130 PetriNetUnfolder]: 23440/43234 cut-off events. [2022-12-06 03:18:27,094 INFO L131 PetriNetUnfolder]: For 10431/10431 co-relation queries the response was YES. [2022-12-06 03:18:27,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955509 conditions, 43234 events. 23440/43234 cut-off events. For 10431/10431 co-relation queries the response was YES. Maximal size of possible extension queue 2210. Compared 416244 event pairs, 15 based on Foata normal form. 188/29068 useless extension candidates. Maximal degree in co-relation 696024. Up to 43160 conditions per place. [2022-12-06 03:18:27,352 INFO L137 encePairwiseOnDemand]: 11/27 looper letters, 5046 selfloop transitions, 1146 changer transitions 5937/12129 dead transitions. [2022-12-06 03:18:27,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 12129 transitions, 542747 flow [2022-12-06 03:18:27,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-06 03:18:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-06 03:18:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 296 transitions. [2022-12-06 03:18:27,358 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3224400871459695 [2022-12-06 03:18:27,359 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 473 predicate places. [2022-12-06 03:18:27,359 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:18:27,359 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 493 places, 12129 transitions, 542747 flow [2022-12-06 03:18:28,036 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 493 places, 12129 transitions, 542747 flow [2022-12-06 03:18:28,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:18:28,057 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:18:28,058 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 699 [2022-12-06 03:18:28,058 INFO L495 AbstractCegarLoop]: Abstraction has has 493 places, 12129 transitions, 542747 flow [2022-12-06 03:18:28,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:18:28,058 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:18:28,058 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:18:28,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 03:18:28,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:18:28,263 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:18:28,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:18:28,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1019396961, now seen corresponding path program 3 times [2022-12-06 03:18:28,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:18:28,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663455837] [2022-12-06 03:18:28,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:18:28,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:18:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:18:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:18:30,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:18:30,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663455837] [2022-12-06 03:18:30,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663455837] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:18:30,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137529814] [2022-12-06 03:18:30,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:18:30,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:18:30,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:18:30,136 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:18:30,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 03:18:30,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-06 03:18:30,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:18:30,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-06 03:18:30,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:18:30,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:18:30,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:18:30,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:18:30,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:18:30,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2022-12-06 03:18:30,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:18:30,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:18:30,796 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:18:30,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 31 [2022-12-06 03:18:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:18:30,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:18:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:18:31,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137529814] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:18:31,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:18:31,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-06 03:18:31,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979564482] [2022-12-06 03:18:31,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:18:31,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-06 03:18:31,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:18:31,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-06 03:18:31,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=816, Unknown=2, NotChecked=0, Total=1056 [2022-12-06 03:18:31,882 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 03:18:31,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 12129 transitions, 542747 flow. Second operand has 33 states, 32 states have (on average 1.71875) internal successors, (55), 32 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:18:31,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:18:31,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 03:18:31,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:01,118 INFO L130 PetriNetUnfolder]: 30168/55770 cut-off events. [2022-12-06 03:24:01,118 INFO L131 PetriNetUnfolder]: For 12842/12842 co-relation queries the response was YES. [2022-12-06 03:24:01,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1288404 conditions, 55770 events. 30168/55770 cut-off events. For 12842/12842 co-relation queries the response was YES. Maximal size of possible extension queue 2878. Compared 559758 event pairs, 15 based on Foata normal form. 100/37453 useless extension candidates. Maximal degree in co-relation 867523. Up to 55696 conditions per place. [2022-12-06 03:24:01,620 INFO L137 encePairwiseOnDemand]: 8/27 looper letters, 6880 selfloop transitions, 1001 changer transitions 7763/15644 dead transitions. [2022-12-06 03:24:01,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 15644 transitions, 731359 flow [2022-12-06 03:24:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-06 03:24:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2022-12-06 03:24:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 420 transitions. [2022-12-06 03:24:01,622 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32407407407407407 [2022-12-06 03:24:01,623 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 520 predicate places. [2022-12-06 03:24:01,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:01,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 540 places, 15644 transitions, 731359 flow [2022-12-06 03:24:02,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 540 places, 15644 transitions, 731359 flow [2022-12-06 03:24:02,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:06,274 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:24:06,275 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4652 [2022-12-06 03:24:06,275 INFO L495 AbstractCegarLoop]: Abstraction has has 539 places, 15643 transitions, 731313 flow [2022-12-06 03:24:06,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.71875) internal successors, (55), 32 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:06,275 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:06,275 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:06,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 03:24:06,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:06,482 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:06,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:06,482 INFO L85 PathProgramCache]: Analyzing trace with hash -184131953, now seen corresponding path program 4 times [2022-12-06 03:24:06,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:06,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981418556] [2022-12-06 03:24:06,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:06,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:08,454 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:08,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:08,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981418556] [2022-12-06 03:24:08,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981418556] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:08,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126029547] [2022-12-06 03:24:08,455 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:24:08,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:08,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:08,456 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:24:08,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 03:24:08,564 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:24:08,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:24:08,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 03:24:08,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:08,810 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:24:08,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 24 [2022-12-06 03:24:08,832 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:08,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:24:09,677 INFO L321 Elim1Store]: treesize reduction 40, result has 84.4 percent of original size [2022-12-06 03:24:09,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 322 treesize of output 384 [2022-12-06 03:24:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:12,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126029547] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:24:12,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:24:12,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 28 [2022-12-06 03:24:12,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082629823] [2022-12-06 03:24:12,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:24:12,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-06 03:24:12,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:12,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-06 03:24:12,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2022-12-06 03:24:12,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 03:24:12,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 15643 transitions, 731313 flow. Second operand has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:12,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:12,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 03:24:12,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 03:25:57,016 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:25:57,016 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:25:57,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-06 03:25:57,030 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 03:25:57,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 03:25:57,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:57,237 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (30states, 0/28 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 322470 conditions, 13412 events (7689/13411 cut-off events. For 3531/3531 co-relation queries the response was YES. Maximal size of possible extension queue 2279. Compared 120511 event pairs, 15 based on Foata normal form. 0/10291 useless extension candidates. Maximal degree in co-relation 115689. Up to 13337 conditions per place.). [2022-12-06 03:25:57,238 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 03:25:57,238 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 03:25:57,239 INFO L458 BasicCegarLoop]: Path program histogram: [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:25:57,241 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 03:25:57,241 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 03:25:57,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 03:25:57 BasicIcfg [2022-12-06 03:25:57,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 03:25:57,243 INFO L158 Benchmark]: Toolchain (without parser) took 828604.76ms. Allocated memory was 191.9MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 168.3MB in the beginning and 338.0MB in the end (delta: -169.7MB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-06 03:25:57,243 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 168.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 03:25:57,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.31ms. Allocated memory is still 191.9MB. Free memory was 168.3MB in the beginning and 156.4MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 03:25:57,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.53ms. Allocated memory is still 191.9MB. Free memory was 156.4MB in the beginning and 154.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 03:25:57,244 INFO L158 Benchmark]: Boogie Preprocessor took 37.06ms. Allocated memory is still 191.9MB. Free memory was 154.3MB in the beginning and 152.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 03:25:57,244 INFO L158 Benchmark]: RCFGBuilder took 512.76ms. Allocated memory is still 191.9MB. Free memory was 152.7MB in the beginning and 131.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 03:25:57,244 INFO L158 Benchmark]: TraceAbstraction took 827820.79ms. Allocated memory was 191.9MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 131.2MB in the beginning and 338.0MB in the end (delta: -206.8MB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-06 03:25:57,245 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 168.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.31ms. Allocated memory is still 191.9MB. Free memory was 168.3MB in the beginning and 156.4MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.53ms. Allocated memory is still 191.9MB. Free memory was 156.4MB in the beginning and 154.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.06ms. Allocated memory is still 191.9MB. Free memory was 154.3MB in the beginning and 152.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 512.76ms. Allocated memory is still 191.9MB. Free memory was 152.7MB in the beginning and 131.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 827820.79ms. Allocated memory was 191.9MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 131.2MB in the beginning and 338.0MB in the end (delta: -206.8MB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 108 PlacesBefore, 20 PlacesAfterwards, 112 TransitionsBefore, 16 TransitionsAfterwards, 704 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 62 TrivialYvCompositions, 26 ConcurrentYvCompositions, 8 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 402, independent: 400, independent conditional: 400, 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: 402, independent: 400, independent conditional: 0, independent unconditional: 400, 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: 402, independent: 400, independent conditional: 0, independent unconditional: 400, 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: 402, independent: 400, independent conditional: 0, independent unconditional: 400, 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: 362, independent: 360, independent conditional: 0, independent unconditional: 360, 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: 362, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 402, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 362, unknown conditional: 0, unknown unconditional: 362] , Statistics on independence cache: Total cache size (in pairs): 632, Positive cache size: 630, Positive conditional cache size: 0, Positive unconditional cache size: 630, 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: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 22 PlacesBefore, 22 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 20 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 24 PlacesBefore, 24 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 8 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 27 PlacesBefore, 26 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 42 PlacesBefore, 40 PlacesAfterwards, 140 TransitionsBefore, 138 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 183 TransitionsBefore, 183 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 191 TransitionsBefore, 191 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 165 TransitionsBefore, 165 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 213 TransitionsBefore, 213 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 73 PlacesBefore, 72 PlacesAfterwards, 271 TransitionsBefore, 270 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 96 PlacesBefore, 96 PlacesAfterwards, 403 TransitionsBefore, 403 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 134 PlacesBefore, 134 PlacesAfterwards, 760 TransitionsBefore, 760 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 154 PlacesBefore, 153 PlacesAfterwards, 908 TransitionsBefore, 907 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 162 PlacesBefore, 162 PlacesAfterwards, 918 TransitionsBefore, 918 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 222 PlacesBefore, 222 PlacesAfterwards, 1693 TransitionsBefore, 1693 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 240 PlacesBefore, 240 PlacesAfterwards, 1836 TransitionsBefore, 1836 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 282 PlacesBefore, 282 PlacesAfterwards, 2838 TransitionsBefore, 2838 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 306 PlacesBefore, 306 PlacesAfterwards, 2433 TransitionsBefore, 2433 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 310 PlacesBefore, 310 PlacesAfterwards, 1721 TransitionsBefore, 1721 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 430 PlacesBefore, 429 PlacesAfterwards, 6192 TransitionsBefore, 6191 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 460 PlacesBefore, 460 PlacesAfterwards, 8687 TransitionsBefore, 8687 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 493 PlacesBefore, 493 PlacesAfterwards, 12129 TransitionsBefore, 12129 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 540 PlacesBefore, 539 PlacesAfterwards, 15644 TransitionsBefore, 15643 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (30states, 0/28 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 322470 conditions, 13412 events (7689/13411 cut-off events. For 3531/3531 co-relation queries the response was YES. Maximal size of possible extension queue 2279. Compared 120511 event pairs, 15 based on Foata normal form. 0/10291 useless extension candidates. Maximal degree in co-relation 115689. Up to 13337 conditions per place.). - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (30states, 0/28 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 322470 conditions, 13412 events (7689/13411 cut-off events. For 3531/3531 co-relation queries the response was YES. Maximal size of possible extension queue 2279. Compared 120511 event pairs, 15 based on Foata normal form. 0/10291 useless extension candidates. Maximal degree in co-relation 115689. Up to 13337 conditions per place.). - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (30states, 0/28 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 322470 conditions, 13412 events (7689/13411 cut-off events. For 3531/3531 co-relation queries the response was YES. Maximal size of possible extension queue 2279. Compared 120511 event pairs, 15 based on Foata normal form. 0/10291 useless extension candidates. Maximal degree in co-relation 115689. Up to 13337 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 138 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: 827.7s, OverallIterations: 23, TraceHistogramMax: 4, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 756.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 43 mSolverCounterUnknown, 6892 SdHoareTripleChecker+Valid, 16.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6892 mSDsluCounter, 124 SdHoareTripleChecker+Invalid, 14.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 1767 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21852 IncrementalHoareTripleChecker+Invalid, 23681 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1767 mSolverCounterUnsat, 18 mSDtfsCounter, 21852 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1261 GetRequests, 365 SyntacticMatches, 15 SemanticMatches, 881 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 16577 ImplicationChecksByTransitivity, 38.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=731359occurred in iteration=22, InterpolantAutomatonStates: 628, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 38.8s InterpolantComputationTime, 704 NumberOfCodeBlocks, 704 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 954 ConstructedInterpolants, 13 QuantifiedInterpolants, 29890 SizeOfPredicates, 375 NumberOfNonLiveVariables, 3701 ConjunctsInSsa, 578 ConjunctsInUnsatCore, 60 InterpolantComputations, 5 PerfectInterpolantSequences, 103/557 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown