/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-more-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:53:40,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:53:40,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:53:40,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:53:40,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:53:40,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:53:40,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:53:40,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:53:40,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:53:40,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:53:40,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:53:40,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:53:40,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:53:40,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:53:40,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:53:40,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:53:40,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:53:40,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:53:40,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:53:40,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:53:40,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:53:40,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:53:40,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:53:40,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:53:40,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:53:40,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:53:40,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:53:40,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:53:40,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:53:40,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:53:40,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:53:40,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:53:40,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:53:40,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:53:40,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:53:40,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:53:40,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:53:40,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:53:40,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:53:40,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:53:40,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:53:40,280 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 02:53:40,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:53:40,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:53:40,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:53:40,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:53:40,305 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:53:40,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:53:40,306 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:53:40,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:53:40,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:53:40,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:53:40,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:53:40,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:53:40,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:53:40,307 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:53:40,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:53:40,307 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:53:40,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:53:40,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:53:40,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:53:40,308 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:53:40,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:53:40,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:53:40,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:53:40,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:53:40,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:53:40,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:53:40,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:53:40,308 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:53:40,309 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 02:53:40,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:53:40,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:53:40,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:53:40,583 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:53:40,583 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:53:40,584 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-12-06 02:53:41,528 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:53:41,727 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:53:41,728 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-12-06 02:53:41,735 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93244b6bd/a0187cf07eea4999a2c8c528b2110c10/FLAGe5fa60cbe [2022-12-06 02:53:41,761 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93244b6bd/a0187cf07eea4999a2c8c528b2110c10 [2022-12-06 02:53:41,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:53:41,764 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:53:41,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:53:41,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:53:41,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:53:41,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:53:41" (1/1) ... [2022-12-06 02:53:41,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e96f47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:53:41, skipping insertion in model container [2022-12-06 02:53:41,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:53:41" (1/1) ... [2022-12-06 02:53:41,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:53:41,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:53:41,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:53:41,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:53:41,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:53:41,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:53:41,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:53:41,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:53:41,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:53:41,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:53:41,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:53:41,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:53:41,962 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-more-dec-subseq.wvr.c[2924,2937] [2022-12-06 02:53:41,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:53:41,986 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:53:42,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:53:42,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:53:42,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:53:42,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:53:42,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:53:42,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:53:42,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:53:42,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:53:42,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:53:42,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:53:42,022 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-more-dec-subseq.wvr.c[2924,2937] [2022-12-06 02:53:42,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:53:42,041 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:53:42,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:53:42 WrapperNode [2022-12-06 02:53:42,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:53:42,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:53:42,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:53:42,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:53:42,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:53:42" (1/1) ... [2022-12-06 02:53:42,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:53:42" (1/1) ... [2022-12-06 02:53:42,095 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-12-06 02:53:42,095 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:53:42,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:53:42,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:53:42,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:53:42,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:53:42" (1/1) ... [2022-12-06 02:53:42,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:53:42" (1/1) ... [2022-12-06 02:53:42,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:53:42" (1/1) ... [2022-12-06 02:53:42,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:53:42" (1/1) ... [2022-12-06 02:53:42,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:53:42" (1/1) ... [2022-12-06 02:53:42,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:53:42" (1/1) ... [2022-12-06 02:53:42,130 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:53:42" (1/1) ... [2022-12-06 02:53:42,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:53:42" (1/1) ... [2022-12-06 02:53:42,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:53:42,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:53:42,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:53:42,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:53:42,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:53:42" (1/1) ... [2022-12-06 02:53:42,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:53:42,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:53:42,183 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 02:53:42,188 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 02:53:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:53:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:53:42,215 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:53:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:53:42,215 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:53:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:53:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:53:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:53:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:53:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:53:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:53:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:53:42,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:53:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:53:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:53:42,217 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 02:53:42,302 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:53:42,303 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:53:42,600 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:53:42,684 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:53:42,684 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 02:53:42,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:53:42 BoogieIcfgContainer [2022-12-06 02:53:42,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:53:42,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:53:42,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:53:42,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:53:42,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:53:41" (1/3) ... [2022-12-06 02:53:42,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a51f4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:53:42, skipping insertion in model container [2022-12-06 02:53:42,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:53:42" (2/3) ... [2022-12-06 02:53:42,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a51f4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:53:42, skipping insertion in model container [2022-12-06 02:53:42,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:53:42" (3/3) ... [2022-12-06 02:53:42,692 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2022-12-06 02:53:42,705 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:53:42,705 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:53:42,706 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:53:42,766 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 02:53:42,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 173 transitions, 362 flow [2022-12-06 02:53:42,883 INFO L130 PetriNetUnfolder]: 15/171 cut-off events. [2022-12-06 02:53:42,883 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:53:42,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 171 events. 15/171 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-06 02:53:42,887 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 173 transitions, 362 flow [2022-12-06 02:53:42,893 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 163 transitions, 338 flow [2022-12-06 02:53:42,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:53:42,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 163 transitions, 338 flow [2022-12-06 02:53:42,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 163 transitions, 338 flow [2022-12-06 02:53:42,973 INFO L130 PetriNetUnfolder]: 15/163 cut-off events. [2022-12-06 02:53:42,973 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:53:42,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 163 events. 15/163 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-06 02:53:42,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 163 transitions, 338 flow [2022-12-06 02:53:42,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-06 02:53:48,242 INFO L203 LiptonReduction]: Total number of compositions: 140 [2022-12-06 02:53:48,253 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:53:48,258 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;@207eaecf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:53:48,258 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 02:53:48,262 INFO L130 PetriNetUnfolder]: 5/22 cut-off events. [2022-12-06 02:53:48,262 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:53:48,262 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:53:48,262 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:53:48,263 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:53:48,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:53:48,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1533171233, now seen corresponding path program 1 times [2022-12-06 02:53:48,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:53:48,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664100905] [2022-12-06 02:53:48,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:53:48,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:53:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:53:48,589 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 02:53:48,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:53:48,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664100905] [2022-12-06 02:53:48,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664100905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:53:48,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:53:48,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:53:48,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797885291] [2022-12-06 02:53:48,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:53:48,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:53:48,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:53:48,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:53:48,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:53:48,612 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 02:53:48,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 02:53:48,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:53:48,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 02:53:48,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:53:48,718 INFO L130 PetriNetUnfolder]: 146/245 cut-off events. [2022-12-06 02:53:48,718 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 02:53:48,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 245 events. 146/245 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 773 event pairs, 38 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 472. Up to 153 conditions per place. [2022-12-06 02:53:48,723 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 31 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2022-12-06 02:53:48,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 35 transitions, 155 flow [2022-12-06 02:53:48,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:53:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:53:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 02:53:48,733 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2022-12-06 02:53:48,737 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2022-12-06 02:53:48,738 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:53:48,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 35 transitions, 155 flow [2022-12-06 02:53:48,745 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 35 transitions, 155 flow [2022-12-06 02:53:48,745 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:53:48,746 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:53:48,748 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 02:53:48,748 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 35 transitions, 155 flow [2022-12-06 02:53:48,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 02:53:48,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:53:48,749 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:53:48,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:53:48,753 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:53:48,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:53:48,754 INFO L85 PathProgramCache]: Analyzing trace with hash 908602455, now seen corresponding path program 1 times [2022-12-06 02:53:48,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:53:48,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597510979] [2022-12-06 02:53:48,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:53:48,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:53:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:53:48,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:53:48,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:53:48,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597510979] [2022-12-06 02:53:48,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597510979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:53:48,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:53:48,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:53:48,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385090637] [2022-12-06 02:53:48,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:53:48,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:53:48,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:53:48,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:53:48,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:53:48,955 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 02:53:48,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 35 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:53:48,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:53:48,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 02:53:48,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:53:49,044 INFO L130 PetriNetUnfolder]: 146/246 cut-off events. [2022-12-06 02:53:49,044 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 02:53:49,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 246 events. 146/246 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 750 event pairs, 38 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 697. Up to 153 conditions per place. [2022-12-06 02:53:49,048 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 31 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2022-12-06 02:53:49,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 231 flow [2022-12-06 02:53:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:53:49,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:53:49,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 02:53:49,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40217391304347827 [2022-12-06 02:53:49,051 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 6 predicate places. [2022-12-06 02:53:49,051 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:53:49,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 36 transitions, 231 flow [2022-12-06 02:53:49,054 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 36 transitions, 231 flow [2022-12-06 02:53:49,054 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:53:49,326 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:53:49,327 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 276 [2022-12-06 02:53:49,328 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 35 transitions, 225 flow [2022-12-06 02:53:49,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:53:49,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:53:49,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:53:49,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:53:49,328 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:53:49,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:53:49,328 INFO L85 PathProgramCache]: Analyzing trace with hash -152775112, now seen corresponding path program 1 times [2022-12-06 02:53:49,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:53:49,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800204725] [2022-12-06 02:53:49,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:53:49,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:53:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:53:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:53:49,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:53:49,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800204725] [2022-12-06 02:53:49,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800204725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:53:49,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:53:49,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:53:49,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740922033] [2022-12-06 02:53:49,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:53:49,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:53:49,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:53:49,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:53:49,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:53:49,462 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 02:53:49,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 35 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:53:49,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:53:49,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 02:53:49,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:53:49,562 INFO L130 PetriNetUnfolder]: 180/301 cut-off events. [2022-12-06 02:53:49,562 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 02:53:49,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1239 conditions, 301 events. 180/301 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1037 event pairs, 2 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 1130. Up to 193 conditions per place. [2022-12-06 02:53:49,564 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 47 selfloop transitions, 19 changer transitions 0/66 dead transitions. [2022-12-06 02:53:49,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 66 transitions, 552 flow [2022-12-06 02:53:49,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:53:49,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:53:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 02:53:49,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3826086956521739 [2022-12-06 02:53:49,566 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 9 predicate places. [2022-12-06 02:53:49,566 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:53:49,566 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 66 transitions, 552 flow [2022-12-06 02:53:49,568 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 66 transitions, 552 flow [2022-12-06 02:53:49,568 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:53:49,569 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:53:49,570 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 02:53:49,570 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 66 transitions, 552 flow [2022-12-06 02:53:49,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:53:49,570 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:53:49,570 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:53:49,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:53:49,570 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:53:49,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:53:49,571 INFO L85 PathProgramCache]: Analyzing trace with hash 955892464, now seen corresponding path program 2 times [2022-12-06 02:53:49,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:53:49,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278169869] [2022-12-06 02:53:49,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:53:49,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:53:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:53:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:53:49,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:53:49,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278169869] [2022-12-06 02:53:49,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278169869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:53:49,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:53:49,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:53:49,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833504402] [2022-12-06 02:53:49,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:53:49,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:53:49,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:53:49,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:53:49,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:53:49,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 02:53:49,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 66 transitions, 552 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:53:49,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:53:49,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 02:53:49,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:53:49,748 INFO L130 PetriNetUnfolder]: 172/293 cut-off events. [2022-12-06 02:53:49,748 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-06 02:53:49,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 293 events. 172/293 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 998 event pairs, 4 based on Foata normal form. 2/247 useless extension candidates. Maximal degree in co-relation 1367. Up to 189 conditions per place. [2022-12-06 02:53:49,750 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 91 selfloop transitions, 10 changer transitions 2/103 dead transitions. [2022-12-06 02:53:49,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 103 transitions, 1057 flow [2022-12-06 02:53:49,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:53:49,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:53:49,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 02:53:49,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2022-12-06 02:53:49,752 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 12 predicate places. [2022-12-06 02:53:49,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:53:49,753 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 103 transitions, 1057 flow [2022-12-06 02:53:49,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 103 transitions, 1057 flow [2022-12-06 02:53:49,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:53:49,756 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:53:49,757 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 02:53:49,757 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 103 transitions, 1057 flow [2022-12-06 02:53:49,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:53:49,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:53:49,758 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:53:49,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:53:49,758 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:53:49,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:53:49,758 INFO L85 PathProgramCache]: Analyzing trace with hash -787018112, now seen corresponding path program 3 times [2022-12-06 02:53:49,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:53:49,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735386532] [2022-12-06 02:53:49,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:53:49,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:53:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:53:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:53:49,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:53:49,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735386532] [2022-12-06 02:53:49,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735386532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:53:49,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:53:49,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 02:53:49,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921825393] [2022-12-06 02:53:49,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:53:49,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:53:49,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:53:49,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:53:49,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:53:49,832 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 02:53:49,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 103 transitions, 1057 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:53:49,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:53:49,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 02:53:49,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:53:49,906 INFO L130 PetriNetUnfolder]: 276/468 cut-off events. [2022-12-06 02:53:49,906 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-06 02:53:49,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2825 conditions, 468 events. 276/468 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1826 event pairs, 4 based on Foata normal form. 1/387 useless extension candidates. Maximal degree in co-relation 2586. Up to 306 conditions per place. [2022-12-06 02:53:49,909 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 132 selfloop transitions, 10 changer transitions 20/167 dead transitions. [2022-12-06 02:53:49,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 167 transitions, 2030 flow [2022-12-06 02:53:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:53:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:53:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 02:53:49,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-06 02:53:49,911 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2022-12-06 02:53:49,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:53:49,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 167 transitions, 2030 flow [2022-12-06 02:53:49,915 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 167 transitions, 2030 flow [2022-12-06 02:53:49,915 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:53:49,916 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:53:49,917 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 02:53:49,917 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 167 transitions, 2030 flow [2022-12-06 02:53:49,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:53:49,917 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:53:49,917 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:53:49,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 02:53:49,917 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:53:49,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:53:49,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1237714328, now seen corresponding path program 1 times [2022-12-06 02:53:49,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:53:49,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457547894] [2022-12-06 02:53:49,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:53:49,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:53:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:53:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:53:50,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:53:50,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457547894] [2022-12-06 02:53:50,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457547894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:53:50,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:53:50,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:53:50,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092686146] [2022-12-06 02:53:50,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:53:50,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:53:50,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:53:50,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:53:50,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:53:50,028 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 02:53:50,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 167 transitions, 2030 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:53:50,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:53:50,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 02:53:50,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:53:50,133 INFO L130 PetriNetUnfolder]: 282/508 cut-off events. [2022-12-06 02:53:50,133 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2022-12-06 02:53:50,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3580 conditions, 508 events. 282/508 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2054 event pairs, 6 based on Foata normal form. 14/442 useless extension candidates. Maximal degree in co-relation 3157. Up to 406 conditions per place. [2022-12-06 02:53:50,137 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 151 selfloop transitions, 7 changer transitions 46/204 dead transitions. [2022-12-06 02:53:50,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 204 transitions, 2901 flow [2022-12-06 02:53:50,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:53:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:53:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 02:53:50,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4260869565217391 [2022-12-06 02:53:50,138 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 18 predicate places. [2022-12-06 02:53:50,139 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:53:50,139 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 204 transitions, 2901 flow [2022-12-06 02:53:50,143 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 204 transitions, 2901 flow [2022-12-06 02:53:50,143 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:53:50,144 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:53:50,144 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 02:53:50,144 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 204 transitions, 2901 flow [2022-12-06 02:53:50,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:53:50,144 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:53:50,144 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 02:53:50,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 02:53:50,145 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:53:50,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:53:50,145 INFO L85 PathProgramCache]: Analyzing trace with hash -190351896, now seen corresponding path program 1 times [2022-12-06 02:53:50,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:53:50,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344615627] [2022-12-06 02:53:50,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:53:50,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:53:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:53:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:53:50,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:53:50,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344615627] [2022-12-06 02:53:50,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344615627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:53:50,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:53:50,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:53:50,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229991323] [2022-12-06 02:53:50,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:53:50,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:53:50,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:53:50,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:53:50,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:53:50,241 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 02:53:50,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 204 transitions, 2901 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 02:53:50,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:53:50,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 02:53:50,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:53:50,337 INFO L130 PetriNetUnfolder]: 349/664 cut-off events. [2022-12-06 02:53:50,337 INFO L131 PetriNetUnfolder]: For 304/304 co-relation queries the response was YES. [2022-12-06 02:53:50,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5295 conditions, 664 events. 349/664 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3061 event pairs, 8 based on Foata normal form. 20/580 useless extension candidates. Maximal degree in co-relation 3578. Up to 516 conditions per place. [2022-12-06 02:53:50,341 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 149 selfloop transitions, 2 changer transitions 114/273 dead transitions. [2022-12-06 02:53:50,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 273 transitions, 4428 flow [2022-12-06 02:53:50,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:53:50,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:53:50,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 02:53:50,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4673913043478261 [2022-12-06 02:53:50,343 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 21 predicate places. [2022-12-06 02:53:50,343 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:53:50,343 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 273 transitions, 4428 flow [2022-12-06 02:53:50,349 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 273 transitions, 4428 flow [2022-12-06 02:53:50,349 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:53:52,874 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:53:52,875 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2532 [2022-12-06 02:53:52,875 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 272 transitions, 4412 flow [2022-12-06 02:53:52,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 02:53:52,875 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:53:52,875 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 02:53:52,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 02:53:52,876 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:53:52,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:53:52,876 INFO L85 PathProgramCache]: Analyzing trace with hash 726727916, now seen corresponding path program 1 times [2022-12-06 02:53:52,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:53:52,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361702259] [2022-12-06 02:53:52,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:53:52,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:53:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:53:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:53:53,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:53:53,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361702259] [2022-12-06 02:53:53,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361702259] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:53:53,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521905607] [2022-12-06 02:53:53,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:53:53,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:53:53,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:53:53,907 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 02:53:53,938 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 02:53:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:53:54,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 02:53:54,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:53:54,369 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-06 02:53:54,370 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 42 treesize of output 10 [2022-12-06 02:53:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:53:54,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:53:54,660 INFO L321 Elim1Store]: treesize reduction 15, result has 83.9 percent of original size [2022-12-06 02:53:54,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 104 [2022-12-06 02:53:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:53:54,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521905607] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:53:54,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:53:54,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2022-12-06 02:53:54,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142063198] [2022-12-06 02:53:54,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:53:54,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 02:53:54,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:53:54,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 02:53:54,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-12-06 02:53:54,916 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 02:53:54,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 272 transitions, 4412 flow. Second operand has 25 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 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 02:53:54,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:53:54,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 02:53:54,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:54:00,472 INFO L130 PetriNetUnfolder]: 2093/3885 cut-off events. [2022-12-06 02:54:00,472 INFO L131 PetriNetUnfolder]: For 1526/1526 co-relation queries the response was YES. [2022-12-06 02:54:00,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34859 conditions, 3885 events. 2093/3885 cut-off events. For 1526/1526 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 25841 event pairs, 18 based on Foata normal form. 7/3265 useless extension candidates. Maximal degree in co-relation 17004. Up to 3379 conditions per place. [2022-12-06 02:54:00,499 INFO L137 encePairwiseOnDemand]: 7/24 looper letters, 801 selfloop transitions, 406 changer transitions 621/1828 dead transitions. [2022-12-06 02:54:00,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 1828 transitions, 33289 flow [2022-12-06 02:54:00,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-12-06 02:54:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2022-12-06 02:54:00,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 551 transitions. [2022-12-06 02:54:00,505 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3279761904761905 [2022-12-06 02:54:00,507 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 89 predicate places. [2022-12-06 02:54:00,507 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:54:00,507 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 1828 transitions, 33289 flow [2022-12-06 02:54:00,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 1828 transitions, 33289 flow [2022-12-06 02:54:00,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:54:07,747 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 02:54:07,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7243 [2022-12-06 02:54:07,750 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 1825 transitions, 33235 flow [2022-12-06 02:54:07,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 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 02:54:07,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:54:07,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:54:07,770 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 02:54:07,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:54:07,957 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:54:07,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:54:07,957 INFO L85 PathProgramCache]: Analyzing trace with hash 828819352, now seen corresponding path program 1 times [2022-12-06 02:54:07,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:54:07,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515176856] [2022-12-06 02:54:07,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:54:07,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:54:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:54:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:54:08,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:54:08,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515176856] [2022-12-06 02:54:08,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515176856] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:54:08,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553843758] [2022-12-06 02:54:08,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:54:08,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:54:08,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:54:08,459 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 02:54:08,493 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 02:54:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:54:08,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 02:54:08,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:54:08,566 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 414 treesize of output 406 [2022-12-06 02:54:08,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-06 02:54:08,594 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 02:54:08,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-06 02:54:08,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:54:08,725 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 02:54:08,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 45 [2022-12-06 02:54:08,732 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 28 treesize of output 16 [2022-12-06 02:54:08,870 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 02:54:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:54:08,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:54:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:54:09,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553843758] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:54:09,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:54:09,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2022-12-06 02:54:09,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226454194] [2022-12-06 02:54:09,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:54:09,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:54:09,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:54:09,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:54:09,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=237, Unknown=2, NotChecked=0, Total=342 [2022-12-06 02:54:09,156 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:54:09,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 1825 transitions, 33235 flow. Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:54:09,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:54:09,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:54:09,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:54:12,996 INFO L130 PetriNetUnfolder]: 3865/7082 cut-off events. [2022-12-06 02:54:12,996 INFO L131 PetriNetUnfolder]: For 1958/1958 co-relation queries the response was YES. [2022-12-06 02:54:13,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70802 conditions, 7082 events. 3865/7082 cut-off events. For 1958/1958 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 48269 event pairs, 20 based on Foata normal form. 134/6015 useless extension candidates. Maximal degree in co-relation 37650. Up to 6408 conditions per place. [2022-12-06 02:54:13,037 INFO L137 encePairwiseOnDemand]: 6/27 looper letters, 1846 selfloop transitions, 519 changer transitions 994/3359 dead transitions. [2022-12-06 02:54:13,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 3359 transitions, 67942 flow [2022-12-06 02:54:13,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 02:54:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 02:54:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 261 transitions. [2022-12-06 02:54:13,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3118279569892473 [2022-12-06 02:54:13,040 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 114 predicate places. [2022-12-06 02:54:13,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:54:13,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 3359 transitions, 67942 flow [2022-12-06 02:54:13,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 3359 transitions, 67942 flow [2022-12-06 02:54:13,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:54:16,090 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:54:16,091 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3051 [2022-12-06 02:54:16,091 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 3358 transitions, 67922 flow [2022-12-06 02:54:16,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:54:16,091 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:54:16,091 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 02:54:16,111 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 02:54:16,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-06 02:54:16,297 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:54:16,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:54:16,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2021426450, now seen corresponding path program 1 times [2022-12-06 02:54:16,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:54:16,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964398032] [2022-12-06 02:54:16,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:54:16,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:54:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:54:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:54:17,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:54:17,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964398032] [2022-12-06 02:54:17,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964398032] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:54:17,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72677928] [2022-12-06 02:54:17,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:54:17,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:54:17,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:54:17,157 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 02:54:17,158 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 02:54:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:54:17,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 02:54:17,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:54:17,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:54:17,315 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 02:54:17,423 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-06 02:54:17,423 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 42 treesize of output 10 [2022-12-06 02:54:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:54:17,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:54:21,616 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~end~0 4)) (.cse3 (+ c_~A~0.offset (* c_~i~0 4)))) (and (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_275 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275))) (let ((.cse0 (select .cse2 ~queue~0.base))) (or (< (select .cse0 (+ (* c_~start~0 4) ~queue~0.offset)) (+ c_~v_old~0 1)) (not (= (select .cse0 (+ .cse1 ~queue~0.offset)) (select (select .cse2 c_~A~0.base) .cse3))))))) (or (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_275 (Array Int Int))) (not (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275))) (= (select (select .cse4 ~queue~0.base) (+ .cse1 ~queue~0.offset)) (select (select .cse4 c_~A~0.base) .cse3))))) (not (= (mod c_~ok~0 256) 0))))) is different from false [2022-12-06 02:54:21,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:54:21,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 259 treesize of output 278 [2022-12-06 02:54:21,684 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:54:21,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 189 [2022-12-06 02:54:21,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:54:21,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 144 treesize of output 137 [2022-12-06 02:54:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:54:23,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72677928] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:54:23,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:54:23,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-12-06 02:54:23,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103891064] [2022-12-06 02:54:23,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:54:23,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 02:54:23,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:54:23,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 02:54:23,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=524, Unknown=2, NotChecked=48, Total=702 [2022-12-06 02:54:23,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 02:54:23,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 3358 transitions, 67922 flow. Second operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 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 02:54:23,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:54:23,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 02:54:23,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:54:26,064 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 [0] [2022-12-06 02:54:28,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 02:54:32,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 02:54:34,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 02:54:37,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 02:54:39,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 02:54:43,541 INFO L130 PetriNetUnfolder]: 5115/9308 cut-off events. [2022-12-06 02:54:43,542 INFO L131 PetriNetUnfolder]: For 2545/2545 co-relation queries the response was YES. [2022-12-06 02:54:43,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102333 conditions, 9308 events. 5115/9308 cut-off events. For 2545/2545 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 66730 event pairs, 18 based on Foata normal form. 6/7800 useless extension candidates. Maximal degree in co-relation 45350. Up to 8463 conditions per place. [2022-12-06 02:54:43,600 INFO L137 encePairwiseOnDemand]: 9/28 looper letters, 2615 selfloop transitions, 489 changer transitions 1329/4433 dead transitions. [2022-12-06 02:54:43,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 4433 transitions, 98571 flow [2022-12-06 02:54:43,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 02:54:43,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 02:54:43,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 192 transitions. [2022-12-06 02:54:43,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-06 02:54:43,603 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 136 predicate places. [2022-12-06 02:54:43,604 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:54:43,604 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 4433 transitions, 98571 flow [2022-12-06 02:54:43,717 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 4433 transitions, 98571 flow [2022-12-06 02:54:43,718 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:54:46,932 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:54:46,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3329 [2022-12-06 02:54:46,933 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 4432 transitions, 98549 flow [2022-12-06 02:54:46,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 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 02:54:46,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:54:46,933 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:54:46,946 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 02:54:47,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:54:47,140 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:54:47,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:54:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash 186269705, now seen corresponding path program 1 times [2022-12-06 02:54:47,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:54:47,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742191850] [2022-12-06 02:54:47,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:54:47,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:54:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:54:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:54:48,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:54:48,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742191850] [2022-12-06 02:54:48,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742191850] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:54:48,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625759996] [2022-12-06 02:54:48,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:54:48,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:54:48,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:54:48,788 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 02:54:48,794 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 02:54:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:54:48,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 02:54:48,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:54:49,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:54:49,010 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 02:54:49,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-06 02:54:49,017 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 27 treesize of output 15 [2022-12-06 02:54:49,126 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 19 treesize of output 7 [2022-12-06 02:54:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:54:49,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:54:49,365 INFO L321 Elim1Store]: treesize reduction 19, result has 62.7 percent of original size [2022-12-06 02:54:49,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 73 [2022-12-06 02:54:49,370 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 33 treesize of output 27 [2022-12-06 02:54:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:54:49,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625759996] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:54:49,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:54:49,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-06 02:54:49,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079589229] [2022-12-06 02:54:49,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:54:49,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:54:49,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:54:49,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:54:49,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=429, Unknown=1, NotChecked=0, Total=552 [2022-12-06 02:54:49,458 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 02:54:49,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 4432 transitions, 98549 flow. Second operand has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 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 02:54:49,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:54:49,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 02:54:49,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:54:59,046 INFO L130 PetriNetUnfolder]: 6073/11002 cut-off events. [2022-12-06 02:54:59,047 INFO L131 PetriNetUnfolder]: For 3037/3037 co-relation queries the response was YES. [2022-12-06 02:54:59,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131963 conditions, 11002 events. 6073/11002 cut-off events. For 3037/3037 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 81001 event pairs, 18 based on Foata normal form. 2/9212 useless extension candidates. Maximal degree in co-relation 50056. Up to 10082 conditions per place. [2022-12-06 02:54:59,160 INFO L137 encePairwiseOnDemand]: 10/29 looper letters, 3132 selfloop transitions, 578 changer transitions 1510/5220 dead transitions. [2022-12-06 02:54:59,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 5220 transitions, 126493 flow [2022-12-06 02:54:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 02:54:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 02:54:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 188 transitions. [2022-12-06 02:54:59,162 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3411978221415608 [2022-12-06 02:54:59,163 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 153 predicate places. [2022-12-06 02:54:59,163 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:54:59,163 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 5220 transitions, 126493 flow [2022-12-06 02:54:59,279 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 5220 transitions, 126493 flow [2022-12-06 02:54:59,279 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:54:59,288 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:54:59,289 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-06 02:54:59,289 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 5220 transitions, 126493 flow [2022-12-06 02:54:59,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 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 02:54:59,289 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:54:59,290 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 02:54:59,297 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 02:54:59,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:54:59,495 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:54:59,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:54:59,496 INFO L85 PathProgramCache]: Analyzing trace with hash -259282413, now seen corresponding path program 1 times [2022-12-06 02:54:59,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:54:59,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270479677] [2022-12-06 02:54:59,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:54:59,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:54:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:00,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:55:00,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:00,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270479677] [2022-12-06 02:55:00,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270479677] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:55:00,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061747756] [2022-12-06 02:55:00,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:00,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:55:00,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:55:00,704 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 02:55:00,706 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 02:55:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:00,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 02:55:00,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:55:00,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:55:00,926 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 02:55:00,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-06 02:55:00,931 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 27 treesize of output 15 [2022-12-06 02:55:01,004 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 02:55:01,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:55:01,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:55:01,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:55:01,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 140 [2022-12-06 02:55:01,263 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 42 treesize of output 36 [2022-12-06 02:55:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:55:01,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061747756] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:55:01,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:55:01,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-12-06 02:55:01,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291819335] [2022-12-06 02:55:01,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:55:01,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 02:55:01,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:01,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 02:55:01,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=473, Unknown=2, NotChecked=0, Total=600 [2022-12-06 02:55:01,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 02:55:01,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 5220 transitions, 126493 flow. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 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 02:55:01,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:01,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 02:55:01,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:55:15,020 INFO L130 PetriNetUnfolder]: 6375/11552 cut-off events. [2022-12-06 02:55:15,020 INFO L131 PetriNetUnfolder]: For 3169/3169 co-relation queries the response was YES. [2022-12-06 02:55:15,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150107 conditions, 11552 events. 6375/11552 cut-off events. For 3169/3169 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 85852 event pairs, 8 based on Foata normal form. 2/9682 useless extension candidates. Maximal degree in co-relation 54234. Up to 10556 conditions per place. [2022-12-06 02:55:15,098 INFO L137 encePairwiseOnDemand]: 9/29 looper letters, 3195 selfloop transitions, 707 changer transitions 1608/5510 dead transitions. [2022-12-06 02:55:15,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 5510 transitions, 144511 flow [2022-12-06 02:55:15,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 02:55:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 02:55:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 212 transitions. [2022-12-06 02:55:15,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2924137931034483 [2022-12-06 02:55:15,100 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 177 predicate places. [2022-12-06 02:55:15,100 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:55:15,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 5510 transitions, 144511 flow [2022-12-06 02:55:15,226 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 5510 transitions, 144511 flow [2022-12-06 02:55:15,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:55:18,769 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:55:18,770 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3670 [2022-12-06 02:55:18,770 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 5509 transitions, 144485 flow [2022-12-06 02:55:18,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 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 02:55:18,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:55:18,770 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:55:18,775 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 02:55:18,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 02:55:18,976 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:55:18,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:55:18,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1557950467, now seen corresponding path program 2 times [2022-12-06 02:55:18,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:55:18,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32963095] [2022-12-06 02:55:18,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:18,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:55:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:55:19,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:19,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32963095] [2022-12-06 02:55:19,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32963095] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:55:19,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401387161] [2022-12-06 02:55:19,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:55:19,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:55:19,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:55:19,081 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 02:55:19,082 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 02:55:19,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:55:19,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:55:19,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:55:19,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:55:19,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:55:19,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:55:19,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401387161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:55:19,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:55:19,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-12-06 02:55:19,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301782869] [2022-12-06 02:55:19,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:55:19,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:55:19,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:19,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:55:19,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:55:19,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 02:55:19,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 5509 transitions, 144485 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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 02:55:19,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:19,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 02:55:19,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:55:33,188 INFO L130 PetriNetUnfolder]: 7595/14085 cut-off events. [2022-12-06 02:55:33,189 INFO L131 PetriNetUnfolder]: For 3983/3983 co-relation queries the response was YES. [2022-12-06 02:55:33,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197147 conditions, 14085 events. 7595/14085 cut-off events. For 3983/3983 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 109165 event pairs, 14 based on Foata normal form. 292/12069 useless extension candidates. Maximal degree in co-relation 57978. Up to 12981 conditions per place. [2022-12-06 02:55:33,283 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 3560 selfloop transitions, 501 changer transitions 2642/6703 dead transitions. [2022-12-06 02:55:33,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 6703 transitions, 189330 flow [2022-12-06 02:55:33,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:55:33,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:55:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-06 02:55:33,284 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 02:55:33,285 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 179 predicate places. [2022-12-06 02:55:33,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:55:33,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 6703 transitions, 189330 flow [2022-12-06 02:55:33,455 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 6703 transitions, 189330 flow [2022-12-06 02:55:33,455 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:55:33,465 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:55:33,466 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 02:55:33,466 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 6703 transitions, 189330 flow [2022-12-06 02:55:33,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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 02:55:33,466 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:55:33,466 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:55:33,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 02:55:33,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:55:33,672 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:55:33,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:55:33,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1971552381, now seen corresponding path program 3 times [2022-12-06 02:55:33,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:55:33,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142591099] [2022-12-06 02:55:33,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:33,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:55:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:55:33,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:33,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142591099] [2022-12-06 02:55:33,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142591099] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:55:33,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857744110] [2022-12-06 02:55:33,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:55:33,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:55:33,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:55:33,751 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:55:33,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 02:55:33,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:55:33,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:55:33,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 02:55:33,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:55:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:55:34,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:55:34,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857744110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:55:34,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:55:34,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-06 02:55:34,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694437725] [2022-12-06 02:55:34,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:55:34,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:55:34,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:34,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:55:34,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 02:55:34,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 02:55:34,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 6703 transitions, 189330 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:55:34,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:34,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 02:55:34,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:55:54,720 INFO L130 PetriNetUnfolder]: 7415/14093 cut-off events. [2022-12-06 02:55:54,720 INFO L131 PetriNetUnfolder]: For 4116/4116 co-relation queries the response was YES. [2022-12-06 02:55:54,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211389 conditions, 14093 events. 7415/14093 cut-off events. For 4116/4116 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 111650 event pairs, 18 based on Foata normal form. 0/11965 useless extension candidates. Maximal degree in co-relation 76057. Up to 13010 conditions per place. [2022-12-06 02:55:54,799 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 3546 selfloop transitions, 4 changer transitions 3286/6836 dead transitions. [2022-12-06 02:55:54,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 6836 transitions, 206884 flow [2022-12-06 02:55:54,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:55:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:55:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-06 02:55:54,801 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38 [2022-12-06 02:55:54,802 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 182 predicate places. [2022-12-06 02:55:54,805 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:55:54,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 6836 transitions, 206884 flow [2022-12-06 02:55:54,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 6836 transitions, 206884 flow [2022-12-06 02:55:54,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:55:54,993 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:55:54,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 02:55:54,996 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 6836 transitions, 206884 flow [2022-12-06 02:55:54,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:55:54,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:55:54,996 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:55:55,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 02:55:55,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:55:55,205 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:55:55,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:55:55,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1890167872, now seen corresponding path program 1 times [2022-12-06 02:55:55,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:55:55,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945162948] [2022-12-06 02:55:55,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:55,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:55:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:55:56,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:56,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945162948] [2022-12-06 02:55:56,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945162948] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:55:56,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110865653] [2022-12-06 02:55:56,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:56,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:55:56,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:55:56,125 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:55:56,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 02:55:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:56,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-06 02:55:56,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:55:56,365 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 202 treesize of output 198 [2022-12-06 02:55:56,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 19 treesize of output 23 [2022-12-06 02:55:56,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:55:56,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:55:56,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:55:56,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:55:56,998 INFO L321 Elim1Store]: treesize reduction 42, result has 56.7 percent of original size [2022-12-06 02:55:56,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 70 [2022-12-06 02:55:57,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:55:57,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:55:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:55:58,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110865653] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:55:58,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:55:58,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 35 [2022-12-06 02:55:58,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709039983] [2022-12-06 02:55:58,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:55:58,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-06 02:55:58,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:58,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-06 02:55:58,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1070, Unknown=8, NotChecked=0, Total=1332 [2022-12-06 02:55:58,256 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 02:55:58,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 6836 transitions, 206884 flow. Second operand has 37 states, 36 states have (on average 2.0) internal successors, (72), 36 states have internal predecessors, (72), 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 02:55:58,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:58,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 02:55:58,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:56:01,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:56:23,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:56:38,658 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse65 (* c_~end~0 4)) (.cse66 (* c_~start~0 4))) (let ((.cse42 (+ c_~end~0 1)) (.cse6 (not (= (mod c_~ok~0 256) 0))) (.cse23 (+ .cse66 c_~queue~0.offset 4)) (.cse15 (+ .cse66 c_~queue~0.offset)) (.cse10 (+ .cse65 c_~queue~0.offset)) (.cse64 (select |c_#memory_int| c_~queue~0.base)) (.cse11 (+ .cse65 c_~queue~0.offset 4))) (let ((.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse44 (select .cse64 .cse11)) (.cse1 (select .cse64 .cse10)) (.cse3 (let ((.cse63 (select .cse64 .cse15))) (and .cse6 (<= .cse63 c_~v_old~0) (< (select .cse64 .cse23) (+ .cse63 1))))) (.cse4 (< c_~end~0 0)) (.cse5 (<= c_~n~0 .cse42))) (and (or (forall ((~i~0 Int)) (let ((.cse0 (select .cse2 (+ c_~A~0.offset (* ~i~0 4))))) (or (not (<= .cse0 c_~last~0)) (not (= .cse1 .cse0))))) (not (< c_~end~0 c_~n~0)) (not (<= 0 c_~end~0)) (= (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256) 0) .cse3) (or .cse4 .cse5 (and (or .cse6 (forall ((~A~0.offset Int) (v_~i~0_147 Int) (~i~0 Int) (v_ArrVal_541 (Array Int Int)) (~A~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_541))) (let ((.cse12 (select .cse13 ~A~0.base))) (let ((.cse8 (select .cse12 (+ (* v_~i~0_147 4) ~A~0.offset))) (.cse9 (select .cse13 c_~queue~0.base)) (.cse7 (select .cse12 (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse7 .cse8) (not (= .cse7 (select .cse9 .cse10))) (not (= .cse8 (select .cse9 .cse11))) (< c_~last~0 .cse7))))))) (forall ((~A~0.offset Int) (v_~i~0_147 Int) (~i~0 Int) (v_ArrVal_541 (Array Int Int)) (~A~0.base Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_541))) (let ((.cse18 (select .cse19 ~A~0.base))) (let ((.cse17 (select .cse18 (+ (* v_~i~0_147 4) ~A~0.offset))) (.cse14 (select .cse19 c_~queue~0.base)) (.cse16 (select .cse18 (+ (* ~i~0 4) ~A~0.offset)))) (or (<= (select .cse14 .cse15) c_~v_old~0) (< .cse16 .cse17) (not (= .cse16 (select .cse14 .cse10))) (not (= .cse17 (select .cse14 .cse11))) (< c_~last~0 .cse16)))))) (forall ((~A~0.offset Int) (v_~i~0_147 Int) (~i~0 Int) (v_ArrVal_541 (Array Int Int)) (~A~0.base Int)) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_541))) (let ((.cse24 (select .cse25 ~A~0.base))) (let ((.cse21 (select .cse24 (+ (* v_~i~0_147 4) ~A~0.offset))) (.cse22 (select .cse25 c_~queue~0.base)) (.cse20 (select .cse24 (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse20 .cse21) (not (= .cse20 (select .cse22 .cse10))) (< (select .cse22 .cse23) (+ (select .cse22 .cse15) 1)) (not (= .cse21 (select .cse22 .cse11))) (< c_~last~0 .cse20)))))))) (or (and (forall ((~A~0.offset Int) (v_~i~0_147 Int) (~i~0 Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (~A~0.base Int)) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_541))) (let ((.cse29 (select .cse30 ~A~0.base))) (let ((.cse26 (select .cse30 c_~queue~0.base)) (.cse27 (select .cse29 (+ (* ~i~0 4) ~A~0.offset))) (.cse28 (select .cse29 (+ (* v_~i~0_147 4) ~A~0.offset)))) (or (not (= (select .cse26 .cse10) .cse27)) (< (select .cse26 .cse23) (+ (select .cse26 .cse15) 1)) (not (= .cse28 (select .cse26 .cse11))) (< .cse27 .cse28)))))) (or .cse6 (forall ((~A~0.offset Int) (v_~i~0_147 Int) (~i~0 Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (~A~0.base Int)) (let ((.cse35 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_541))) (let ((.cse34 (select .cse35 ~A~0.base))) (let ((.cse31 (select .cse35 c_~queue~0.base)) (.cse32 (select .cse34 (+ (* ~i~0 4) ~A~0.offset))) (.cse33 (select .cse34 (+ (* v_~i~0_147 4) ~A~0.offset)))) (or (not (= (select .cse31 .cse10) .cse32)) (not (= .cse33 (select .cse31 .cse11))) (< .cse32 .cse33))))))) (forall ((~A~0.offset Int) (v_~i~0_147 Int) (~i~0 Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (~A~0.base Int)) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_541))) (let ((.cse39 (select .cse40 ~A~0.base))) (let ((.cse36 (select .cse40 c_~queue~0.base)) (.cse37 (select .cse39 (+ (* ~i~0 4) ~A~0.offset))) (.cse38 (select .cse39 (+ (* v_~i~0_147 4) ~A~0.offset)))) (or (not (= (select .cse36 .cse10) .cse37)) (< (select .cse36 .cse15) (+ .cse37 1)) (not (= .cse38 (select .cse36 .cse11))) (< .cse37 .cse38))))))) .cse4 .cse5) (= c_~ok~0 1) (let ((.cse41 (select .cse2 (+ c_~A~0.offset (* c_~i~0 4))))) (or (not (= .cse1 .cse41)) (and (not (< c_~i~0 c_~N~0)) (not (< c_~start~0 .cse42))) .cse4 .cse5 (forall ((v_~i~0_147 Int)) (let ((.cse43 (select .cse2 (+ c_~A~0.offset (* v_~i~0_147 4))))) (or (< .cse41 .cse43) (not (= .cse44 .cse43))))) .cse3)) (or .cse4 (forall ((~A~0.offset Int) (v_~i~0_147 Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse47 (select |c_#memory_int| ~A~0.base))) (let ((.cse46 (select .cse47 (+ (* ~i~0 4) ~A~0.offset))) (.cse45 (select .cse47 (+ (* v_~i~0_147 4) ~A~0.offset)))) (or (not (= .cse45 .cse44)) (not (= .cse1 .cse46)) (< c_~last~0 .cse46) (< .cse46 .cse45))))) .cse5 .cse3) (or .cse4 .cse5 (and (or (forall ((~A~0.offset Int) (v_~i~0_147 Int) (v_ArrVal_539 (Array Int Int)) (~i~0 Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (~A~0.base Int)) (let ((.cse52 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_539) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_541))) (let ((.cse51 (select .cse52 ~A~0.base))) (let ((.cse48 (select .cse51 (+ (* ~i~0 4) ~A~0.offset))) (.cse50 (select .cse52 c_~queue~0.base)) (.cse49 (select .cse51 (+ (* v_~i~0_147 4) ~A~0.offset)))) (or (< .cse48 .cse49) (not (= .cse48 (select .cse50 .cse10))) (not (= (select .cse50 .cse11) .cse49))))))) .cse6) (forall ((~A~0.offset Int) (v_~i~0_147 Int) (v_ArrVal_539 (Array Int Int)) (~i~0 Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (~A~0.base Int)) (let ((.cse57 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_539) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_541))) (let ((.cse56 (select .cse57 ~A~0.base))) (let ((.cse54 (select .cse56 (+ (* ~i~0 4) ~A~0.offset))) (.cse53 (select .cse57 c_~queue~0.base)) (.cse55 (select .cse56 (+ (* v_~i~0_147 4) ~A~0.offset)))) (or (< (select .cse53 .cse23) (+ (select .cse53 .cse15) 1)) (< .cse54 .cse55) (not (= .cse54 (select .cse53 .cse10))) (not (= (select .cse53 .cse11) .cse55))))))) (forall ((~A~0.offset Int) (v_~i~0_147 Int) (v_ArrVal_539 (Array Int Int)) (~i~0 Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (~A~0.base Int)) (let ((.cse62 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_539) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_541))) (let ((.cse61 (select .cse62 ~A~0.base))) (let ((.cse59 (select .cse61 (+ (* ~i~0 4) ~A~0.offset))) (.cse58 (select .cse62 c_~queue~0.base)) (.cse60 (select .cse61 (+ (* v_~i~0_147 4) ~A~0.offset)))) (or (< (select .cse58 .cse15) (+ .cse59 1)) (< .cse59 .cse60) (not (= .cse59 (select .cse58 .cse10))) (not (= (select .cse58 .cse11) .cse60))))))))))))) is different from false [2022-12-06 02:59:00,888 INFO L130 PetriNetUnfolder]: 13851/26176 cut-off events. [2022-12-06 02:59:00,888 INFO L131 PetriNetUnfolder]: For 6264/6264 co-relation queries the response was YES. [2022-12-06 02:59:00,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418925 conditions, 26176 events. 13851/26176 cut-off events. For 6264/6264 co-relation queries the response was YES. Maximal size of possible extension queue 833. Compared 225081 event pairs, 24 based on Foata normal form. 40/22034 useless extension candidates. Maximal degree in co-relation 144574. Up to 24703 conditions per place. [2022-12-06 02:59:01,071 INFO L137 encePairwiseOnDemand]: 3/30 looper letters, 5102 selfloop transitions, 2556 changer transitions 6175/13833 dead transitions. [2022-12-06 02:59:01,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 13833 transitions, 446167 flow [2022-12-06 02:59:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2022-12-06 02:59:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2022-12-06 02:59:01,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 882 transitions. [2022-12-06 02:59:01,075 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19731543624161074 [2022-12-06 02:59:01,075 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 330 predicate places. [2022-12-06 02:59:01,076 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:59:01,076 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 355 places, 13833 transitions, 446167 flow [2022-12-06 02:59:01,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 355 places, 13833 transitions, 446167 flow [2022-12-06 02:59:01,680 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:59:06,308 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 02:59:10,042 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 02:59:10,130 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [709] L102-4-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_26| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_26|) (= v_~end~0_161 (+ v_~end~0_162 1)) (= (ite (= (select (select |v_#memory_int_317| v_~A~0.base_132) (+ v_~A~0.offset_132 (* v_~i~0_152 4))) (select (select |v_#memory_int_317| v_~queue~0.base_120) (+ (* v_~end~0_162 4) v_~queue~0.offset_120))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_26|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_26| 0)) (= |v_ULTIMATE.start_main_#t~mem19#1_64| (select (select |v_#memory_int_317| |v_ULTIMATE.start_main_~#t1~0#1.base_77|) |v_ULTIMATE.start_main_~#t1~0#1.offset_77|)) (not (= (ite (and (<= 0 v_~end~0_162) (< v_~end~0_162 v_~n~0_110)) 1 0) 0))) InVars {~A~0.base=v_~A~0.base_132, ~queue~0.offset=v_~queue~0.offset_120, ~A~0.offset=v_~A~0.offset_132, ~i~0=v_~i~0_152, #memory_int=|v_#memory_int_317|, ~end~0=v_~end~0_162, ~queue~0.base=v_~queue~0.base_120, ~n~0=v_~n~0_110, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_77|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_77|} OutVars{~A~0.base=v_~A~0.base_132, ~queue~0.offset=v_~queue~0.offset_120, ~i~0=v_~i~0_152, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_26|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_26|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_53|, ~queue~0.base=v_~queue~0.base_120, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_77|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_77|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_91|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_26|, ~A~0.offset=v_~A~0.offset_132, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_26|, #memory_int=|v_#memory_int_317|, ~end~0=v_~end~0_161, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_26|, ~n~0=v_~n~0_110} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, ULTIMATE.start_main_#t~nondet18#1, thread1Thread1of1ForFork0_#t~mem3#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 02:59:25,079 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 02:59:25,080 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24005 [2022-12-06 02:59:25,080 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 13825 transitions, 445917 flow [2022-12-06 02:59:25,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0) internal successors, (72), 36 states have internal predecessors, (72), 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 02:59:25,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:59:25,081 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:59:25,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 02:59:25,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 02:59:25,286 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:59:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:59:25,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1339744780, now seen corresponding path program 1 times [2022-12-06 02:59:25,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:59:25,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432747216] [2022-12-06 02:59:25,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:59:25,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:59:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:59:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:59:26,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:59:26,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432747216] [2022-12-06 02:59:26,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432747216] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:59:26,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12311136] [2022-12-06 02:59:26,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:59:26,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:59:26,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:59:26,486 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:59:26,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 02:59:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:59:26,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-06 02:59:26,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:59:26,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:59:26,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 19 treesize of output 23 [2022-12-06 02:59:26,605 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 96 treesize of output 94 [2022-12-06 02:59:26,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:59:26,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:59:26,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:59:27,187 INFO L321 Elim1Store]: treesize reduction 38, result has 57.3 percent of original size [2022-12-06 02:59:27,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 66 [2022-12-06 02:59:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:59:27,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:59:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:59:28,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12311136] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:59:28,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:59:28,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2022-12-06 02:59:28,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045307267] [2022-12-06 02:59:28,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:59:28,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-06 02:59:28,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:59:28,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-06 02:59:28,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=790, Unknown=5, NotChecked=0, Total=1056 [2022-12-06 02:59:28,285 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 02:59:28,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 13825 transitions, 445917 flow. Second operand has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 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 02:59:28,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:59:28,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 02:59:28,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:59:28,687 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse57 (* c_~start~0 4))) (let ((.cse56 (* c_~end~0 4)) (.cse54 (select |c_#memory_int| c_~queue~0.base)) (.cse12 (+ .cse57 c_~queue~0.offset))) (let ((.cse19 (not (= (mod c_~ok~0 256) 0))) (.cse11 (+ .cse57 c_~queue~0.offset 4)) (.cse35 (select .cse54 .cse12)) (.cse15 (+ .cse56 c_~queue~0.offset)) (.cse16 (+ .cse56 c_~queue~0.offset 4)) (.cse55 (+ c_~end~0 1)) (.cse34 (+ c_~start~0 1)) (.cse2 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (not (< c_~end~0 c_~n~0))) (.cse31 (select .cse2 (+ c_~A~0.offset (* c_~i~0 4)))) (.cse5 (<= c_~end~0 c_~start~0)) (.cse4 (< .cse34 0)) (.cse7 (<= .cse55 c_~start~0)) (.cse8 (< c_~end~0 0)) (.cse33 (select .cse54 .cse16)) (.cse1 (select .cse54 .cse15)) (.cse9 (<= c_~n~0 .cse55)) (.cse6 (and .cse19 (<= .cse35 c_~v_old~0) (< (select .cse54 .cse11) (+ .cse35 1))))) (and (or (forall ((~i~0 Int)) (let ((.cse0 (select .cse2 (+ c_~A~0.offset (* ~i~0 4))))) (or (not (<= .cse0 c_~last~0)) (not (= .cse1 .cse0))))) .cse3 .cse4 .cse5 .cse6) (or .cse4 .cse7 .cse8 .cse9 (and (forall ((~A~0.offset Int) (v_ArrVal_606 (Array Int Int)) (~i~0 Int) (v_~i~0_180 Int) (~A~0.base Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606))) (let ((.cse17 (select .cse18 ~A~0.base))) (let ((.cse13 (select .cse17 (+ (* ~i~0 4) ~A~0.offset))) (.cse10 (select .cse18 c_~queue~0.base)) (.cse14 (select .cse17 (+ ~A~0.offset (* v_~i~0_180 4))))) (or (< (select .cse10 .cse11) (+ (select .cse10 .cse12) 1)) (< .cse13 .cse14) (not (= .cse13 (select .cse10 .cse15))) (not (<= .cse13 c_~last~0)) (not (= (select .cse10 .cse16) .cse14))))))) (or .cse19 (forall ((~A~0.offset Int) (v_ArrVal_606 (Array Int Int)) (~i~0 Int) (v_~i~0_180 Int) (~A~0.base Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606))) (let ((.cse23 (select .cse24 ~A~0.base))) (let ((.cse20 (select .cse23 (+ (* ~i~0 4) ~A~0.offset))) (.cse22 (select .cse24 c_~queue~0.base)) (.cse21 (select .cse23 (+ ~A~0.offset (* v_~i~0_180 4))))) (or (< .cse20 .cse21) (not (= .cse20 (select .cse22 .cse15))) (not (<= .cse20 c_~last~0)) (not (= (select .cse22 .cse16) .cse21)))))))) (forall ((~A~0.offset Int) (v_ArrVal_606 (Array Int Int)) (~i~0 Int) (v_~i~0_180 Int) (~A~0.base Int)) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606))) (let ((.cse28 (select .cse29 ~A~0.base))) (let ((.cse25 (select .cse28 (+ (* ~i~0 4) ~A~0.offset))) (.cse27 (select .cse29 c_~queue~0.base)) (.cse26 (select .cse28 (+ ~A~0.offset (* v_~i~0_180 4))))) (or (< .cse25 .cse26) (<= (select .cse27 .cse12) c_~v_old~0) (not (= .cse25 (select .cse27 .cse15))) (not (<= .cse25 c_~last~0)) (not (= (select .cse27 .cse16) .cse26))))))))) (or .cse3 .cse4 .cse5 (forall ((v_~i~0_180 Int)) (let ((.cse30 (select .cse2 (+ c_~A~0.offset (* v_~i~0_180 4))))) (or (not (= .cse1 .cse30)) (< .cse31 .cse30)))) .cse6) (or (not (= .cse1 .cse31)) .cse4 .cse7 .cse8 .cse9 .cse6 (forall ((v_~i~0_180 Int)) (let ((.cse32 (select .cse2 (+ c_~A~0.offset (* v_~i~0_180 4))))) (or (< .cse31 .cse32) (not (= .cse32 .cse33)))))) (or .cse4 (<= c_~n~0 .cse34) .cse6 (<= c_~end~0 .cse34)) (= c_~ok~0 1) (or (and (< .cse35 (+ c_~v_old~0 1)) .cse19) (< c_~start~0 0) (= (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256) 0) .cse5 (<= c_~n~0 c_~start~0)) (or .cse4 .cse7 .cse8 (and (forall ((~A~0.offset Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (~i~0 Int) (v_~i~0_180 Int) (~A~0.base Int)) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606))) (let ((.cse40 (select .cse39 ~A~0.base))) (let ((.cse36 (select .cse40 (+ (* ~i~0 4) ~A~0.offset))) (.cse37 (select .cse40 (+ ~A~0.offset (* v_~i~0_180 4)))) (.cse38 (select .cse39 c_~queue~0.base))) (or (< .cse36 .cse37) (not (= (select .cse38 .cse15) .cse36)) (not (= .cse37 (select .cse38 .cse16))) (< (select .cse38 .cse11) (+ (select .cse38 .cse12) 1))))))) (or .cse19 (forall ((~A~0.offset Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (~i~0 Int) (v_~i~0_180 Int) (~A~0.base Int)) (let ((.cse44 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606))) (let ((.cse45 (select .cse44 ~A~0.base))) (let ((.cse41 (select .cse45 (+ (* ~i~0 4) ~A~0.offset))) (.cse42 (select .cse45 (+ ~A~0.offset (* v_~i~0_180 4)))) (.cse43 (select .cse44 c_~queue~0.base))) (or (< .cse41 .cse42) (not (= (select .cse43 .cse15) .cse41)) (not (= .cse42 (select .cse43 .cse16))))))))) (forall ((~A~0.offset Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (~i~0 Int) (v_~i~0_180 Int) (~A~0.base Int)) (let ((.cse49 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606))) (let ((.cse50 (select .cse49 ~A~0.base))) (let ((.cse46 (select .cse50 (+ (* ~i~0 4) ~A~0.offset))) (.cse47 (select .cse50 (+ ~A~0.offset (* v_~i~0_180 4)))) (.cse48 (select .cse49 c_~queue~0.base))) (or (< .cse46 .cse47) (< (select .cse48 .cse12) (+ .cse46 1)) (not (= (select .cse48 .cse15) .cse46)) (not (= .cse47 (select .cse48 .cse16))))))))) .cse9) (or .cse4 .cse7 .cse8 (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_180 Int) (~A~0.base Int)) (let ((.cse53 (select |c_#memory_int| ~A~0.base))) (let ((.cse52 (select .cse53 (+ (* ~i~0 4) ~A~0.offset))) (.cse51 (select .cse53 (+ ~A~0.offset (* v_~i~0_180 4))))) (or (not (= .cse51 .cse33)) (not (= .cse1 .cse52)) (not (<= .cse52 c_~last~0)) (< .cse52 .cse51))))) .cse9 .cse6)))))) is different from false [2022-12-06 02:59:31,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:00:25,307 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse35 (* c_~end~0 4)) (.cse37 (* c_~start~0 4))) (let ((.cse34 (+ c_~end~0 1)) (.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse23 (not (= (mod c_~ok~0 256) 0))) (.cse19 (+ .cse37 c_~queue~0.offset 4)) (.cse20 (+ .cse37 c_~queue~0.offset)) (.cse13 (select |c_#memory_int| c_~queue~0.base)) (.cse18 (+ .cse35 c_~queue~0.offset))) (let ((.cse3 (not (< c_~end~0 c_~n~0))) (.cse5 (<= c_~end~0 c_~start~0)) (.cse1 (select .cse13 .cse18)) (.cse6 (let ((.cse36 (select .cse13 .cse20))) (and .cse23 (<= .cse36 c_~v_old~0) (< (select .cse13 .cse19) (+ .cse36 1))))) (.cse8 (select .cse2 (+ c_~A~0.offset (* c_~i~0 4)))) (.cse4 (< (+ c_~start~0 1) 0)) (.cse9 (<= .cse34 c_~start~0)) (.cse10 (< c_~end~0 0)) (.cse14 (+ .cse35 c_~queue~0.offset 4)) (.cse11 (<= c_~n~0 .cse34))) (and (or (forall ((~i~0 Int)) (let ((.cse0 (select .cse2 (+ c_~A~0.offset (* ~i~0 4))))) (or (not (<= .cse0 c_~last~0)) (not (= .cse1 .cse0))))) .cse3 .cse4 .cse5 .cse6) (or .cse3 .cse4 .cse5 (forall ((v_~i~0_180 Int)) (let ((.cse7 (select .cse2 (+ c_~A~0.offset (* v_~i~0_180 4))))) (or (not (= .cse1 .cse7)) (< .cse8 .cse7)))) .cse6) (or (not (= .cse1 .cse8)) .cse4 .cse9 .cse10 .cse11 .cse6 (forall ((v_~i~0_180 Int)) (let ((.cse12 (select .cse2 (+ c_~A~0.offset (* v_~i~0_180 4))))) (or (< .cse8 .cse12) (not (= .cse12 (select .cse13 .cse14))))))) (or .cse4 .cse9 .cse10 (and (forall ((~A~0.offset Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (~i~0 Int) (v_~i~0_180 Int) (~A~0.base Int)) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606))) (let ((.cse22 (select .cse21 ~A~0.base))) (let ((.cse15 (select .cse22 (+ (* ~i~0 4) ~A~0.offset))) (.cse16 (select .cse22 (+ ~A~0.offset (* v_~i~0_180 4)))) (.cse17 (select .cse21 c_~queue~0.base))) (or (< .cse15 .cse16) (not (= (select .cse17 .cse18) .cse15)) (not (= .cse16 (select .cse17 .cse14))) (< (select .cse17 .cse19) (+ (select .cse17 .cse20) 1))))))) (or .cse23 (forall ((~A~0.offset Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (~i~0 Int) (v_~i~0_180 Int) (~A~0.base Int)) (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606))) (let ((.cse28 (select .cse27 ~A~0.base))) (let ((.cse24 (select .cse28 (+ (* ~i~0 4) ~A~0.offset))) (.cse25 (select .cse28 (+ ~A~0.offset (* v_~i~0_180 4)))) (.cse26 (select .cse27 c_~queue~0.base))) (or (< .cse24 .cse25) (not (= (select .cse26 .cse18) .cse24)) (not (= .cse25 (select .cse26 .cse14))))))))) (forall ((~A~0.offset Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (~i~0 Int) (v_~i~0_180 Int) (~A~0.base Int)) (let ((.cse32 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606))) (let ((.cse33 (select .cse32 ~A~0.base))) (let ((.cse29 (select .cse33 (+ (* ~i~0 4) ~A~0.offset))) (.cse30 (select .cse33 (+ ~A~0.offset (* v_~i~0_180 4)))) (.cse31 (select .cse32 c_~queue~0.base))) (or (< .cse29 .cse30) (< (select .cse31 .cse20) (+ .cse29 1)) (not (= (select .cse31 .cse18) .cse29)) (not (= .cse30 (select .cse31 .cse14))))))))) .cse11))))) is different from false [2022-12-06 03:00:33,745 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse48 (* c_~end~0 4)) (.cse49 (* c_~start~0 4))) (let ((.cse16 (not (= (mod c_~ok~0 256) 0))) (.cse8 (+ .cse49 c_~queue~0.offset 4)) (.cse9 (+ .cse49 c_~queue~0.offset)) (.cse43 (select |c_#memory_int| c_~queue~0.base)) (.cse12 (+ .cse48 c_~queue~0.offset)) (.cse47 (+ c_~end~0 1))) (let ((.cse2 (< (+ c_~start~0 1) 0)) (.cse4 (<= .cse47 c_~start~0)) (.cse5 (< c_~end~0 0)) (.cse13 (+ .cse48 c_~queue~0.offset 4)) (.cse1 (select .cse43 .cse12)) (.cse6 (<= c_~n~0 .cse47)) (.cse3 (let ((.cse46 (select .cse43 .cse9))) (and .cse16 (<= .cse46 c_~v_old~0) (< (select .cse43 .cse8) (+ .cse46 1)))))) (and (or (forall ((~i~0 Int)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (not (<= .cse0 c_~last~0)) (not (= .cse1 .cse0))))) (not (< c_~end~0 c_~n~0)) .cse2 (<= c_~end~0 c_~start~0) .cse3) (or .cse2 .cse4 .cse5 .cse6 (and (forall ((~A~0.offset Int) (v_ArrVal_606 (Array Int Int)) (~i~0 Int) (v_~i~0_180 Int) (~A~0.base Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606))) (let ((.cse14 (select .cse15 ~A~0.base))) (let ((.cse10 (select .cse14 (+ (* ~i~0 4) ~A~0.offset))) (.cse7 (select .cse15 c_~queue~0.base)) (.cse11 (select .cse14 (+ ~A~0.offset (* v_~i~0_180 4))))) (or (< (select .cse7 .cse8) (+ (select .cse7 .cse9) 1)) (< .cse10 .cse11) (not (= .cse10 (select .cse7 .cse12))) (not (<= .cse10 c_~last~0)) (not (= (select .cse7 .cse13) .cse11))))))) (or .cse16 (forall ((~A~0.offset Int) (v_ArrVal_606 (Array Int Int)) (~i~0 Int) (v_~i~0_180 Int) (~A~0.base Int)) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606))) (let ((.cse20 (select .cse21 ~A~0.base))) (let ((.cse17 (select .cse20 (+ (* ~i~0 4) ~A~0.offset))) (.cse19 (select .cse21 c_~queue~0.base)) (.cse18 (select .cse20 (+ ~A~0.offset (* v_~i~0_180 4))))) (or (< .cse17 .cse18) (not (= .cse17 (select .cse19 .cse12))) (not (<= .cse17 c_~last~0)) (not (= (select .cse19 .cse13) .cse18)))))))) (forall ((~A~0.offset Int) (v_ArrVal_606 (Array Int Int)) (~i~0 Int) (v_~i~0_180 Int) (~A~0.base Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606))) (let ((.cse25 (select .cse26 ~A~0.base))) (let ((.cse22 (select .cse25 (+ (* ~i~0 4) ~A~0.offset))) (.cse24 (select .cse26 c_~queue~0.base)) (.cse23 (select .cse25 (+ ~A~0.offset (* v_~i~0_180 4))))) (or (< .cse22 .cse23) (<= (select .cse24 .cse9) c_~v_old~0) (not (= .cse22 (select .cse24 .cse12))) (not (<= .cse22 c_~last~0)) (not (= (select .cse24 .cse13) .cse23))))))))) (or .cse2 .cse4 .cse5 (and (forall ((~A~0.offset Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (~i~0 Int) (v_~i~0_180 Int) (~A~0.base Int)) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606))) (let ((.cse31 (select .cse30 ~A~0.base))) (let ((.cse27 (select .cse31 (+ (* ~i~0 4) ~A~0.offset))) (.cse28 (select .cse31 (+ ~A~0.offset (* v_~i~0_180 4)))) (.cse29 (select .cse30 c_~queue~0.base))) (or (< .cse27 .cse28) (not (= (select .cse29 .cse12) .cse27)) (not (= .cse28 (select .cse29 .cse13))) (< (select .cse29 .cse8) (+ (select .cse29 .cse9) 1))))))) (or .cse16 (forall ((~A~0.offset Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (~i~0 Int) (v_~i~0_180 Int) (~A~0.base Int)) (let ((.cse35 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606))) (let ((.cse36 (select .cse35 ~A~0.base))) (let ((.cse32 (select .cse36 (+ (* ~i~0 4) ~A~0.offset))) (.cse33 (select .cse36 (+ ~A~0.offset (* v_~i~0_180 4)))) (.cse34 (select .cse35 c_~queue~0.base))) (or (< .cse32 .cse33) (not (= (select .cse34 .cse12) .cse32)) (not (= .cse33 (select .cse34 .cse13))))))))) (forall ((~A~0.offset Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (~i~0 Int) (v_~i~0_180 Int) (~A~0.base Int)) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606))) (let ((.cse41 (select .cse40 ~A~0.base))) (let ((.cse37 (select .cse41 (+ (* ~i~0 4) ~A~0.offset))) (.cse38 (select .cse41 (+ ~A~0.offset (* v_~i~0_180 4)))) (.cse39 (select .cse40 c_~queue~0.base))) (or (< .cse37 .cse38) (< (select .cse39 .cse9) (+ .cse37 1)) (not (= (select .cse39 .cse12) .cse37)) (not (= .cse38 (select .cse39 .cse13))))))))) .cse6) (or .cse2 .cse4 .cse5 (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_180 Int) (~A~0.base Int)) (let ((.cse45 (select |c_#memory_int| ~A~0.base))) (let ((.cse44 (select .cse45 (+ (* ~i~0 4) ~A~0.offset))) (.cse42 (select .cse45 (+ ~A~0.offset (* v_~i~0_180 4))))) (or (not (= .cse42 (select .cse43 .cse13))) (not (= .cse1 .cse44)) (not (<= .cse44 c_~last~0)) (< .cse44 .cse42))))) .cse6 .cse3))))) is different from false [2022-12-06 03:02:10,933 INFO L130 PetriNetUnfolder]: 17700/33618 cut-off events. [2022-12-06 03:02:10,933 INFO L131 PetriNetUnfolder]: For 8875/8875 co-relation queries the response was YES. [2022-12-06 03:02:10,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571532 conditions, 33618 events. 17700/33618 cut-off events. For 8875/8875 co-relation queries the response was YES. Maximal size of possible extension queue 1075. Compared 303358 event pairs, 30 based on Foata normal form. 314/28525 useless extension candidates. Maximal degree in co-relation 161059. Up to 31503 conditions per place. [2022-12-06 03:02:11,098 INFO L137 encePairwiseOnDemand]: 5/38 looper letters, 4671 selfloop transitions, 1096 changer transitions 12297/18064 dead transitions. [2022-12-06 03:02:11,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 18064 transitions, 618673 flow [2022-12-06 03:02:11,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-12-06 03:02:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2022-12-06 03:02:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 650 transitions. [2022-12-06 03:02:11,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20123839009287925 [2022-12-06 03:02:11,100 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 393 predicate places. [2022-12-06 03:02:11,101 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:02:11,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 418 places, 18064 transitions, 618673 flow [2022-12-06 03:02:11,805 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 418 places, 18064 transitions, 618673 flow [2022-12-06 03:02:11,806 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:02:11,834 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 03:02:11,915 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 03:02:11,968 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:02:11,968 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 868 [2022-12-06 03:02:11,968 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 18063 transitions, 618643 flow [2022-12-06 03:02:11,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 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:02:11,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:02:11,969 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:02:11,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 03:02:12,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 03:02:12,174 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:02:12,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:02:12,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1833550180, now seen corresponding path program 1 times [2022-12-06 03:02:12,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:02:12,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085432605] [2022-12-06 03:02:12,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:02:12,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:02:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:02:13,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:02:13,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:02:13,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085432605] [2022-12-06 03:02:13,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085432605] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:02:13,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765427792] [2022-12-06 03:02:13,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:02:13,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:02:13,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:02:13,819 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:02:14,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 03:02:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:02:14,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 03:02:14,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:02:14,138 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 66 treesize of output 62 [2022-12-06 03:02:14,225 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:02:14,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:02:14,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 28 [2022-12-06 03:02:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:02:14,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:02:15,430 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:02:15,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 853 treesize of output 1010 [2022-12-06 03:02:15,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:02:15,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 570 treesize of output 639 [2022-12-06 03:02:15,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:02:15,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 502 treesize of output 624 [2022-12-06 03:02:15,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:02:15,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 427 treesize of output 444 Received shutdown request... [2022-12-06 03:07:49,689 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 03:07:49,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 03:07:49,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-06 03:07:49,696 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:07:49,696 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:07:49,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 03:07:49,892 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 23 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. [2022-12-06 03:07:49,893 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 03:07:49,893 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 03:07:49,893 INFO L458 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:07:49,896 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 03:07:49,896 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 03:07:49,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 03:07:49 BasicIcfg [2022-12-06 03:07:49,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 03:07:49,898 INFO L158 Benchmark]: Toolchain (without parser) took 848134.37ms. Allocated memory was 196.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 154.6MB in the beginning and 1.1GB in the end (delta: -902.4MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-06 03:07:49,898 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 196.1MB. Free memory is still 171.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 03:07:49,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.12ms. Allocated memory is still 196.1MB. Free memory was 154.1MB in the beginning and 140.9MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 03:07:49,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.82ms. Allocated memory is still 196.1MB. Free memory was 140.9MB in the beginning and 138.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 03:07:49,899 INFO L158 Benchmark]: Boogie Preprocessor took 36.25ms. Allocated memory is still 196.1MB. Free memory was 138.9MB in the beginning and 137.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 03:07:49,899 INFO L158 Benchmark]: RCFGBuilder took 552.69ms. Allocated memory is still 196.1MB. Free memory was 136.8MB in the beginning and 112.7MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 03:07:49,899 INFO L158 Benchmark]: TraceAbstraction took 847210.01ms. Allocated memory was 196.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 112.1MB in the beginning and 1.1GB in the end (delta: -944.9MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-06 03:07:49,900 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.08ms. Allocated memory is still 196.1MB. Free memory is still 171.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 277.12ms. Allocated memory is still 196.1MB. Free memory was 154.1MB in the beginning and 140.9MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.82ms. Allocated memory is still 196.1MB. Free memory was 140.9MB in the beginning and 138.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.25ms. Allocated memory is still 196.1MB. Free memory was 138.9MB in the beginning and 137.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 552.69ms. Allocated memory is still 196.1MB. Free memory was 136.8MB in the beginning and 112.7MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 847210.01ms. Allocated memory was 196.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 112.1MB in the beginning and 1.1GB in the end (delta: -944.9MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 155 PlacesBefore, 25 PlacesAfterwards, 163 TransitionsBefore, 23 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 110 TrivialYvCompositions, 20 ConcurrentYvCompositions, 10 ChoiceCompositions, 140 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 454, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 482, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 423, independent: 408, independent conditional: 0, independent unconditional: 408, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 423, independent: 407, independent conditional: 0, independent unconditional: 407, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 482, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 423, unknown conditional: 0, unknown unconditional: 423] , Statistics on independence cache: Total cache size (in pairs): 638, Positive cache size: 623, Positive conditional cache size: 0, Positive unconditional cache size: 623, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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, 28 PlacesBefore, 28 PlacesAfterwards, 35 TransitionsBefore, 35 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.3s, 31 PlacesBefore, 30 PlacesAfterwards, 36 TransitionsBefore, 35 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, 34 PlacesBefore, 34 PlacesAfterwards, 66 TransitionsBefore, 66 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, 37 PlacesBefore, 37 PlacesAfterwards, 103 TransitionsBefore, 103 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, 39 PlacesBefore, 39 PlacesAfterwards, 167 TransitionsBefore, 167 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, 204 TransitionsBefore, 204 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.5s, 46 PlacesBefore, 45 PlacesAfterwards, 273 TransitionsBefore, 272 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: 7.2s, 114 PlacesBefore, 111 PlacesAfterwards, 1828 TransitionsBefore, 1825 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 139 PlacesBefore, 138 PlacesAfterwards, 3359 TransitionsBefore, 3358 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: 3.2s, 161 PlacesBefore, 160 PlacesAfterwards, 4433 TransitionsBefore, 4432 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, 178 PlacesBefore, 178 PlacesAfterwards, 5220 TransitionsBefore, 5220 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 202 PlacesBefore, 201 PlacesAfterwards, 5510 TransitionsBefore, 5509 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, 204 PlacesBefore, 204 PlacesAfterwards, 6703 TransitionsBefore, 6703 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, 207 PlacesBefore, 207 PlacesAfterwards, 6836 TransitionsBefore, 6836 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: 23.4s, 355 PlacesBefore, 347 PlacesAfterwards, 13833 TransitionsBefore, 13825 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 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.2s, 418 PlacesBefore, 417 PlacesAfterwards, 18064 TransitionsBefore, 18063 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 23 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 23 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 23 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 11ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 183 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 847.1s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 434.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 378 mSolverCounterUnknown, 4482 SdHoareTripleChecker+Valid, 33.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4482 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 32.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 214 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 1117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11146 IncrementalHoareTripleChecker+Invalid, 12855 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1117 mSolverCounterUnsat, 3 mSDtfsCounter, 11146 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 751 GetRequests, 201 SyntacticMatches, 6 SemanticMatches, 544 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 16736 ImplicationChecksByTransitivity, 158.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=618673occurred in iteration=16, InterpolantAutomatonStates: 441, 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.9s SatisfiabilityAnalysisTime, 20.3s InterpolantComputationTime, 476 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 583 ConstructedInterpolants, 75 QuantifiedInterpolants, 17786 SizeOfPredicates, 186 NumberOfNonLiveVariables, 2266 ConjunctsInSsa, 323 ConjunctsInUnsatCore, 32 InterpolantComputations, 9 PerfectInterpolantSequences, 35/121 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