/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-prod-cons.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 03:10:07,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 03:10:07,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 03:10:07,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 03:10:07,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 03:10:07,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 03:10:07,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 03:10:07,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 03:10:07,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 03:10:07,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 03:10:07,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 03:10:07,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 03:10:07,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 03:10:07,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 03:10:07,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 03:10:07,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 03:10:07,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 03:10:07,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 03:10:07,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 03:10:07,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 03:10:07,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 03:10:07,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 03:10:07,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 03:10:07,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 03:10:07,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 03:10:07,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 03:10:07,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 03:10:07,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 03:10:07,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 03:10:07,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 03:10:07,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 03:10:07,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 03:10:07,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 03:10:07,206 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 03:10:07,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 03:10:07,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 03:10:07,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 03:10:07,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 03:10:07,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 03:10:07,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 03:10:07,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 03:10:07,210 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:10:07,234 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 03:10:07,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 03:10:07,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 03:10:07,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 03:10:07,237 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 03:10:07,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 03:10:07,238 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 03:10:07,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 03:10:07,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 03:10:07,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 03:10:07,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 03:10:07,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 03:10:07,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 03:10:07,239 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 03:10:07,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 03:10:07,239 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 03:10:07,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 03:10:07,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 03:10:07,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 03:10:07,240 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 03:10:07,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 03:10:07,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:10:07,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 03:10:07,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 03:10:07,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 03:10:07,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 03:10:07,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 03:10:07,241 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 03:10:07,241 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:10:07,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 03:10:07,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 03:10:07,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 03:10:07,527 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 03:10:07,530 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 03:10:07,531 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-12-06 03:10:08,528 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 03:10:08,735 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 03:10:08,736 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-12-06 03:10:08,742 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a7c7214/5db68dc422e14cc98c3bf4a84e09bc3d/FLAG6774fae51 [2022-12-06 03:10:08,751 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a7c7214/5db68dc422e14cc98c3bf4a84e09bc3d [2022-12-06 03:10:08,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 03:10:08,754 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 03:10:08,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 03:10:08,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 03:10:08,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 03:10:08,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:10:08" (1/1) ... [2022-12-06 03:10:08,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b9f61f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:08, skipping insertion in model container [2022-12-06 03:10:08,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:10:08" (1/1) ... [2022-12-06 03:10:08,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 03:10:08,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 03:10:08,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:08,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:08,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:08,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:08,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:08,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:08,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:08,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:08,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:08,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:08,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:08,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:08,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:08,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:08,934 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-prod-cons.wvr.c[3056,3069] [2022-12-06 03:10:08,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:10:08,946 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 03:10:08,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:08,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:08,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:08,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:08,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:08,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:08,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:08,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:08,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:08,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:08,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:08,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:08,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:10:08,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:10:08,964 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-prod-cons.wvr.c[3056,3069] [2022-12-06 03:10:08,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:10:08,974 INFO L208 MainTranslator]: Completed translation [2022-12-06 03:10:08,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:08 WrapperNode [2022-12-06 03:10:08,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 03:10:08,976 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 03:10:08,976 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 03:10:08,976 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 03:10:08,980 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:10:08" (1/1) ... [2022-12-06 03:10:08,985 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:10:08" (1/1) ... [2022-12-06 03:10:09,000 INFO L138 Inliner]: procedures = 25, calls = 50, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 166 [2022-12-06 03:10:09,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 03:10:09,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 03:10:09,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 03:10:09,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 03:10:09,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:08" (1/1) ... [2022-12-06 03:10:09,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:08" (1/1) ... [2022-12-06 03:10:09,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:08" (1/1) ... [2022-12-06 03:10:09,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:08" (1/1) ... [2022-12-06 03:10:09,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:08" (1/1) ... [2022-12-06 03:10:09,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:08" (1/1) ... [2022-12-06 03:10:09,029 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:08" (1/1) ... [2022-12-06 03:10:09,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:08" (1/1) ... [2022-12-06 03:10:09,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 03:10:09,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 03:10:09,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 03:10:09,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 03:10:09,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:08" (1/1) ... [2022-12-06 03:10:09,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:10:09,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:10:09,075 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:10:09,078 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:10:09,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 03:10:09,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 03:10:09,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 03:10:09,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 03:10:09,135 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 03:10:09,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 03:10:09,136 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 03:10:09,136 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 03:10:09,136 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 03:10:09,136 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 03:10:09,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 03:10:09,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 03:10:09,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 03:10:09,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 03:10:09,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 03:10:09,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 03:10:09,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 03:10:09,138 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:10:09,277 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 03:10:09,278 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 03:10:09,593 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 03:10:09,671 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 03:10:09,671 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 03:10:09,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:10:09 BoogieIcfgContainer [2022-12-06 03:10:09,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 03:10:09,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 03:10:09,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 03:10:09,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 03:10:09,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 03:10:08" (1/3) ... [2022-12-06 03:10:09,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a7b583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:10:09, skipping insertion in model container [2022-12-06 03:10:09,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:10:08" (2/3) ... [2022-12-06 03:10:09,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a7b583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:10:09, skipping insertion in model container [2022-12-06 03:10:09,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:10:09" (3/3) ... [2022-12-06 03:10:09,681 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons.wvr.c [2022-12-06 03:10:09,695 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 03:10:09,695 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 03:10:09,695 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 03:10:09,763 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 03:10:09,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 144 transitions, 312 flow [2022-12-06 03:10:09,887 INFO L130 PetriNetUnfolder]: 11/141 cut-off events. [2022-12-06 03:10:09,887 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:10:09,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 11/141 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 82 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 112. Up to 3 conditions per place. [2022-12-06 03:10:09,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 144 transitions, 312 flow [2022-12-06 03:10:09,898 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 131 transitions, 280 flow [2022-12-06 03:10:09,899 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:09,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 131 transitions, 280 flow [2022-12-06 03:10:09,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 131 transitions, 280 flow [2022-12-06 03:10:09,939 INFO L130 PetriNetUnfolder]: 11/131 cut-off events. [2022-12-06 03:10:09,940 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:10:09,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 11/131 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 81 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 112. Up to 3 conditions per place. [2022-12-06 03:10:09,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 131 transitions, 280 flow [2022-12-06 03:10:09,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 1082 [2022-12-06 03:10:14,707 INFO L203 LiptonReduction]: Total number of compositions: 105 [2022-12-06 03:10:14,724 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 03:10:14,728 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;@6df122da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 03:10:14,728 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 03:10:14,732 INFO L130 PetriNetUnfolder]: 3/24 cut-off events. [2022-12-06 03:10:14,732 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:10:14,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:14,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:10:14,733 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:10:14,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:14,736 INFO L85 PathProgramCache]: Analyzing trace with hash -929749668, now seen corresponding path program 1 times [2022-12-06 03:10:14,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:14,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880705605] [2022-12-06 03:10:14,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:14,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:15,062 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:10:15,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:15,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880705605] [2022-12-06 03:10:15,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880705605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:10:15,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:10:15,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:10:15,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515279070] [2022-12-06 03:10:15,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:10:15,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:10:15,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:15,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:10:15,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:10:15,090 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 03:10:15,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:15,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:15,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 03:10:15,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:15,227 INFO L130 PetriNetUnfolder]: 238/394 cut-off events. [2022-12-06 03:10:15,227 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-12-06 03:10:15,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 394 events. 238/394 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1526 event pairs, 14 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 687. Up to 129 conditions per place. [2022-12-06 03:10:15,234 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 44 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2022-12-06 03:10:15,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 230 flow [2022-12-06 03:10:15,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:10:15,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:10:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-06 03:10:15,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.488 [2022-12-06 03:10:15,246 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2022-12-06 03:10:15,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:15,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 51 transitions, 230 flow [2022-12-06 03:10:15,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 51 transitions, 230 flow [2022-12-06 03:10:15,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-06 03:10:15,287 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:10:15,291 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 03:10:15,291 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 50 transitions, 228 flow [2022-12-06 03:10:15,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:15,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:15,295 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:10:15,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 03:10:15,298 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:10:15,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:15,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1958544500, now seen corresponding path program 2 times [2022-12-06 03:10:15,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:15,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032575675] [2022-12-06 03:10:15,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:15,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:15,604 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:10:15,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:15,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032575675] [2022-12-06 03:10:15,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032575675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:10:15,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:10:15,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:10:15,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230763802] [2022-12-06 03:10:15,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:10:15,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:10:15,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:15,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:10:15,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:10:15,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 03:10:15,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 50 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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:10:15,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:15,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 03:10:15,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:15,758 INFO L130 PetriNetUnfolder]: 378/602 cut-off events. [2022-12-06 03:10:15,758 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-06 03:10:15,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 602 events. 378/602 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2062 event pairs, 17 based on Foata normal form. 0/545 useless extension candidates. Maximal degree in co-relation 1550. Up to 211 conditions per place. [2022-12-06 03:10:15,760 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 56 selfloop transitions, 6 changer transitions 33/95 dead transitions. [2022-12-06 03:10:15,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 95 transitions, 608 flow [2022-12-06 03:10:15,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:10:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:10:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-12-06 03:10:15,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3791208791208791 [2022-12-06 03:10:15,763 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2022-12-06 03:10:15,763 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:15,764 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 95 transitions, 608 flow [2022-12-06 03:10:15,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 95 transitions, 608 flow [2022-12-06 03:10:15,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:10:15,767 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:10:15,767 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 03:10:15,767 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 95 transitions, 608 flow [2022-12-06 03:10:15,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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:10:15,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:15,768 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:10:15,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 03:10:15,768 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:10:15,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:15,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1921986933, now seen corresponding path program 1 times [2022-12-06 03:10:15,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:15,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32870321] [2022-12-06 03:10:15,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:15,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:10:15,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:15,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32870321] [2022-12-06 03:10:15,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32870321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:10:15,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:10:15,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:10:15,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056457071] [2022-12-06 03:10:15,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:10:15,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:10:15,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:15,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:10:15,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:10:15,849 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 03:10:15,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 95 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:10:15,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:15,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 03:10:15,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:15,920 INFO L130 PetriNetUnfolder]: 387/639 cut-off events. [2022-12-06 03:10:15,920 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2022-12-06 03:10:15,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2617 conditions, 639 events. 387/639 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2285 event pairs, 17 based on Foata normal form. 38/606 useless extension candidates. Maximal degree in co-relation 2168. Up to 486 conditions per place. [2022-12-06 03:10:15,923 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 67 selfloop transitions, 3 changer transitions 60/132 dead transitions. [2022-12-06 03:10:15,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 132 transitions, 1120 flow [2022-12-06 03:10:15,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:10:15,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:10:15,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-06 03:10:15,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2022-12-06 03:10:15,924 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2022-12-06 03:10:15,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:15,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 132 transitions, 1120 flow [2022-12-06 03:10:15,928 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 132 transitions, 1120 flow [2022-12-06 03:10:15,928 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:10:15,929 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:10:15,929 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 03:10:15,929 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 132 transitions, 1120 flow [2022-12-06 03:10:15,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:10:15,929 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:15,930 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:10:15,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 03:10:15,930 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:10:15,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:15,930 INFO L85 PathProgramCache]: Analyzing trace with hash -322028092, now seen corresponding path program 1 times [2022-12-06 03:10:15,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:15,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730514877] [2022-12-06 03:10:15,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:15,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:16,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 03:10:16,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:16,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730514877] [2022-12-06 03:10:16,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730514877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:10:16,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:10:16,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:10:16,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662970079] [2022-12-06 03:10:16,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:10:16,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:10:16,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:16,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:10:16,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:10:16,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 03:10:16,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 132 transitions, 1120 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:10:16,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:16,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 03:10:16,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:16,137 INFO L130 PetriNetUnfolder]: 464/792 cut-off events. [2022-12-06 03:10:16,138 INFO L131 PetriNetUnfolder]: For 125/125 co-relation queries the response was YES. [2022-12-06 03:10:16,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3989 conditions, 792 events. 464/792 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3100 event pairs, 34 based on Foata normal form. 16/720 useless extension candidates. Maximal degree in co-relation 2687. Up to 624 conditions per place. [2022-12-06 03:10:16,141 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 69 selfloop transitions, 2 changer transitions 97/170 dead transitions. [2022-12-06 03:10:16,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 170 transitions, 1787 flow [2022-12-06 03:10:16,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:10:16,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:10:16,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 03:10:16,145 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2022-12-06 03:10:16,145 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2022-12-06 03:10:16,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:16,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 170 transitions, 1787 flow [2022-12-06 03:10:16,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 170 transitions, 1787 flow [2022-12-06 03:10:16,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:10:18,184 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:10:18,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2041 [2022-12-06 03:10:18,186 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 169 transitions, 1777 flow [2022-12-06 03:10:18,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:10:18,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:18,186 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:10:18,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 03:10:18,187 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:10:18,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:18,187 INFO L85 PathProgramCache]: Analyzing trace with hash -40930872, now seen corresponding path program 1 times [2022-12-06 03:10:18,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:18,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180413549] [2022-12-06 03:10:18,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:18,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:18,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:18,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180413549] [2022-12-06 03:10:18,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180413549] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:10:18,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619891707] [2022-12-06 03:10:18,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:18,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:10:18,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:10:18,378 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:10:18,399 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:10:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:18,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 03:10:18,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:10:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:18,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:10:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:18,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619891707] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:10:18,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:10:18,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2022-12-06 03:10:18,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564653851] [2022-12-06 03:10:18,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:10:18,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 03:10:18,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:18,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 03:10:18,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:10:18,587 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 03:10:18,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 169 transitions, 1777 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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:10:18,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:18,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 03:10:18,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:18,799 INFO L130 PetriNetUnfolder]: 911/1532 cut-off events. [2022-12-06 03:10:18,799 INFO L131 PetriNetUnfolder]: For 245/245 co-relation queries the response was YES. [2022-12-06 03:10:18,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9277 conditions, 1532 events. 911/1532 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6722 event pairs, 34 based on Foata normal form. 30/1390 useless extension candidates. Maximal degree in co-relation 7370. Up to 1365 conditions per place. [2022-12-06 03:10:18,806 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 139 selfloop transitions, 16 changer transitions 158/315 dead transitions. [2022-12-06 03:10:18,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 315 transitions, 3941 flow [2022-12-06 03:10:18,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:10:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:10:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-06 03:10:18,807 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 03:10:18,807 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2022-12-06 03:10:18,808 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:18,808 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 315 transitions, 3941 flow [2022-12-06 03:10:18,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 315 transitions, 3941 flow [2022-12-06 03:10:18,852 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:10:18,852 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:10:18,853 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 03:10:18,853 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 315 transitions, 3941 flow [2022-12-06 03:10:18,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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:10:18,853 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:18,854 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:10:18,859 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:10:19,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:10:19,058 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:10:19,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:19,059 INFO L85 PathProgramCache]: Analyzing trace with hash 399087883, now seen corresponding path program 2 times [2022-12-06 03:10:19,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:19,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923491693] [2022-12-06 03:10:19,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:19,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 03:10:19,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:19,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923491693] [2022-12-06 03:10:19,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923491693] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:10:19,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445274154] [2022-12-06 03:10:19,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:10:19,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:10:19,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:10:19,179 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:10:19,202 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:10:19,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:10:19,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:10:19,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 03:10:19,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:10:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 03:10:19,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:10:19,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445274154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:10:19,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:10:19,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-06 03:10:19,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966037105] [2022-12-06 03:10:19,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:10:19,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:10:19,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:19,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:10:19,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:10:19,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 03:10:19,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 315 transitions, 3941 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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:10:19,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:19,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 03:10:19,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:19,656 INFO L130 PetriNetUnfolder]: 1149/1964 cut-off events. [2022-12-06 03:10:19,657 INFO L131 PetriNetUnfolder]: For 353/353 co-relation queries the response was YES. [2022-12-06 03:10:19,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13794 conditions, 1964 events. 1149/1964 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9377 event pairs, 51 based on Foata normal form. 32/1775 useless extension candidates. Maximal degree in co-relation 8577. Up to 1781 conditions per place. [2022-12-06 03:10:19,665 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 154 selfloop transitions, 2 changer transitions 277/435 dead transitions. [2022-12-06 03:10:19,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 435 transitions, 6322 flow [2022-12-06 03:10:19,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:10:19,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:10:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-06 03:10:19,666 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45925925925925926 [2022-12-06 03:10:19,668 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2022-12-06 03:10:19,668 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:19,669 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 435 transitions, 6322 flow [2022-12-06 03:10:19,683 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 435 transitions, 6322 flow [2022-12-06 03:10:19,683 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:10:22,337 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:10:22,338 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2670 [2022-12-06 03:10:22,338 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 434 transitions, 6308 flow [2022-12-06 03:10:22,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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:10:22,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:22,338 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:10:22,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 03:10:22,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 03:10:22,539 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:10:22,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:22,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1972651379, now seen corresponding path program 1 times [2022-12-06 03:10:22,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:22,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408996019] [2022-12-06 03:10:22,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:22,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:23,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:23,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408996019] [2022-12-06 03:10:23,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408996019] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:10:23,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738736054] [2022-12-06 03:10:23,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:23,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:10:23,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:10:23,332 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:10:23,333 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:10:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:23,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 03:10:23,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:10:23,754 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 25 treesize of output 7 [2022-12-06 03:10:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:23,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:10:24,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:10:24,051 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 28 treesize of output 24 [2022-12-06 03:10:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:24,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738736054] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:10:24,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:10:24,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2022-12-06 03:10:24,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209148883] [2022-12-06 03:10:24,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:10:24,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-06 03:10:24,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:24,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-06 03:10:24,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2022-12-06 03:10:24,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 03:10:24,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 434 transitions, 6308 flow. Second operand has 33 states, 33 states have (on average 2.212121212121212) internal successors, (73), 32 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:24,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:24,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 03:10:24,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:35,015 INFO L130 PetriNetUnfolder]: 5914/10170 cut-off events. [2022-12-06 03:10:35,016 INFO L131 PetriNetUnfolder]: For 2445/2445 co-relation queries the response was YES. [2022-12-06 03:10:35,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82422 conditions, 10170 events. 5914/10170 cut-off events. For 2445/2445 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 71279 event pairs, 24 based on Foata normal form. 26/9357 useless extension candidates. Maximal degree in co-relation 47466. Up to 9933 conditions per place. [2022-12-06 03:10:35,110 INFO L137 encePairwiseOnDemand]: 8/28 looper letters, 737 selfloop transitions, 352 changer transitions 2550/3639 dead transitions. [2022-12-06 03:10:35,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 3639 transitions, 60193 flow [2022-12-06 03:10:35,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2022-12-06 03:10:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2022-12-06 03:10:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 1327 transitions. [2022-12-06 03:10:35,122 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25480030721966207 [2022-12-06 03:10:35,123 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 204 predicate places. [2022-12-06 03:10:35,125 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:35,125 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 3639 transitions, 60193 flow [2022-12-06 03:10:35,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 236 places, 3639 transitions, 60193 flow [2022-12-06 03:10:35,252 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:10:37,839 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:10:37,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2717 [2022-12-06 03:10:37,840 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 3638 transitions, 60177 flow [2022-12-06 03:10:37,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.212121212121212) internal successors, (73), 32 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:37,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:37,840 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:10:37,858 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:10:38,045 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:10:38,046 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:10:38,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:38,046 INFO L85 PathProgramCache]: Analyzing trace with hash 542051186, now seen corresponding path program 1 times [2022-12-06 03:10:38,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:38,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821843115] [2022-12-06 03:10:38,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:38,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:38,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:38,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821843115] [2022-12-06 03:10:38,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821843115] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:10:38,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474214957] [2022-12-06 03:10:38,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:38,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:10:38,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:10:38,679 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:10:38,682 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:10:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:38,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 03:10:38,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:10:38,941 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:10:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:39,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:10:39,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:10:39,178 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 28 treesize of output 24 [2022-12-06 03:10:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:39,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474214957] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:10:39,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:10:39,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2022-12-06 03:10:39,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892998449] [2022-12-06 03:10:39,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:10:39,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 03:10:39,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:39,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 03:10:39,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2022-12-06 03:10:39,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 03:10:39,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 3638 transitions, 60177 flow. Second operand has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 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:10:39,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:39,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 03:10:39,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:16,112 INFO L130 PetriNetUnfolder]: 25349/43625 cut-off events. [2022-12-06 03:11:16,112 INFO L131 PetriNetUnfolder]: For 7337/7337 co-relation queries the response was YES. [2022-12-06 03:11:16,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397419 conditions, 43625 events. 25349/43625 cut-off events. For 7337/7337 co-relation queries the response was YES. Maximal size of possible extension queue 1853. Compared 381182 event pairs, 54 based on Foata normal form. 76/40085 useless extension candidates. Maximal degree in co-relation 262124. Up to 43388 conditions per place. [2022-12-06 03:11:16,343 INFO L137 encePairwiseOnDemand]: 10/29 looper letters, 3261 selfloop transitions, 1495 changer transitions 11969/16725 dead transitions. [2022-12-06 03:11:16,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 16725 transitions, 309607 flow [2022-12-06 03:11:16,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 288 states. [2022-12-06 03:11:16,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2022-12-06 03:11:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 1890 transitions. [2022-12-06 03:11:16,357 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22629310344827586 [2022-12-06 03:11:16,358 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 490 predicate places. [2022-12-06 03:11:16,360 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:16,360 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 522 places, 16725 transitions, 309607 flow [2022-12-06 03:11:17,027 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 522 places, 16725 transitions, 309607 flow [2022-12-06 03:11:17,028 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:11:17,038 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] L108-3-->L109-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= (store |v_#memory_int_93| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_93| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre12#1_21|)) |v_#memory_int_92|) (= |v_ULTIMATE.start_main_#t~pre12#1_21| |v_#pthreadsForks_55|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_93|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_21|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_9|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_29|, #memory_int=|v_#memory_int_92|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] and [401] $Ultimate##0-->L48-4: Formula: (= |v_thread1Thread1of1ForFork1_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork1_~w~0#1=|v_thread1Thread1of1ForFork1_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~w~0#1] [2022-12-06 03:11:17,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [546] L48-4-->L55: Formula: (and (= |v_thread1Thread1of1ForFork1_~cond~0#1_25| v_~v_assert~0_66) (< 0 |v_thread1Thread1of1ForFork1_~w~0#1_29|) (not (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_25| 256) 0))) InVars {~v_assert~0=v_~v_assert~0_66, thread1Thread1of1ForFork1_~w~0#1=|v_thread1Thread1of1ForFork1_~w~0#1_29|} OutVars{~v_assert~0=v_~v_assert~0_66, thread1Thread1of1ForFork1_~w~0#1=|v_thread1Thread1of1ForFork1_~w~0#1_29|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] and [533] L108-3-->L109-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= (store |v_#memory_int_93| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_93| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre12#1_21|)) |v_#memory_int_92|) (= |v_ULTIMATE.start_main_#t~pre12#1_21| |v_#pthreadsForks_55|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_93|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_21|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_9|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_29|, #memory_int=|v_#memory_int_92|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 03:11:17,144 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:11:17,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 787 [2022-12-06 03:11:17,145 INFO L495 AbstractCegarLoop]: Abstraction has has 521 places, 16724 transitions, 309603 flow [2022-12-06 03:11:17,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 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:11:17,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:17,145 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:17,158 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:11:17,361 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:11:17,361 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:11:17,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:17,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1955588638, now seen corresponding path program 2 times [2022-12-06 03:11:17,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:17,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139475239] [2022-12-06 03:11:17,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:17,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:18,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:18,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139475239] [2022-12-06 03:11:18,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139475239] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:18,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294184166] [2022-12-06 03:11:18,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:11:18,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:18,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:18,020 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:11:18,022 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:11:18,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:11:18,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:11:18,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-06 03:11:18,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:18,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:11:18,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 03:11:18,362 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:11:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:18,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:18,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:11:18,577 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 50 treesize of output 46 [2022-12-06 03:11:18,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 7 [2022-12-06 03:11:18,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:18,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294184166] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:18,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:18,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-12-06 03:11:18,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550709916] [2022-12-06 03:11:18,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:18,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-06 03:11:18,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:18,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-06 03:11:18,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=742, Unknown=6, NotChecked=0, Total=870 [2022-12-06 03:11:18,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 03:11:18,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 16724 transitions, 309603 flow. Second operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 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:11:18,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:18,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 03:11:18,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:20:04,769 INFO L130 PetriNetUnfolder]: 59540/101210 cut-off events. [2022-12-06 03:20:04,769 INFO L131 PetriNetUnfolder]: For 14743/14743 co-relation queries the response was YES. [2022-12-06 03:20:04,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023356 conditions, 101210 events. 59540/101210 cut-off events. For 14743/14743 co-relation queries the response was YES. Maximal size of possible extension queue 4023. Compared 966587 event pairs, 67 based on Foata normal form. 32/93087 useless extension candidates. Maximal degree in co-relation 697062. Up to 100974 conditions per place. [2022-12-06 03:20:05,271 INFO L137 encePairwiseOnDemand]: 10/31 looper letters, 8158 selfloop transitions, 2429 changer transitions 30222/40809 dead transitions. [2022-12-06 03:20:05,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 40809 transitions, 836829 flow [2022-12-06 03:20:05,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-12-06 03:20:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2022-12-06 03:20:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 806 transitions. [2022-12-06 03:20:05,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2826086956521739 [2022-12-06 03:20:05,274 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 580 predicate places. [2022-12-06 03:20:05,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:20:05,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 612 places, 40809 transitions, 836829 flow [2022-12-06 03:20:07,351 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 612 places, 40809 transitions, 836829 flow [2022-12-06 03:20:07,352 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:20:07,492 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:20:07,492 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2218 [2022-12-06 03:20:07,493 INFO L495 AbstractCegarLoop]: Abstraction has has 612 places, 40809 transitions, 836829 flow [2022-12-06 03:20:07,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 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:20:07,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:20:07,493 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:20:07,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 03:20:07,693 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:20:07,694 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:20:07,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:20:07,694 INFO L85 PathProgramCache]: Analyzing trace with hash -112449992, now seen corresponding path program 3 times [2022-12-06 03:20:07,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:20:07,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904415488] [2022-12-06 03:20:07,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:20:07,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:20:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:20:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:20:08,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:20:08,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904415488] [2022-12-06 03:20:08,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904415488] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:20:08,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129088693] [2022-12-06 03:20:08,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:20:08,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:20:08,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:20:08,982 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:20:08,983 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:20:09,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-06 03:20:09,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:20:09,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 03:20:09,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:20:09,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:20:09,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 98 treesize of output 94 [2022-12-06 03:20:09,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:20:09,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 03:20:09,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 03:20:09,429 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:20:09,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:20:09,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:20:11,895 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:20:11,895 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 96 treesize of output 92 [2022-12-06 03:20:11,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 76 treesize of output 64 [2022-12-06 03:20:11,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 28 [2022-12-06 03:20:12,093 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:20:12,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129088693] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:20:12,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:20:12,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2022-12-06 03:20:12,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418334825] [2022-12-06 03:20:12,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:20:12,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-06 03:20:12,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:20:12,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-06 03:20:12,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=955, Unknown=3, NotChecked=0, Total=1122 [2022-12-06 03:20:12,094 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 03:20:12,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 40809 transitions, 836829 flow. Second operand has 34 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 33 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:20:12,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:20:12,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 03:20:12,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:22:05,073 WARN L233 SmtUtils]: Spent 10.41s on a formula simplification. DAG size of input: 76 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:22:17,167 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 69 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:23:12,261 WARN L233 SmtUtils]: Spent 10.21s on a formula simplification. DAG size of input: 72 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:23:18,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:23:25,501 WARN L233 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 69 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:23:44,132 WARN L233 SmtUtils]: Spent 10.24s on a formula simplification. DAG size of input: 69 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-12-06 03:23:56,280 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:23:56,280 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:23:56,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-12-06 03:23:56,321 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 03:23:56,328 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:23:56,527 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:23:56,528 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (34states, 0/31 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 126002 conditions, 11267 events (6490/11266 cut-off events. For 2650/2650 co-relation queries the response was YES. Maximal size of possible extension queue 2071. Compared 98885 event pairs, 1 based on Foata normal form. 0/11910 useless extension candidates. Maximal degree in co-relation 81083. Up to 11023 conditions per place.). [2022-12-06 03:23:56,529 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 03:23:56,529 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 03:23:56,529 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 03:23:56,530 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1] [2022-12-06 03:23:56,533 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 03:23:56,533 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 03:23:56,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 03:23:56 BasicIcfg [2022-12-06 03:23:56,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 03:23:56,536 INFO L158 Benchmark]: Toolchain (without parser) took 827782.53ms. Allocated memory was 176.2MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 152.7MB in the beginning and 931.5MB in the end (delta: -778.7MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-06 03:23:56,536 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 152.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 03:23:56,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.79ms. Allocated memory is still 176.2MB. Free memory was 152.7MB in the beginning and 139.6MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 03:23:56,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.54ms. Allocated memory is still 176.2MB. Free memory was 139.1MB in the beginning and 137.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 03:23:56,537 INFO L158 Benchmark]: Boogie Preprocessor took 35.21ms. Allocated memory is still 176.2MB. Free memory was 137.5MB in the beginning and 136.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 03:23:56,537 INFO L158 Benchmark]: RCFGBuilder took 638.33ms. Allocated memory is still 176.2MB. Free memory was 135.4MB in the beginning and 113.4MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-06 03:23:56,537 INFO L158 Benchmark]: TraceAbstraction took 826859.32ms. Allocated memory was 176.2MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 112.4MB in the beginning and 931.5MB in the end (delta: -819.1MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-06 03:23:56,541 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 152.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.79ms. Allocated memory is still 176.2MB. Free memory was 152.7MB in the beginning and 139.6MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.54ms. Allocated memory is still 176.2MB. Free memory was 139.1MB in the beginning and 137.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.21ms. Allocated memory is still 176.2MB. Free memory was 137.5MB in the beginning and 136.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 638.33ms. Allocated memory is still 176.2MB. Free memory was 135.4MB in the beginning and 113.4MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 826859.32ms. Allocated memory was 176.2MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 112.4MB in the beginning and 931.5MB in the end (delta: -819.1MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 130 PlacesBefore, 32 PlacesAfterwards, 131 TransitionsBefore, 25 TransitionsAfterwards, 1082 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 73 TrivialYvCompositions, 25 ConcurrentYvCompositions, 7 ChoiceCompositions, 105 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 786, independent: 762, independent conditional: 762, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 786, independent: 762, independent conditional: 0, independent unconditional: 762, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 786, independent: 762, independent conditional: 0, independent unconditional: 762, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 786, independent: 762, independent conditional: 0, independent unconditional: 762, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 682, independent: 668, independent conditional: 0, independent unconditional: 668, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 682, independent: 667, independent conditional: 0, independent unconditional: 667, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 786, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 682, unknown conditional: 0, unknown unconditional: 682] , Statistics on independence cache: Total cache size (in pairs): 1056, Positive cache size: 1042, Positive conditional cache size: 0, Positive unconditional cache size: 1042, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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, 36 PlacesBefore, 35 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 86 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, 41 PlacesBefore, 41 PlacesAfterwards, 95 TransitionsBefore, 95 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, 43 PlacesBefore, 43 PlacesAfterwards, 132 TransitionsBefore, 132 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, 46 PlacesBefore, 45 PlacesAfterwards, 170 TransitionsBefore, 169 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, 48 PlacesBefore, 48 PlacesAfterwards, 315 TransitionsBefore, 315 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.7s, 52 PlacesBefore, 51 PlacesAfterwards, 435 TransitionsBefore, 434 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: 2.6s, 236 PlacesBefore, 235 PlacesAfterwards, 3639 TransitionsBefore, 3638 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.1s, 522 PlacesBefore, 521 PlacesAfterwards, 16725 TransitionsBefore, 16724 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 612 PlacesBefore, 612 PlacesAfterwards, 40809 TransitionsBefore, 40809 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (34states, 0/31 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 126002 conditions, 11267 events (6490/11266 cut-off events. For 2650/2650 co-relation queries the response was YES. Maximal size of possible extension queue 2071. Compared 98885 event pairs, 1 based on Foata normal form. 0/11910 useless extension candidates. Maximal degree in co-relation 81083. Up to 11023 conditions per place.). - TimeoutResultAtElement [Line: 109]: 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 (34states, 0/31 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 126002 conditions, 11267 events (6490/11266 cut-off events. For 2650/2650 co-relation queries the response was YES. Maximal size of possible extension queue 2071. Compared 98885 event pairs, 1 based on Foata normal form. 0/11910 useless extension candidates. Maximal degree in co-relation 81083. Up to 11023 conditions per place.). - TimeoutResultAtElement [Line: 110]: 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 (34states, 0/31 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 126002 conditions, 11267 events (6490/11266 cut-off events. For 2650/2650 co-relation queries the response was YES. Maximal size of possible extension queue 2071. Compared 98885 event pairs, 1 based on Foata normal form. 0/11910 useless extension candidates. Maximal degree in co-relation 81083. Up to 11023 conditions per place.). - TimeoutResultAtElement [Line: 108]: 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 (34states, 0/31 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 126002 conditions, 11267 events (6490/11266 cut-off events. For 2650/2650 co-relation queries the response was YES. Maximal size of possible extension queue 2071. Compared 98885 event pairs, 1 based on Foata normal form. 0/11910 useless extension candidates. Maximal degree in co-relation 81083. Up to 11023 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 161 locations, 4 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: 826.7s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 799.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 24 mSolverCounterUnknown, 4284 SdHoareTripleChecker+Valid, 12.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4284 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 10.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 907 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15496 IncrementalHoareTripleChecker+Invalid, 16427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 907 mSolverCounterUnsat, 0 mSDtfsCounter, 15496 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 980 GetRequests, 205 SyntacticMatches, 4 SemanticMatches, 771 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67688 ImplicationChecksByTransitivity, 121.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=836829occurred in iteration=9, InterpolantAutomatonStates: 594, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 400 NumberOfCodeBlocks, 400 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 509 ConstructedInterpolants, 7 QuantifiedInterpolants, 6793 SizeOfPredicates, 103 NumberOfNonLiveVariables, 1559 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 49/136 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